"Finding a Feasible Schedule on a Tree-Connected Processor System."

Tsuyoshi Kawaguchi, Seiki Kyan, Kenji Onaga (1989)

> Home

Details and statistics

DOI: 10.1002/SCJ.4690201205

access: closed

type: Journal Article

metadata version: 2023-09-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scjapan/KawaguchiKO89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scjapan/KawaguchiKO89
Tsuyoshi Kawaguchi, Seiki Kyan, Kenji Onaga:
Finding a Feasible Schedule on a Tree-Connected Processor System. Syst. Comput. Jpn. 20(12): 48-57 (1989)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.