Finding a Feasible Schedule on a Tree-Connected Processor System

Tsuyoshi Kawaguchi, Seiki Kyan, Kenji Onaga. Finding a Feasible Schedule on a Tree-Connected Processor System. Systems and Computers in Japan, 20(12):48-57, 1989. [doi]

@article{KawaguchiKO89,
  title = {Finding a Feasible Schedule on a Tree-Connected Processor System},
  author = {Tsuyoshi Kawaguchi and Seiki Kyan and Kenji Onaga},
  year = {1989},
  doi = {10.1002/scj.4690201205},
  url = {http://dx.doi.org/10.1002/scj.4690201205},
  researchr = {https://researchr.org/publication/KawaguchiKO89},
  cites = {0},
  citedby = {0},
  journal = {Systems and Computers in Japan},
  volume = {20},
  number = {12},
  pages = {48-57},
}