Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (1)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
This paper proposes two techniques for obtaining a sharp lower bound for the multiprocessor scheduling problem (MSP) with non-negligible communication delay. In the proposed techniques, we apply the notion of inevitable communication delay to obtain a nontrivial lower bound on the scheduling length. The effectiveness of the derived bound is evaluated by… (More)
p. xiii Parallel and Multi-Computing (1) A New List Scheduling Method Based on Structural Properties of Task Graphs p. 3 A New Model of Exploiting Loop Parallelization Using Knowledge-Based Techniques p. 9 Network Based Genetic Algorithm p. 15 Parallel and Multi-Computing (2) A Memory Management Architecture for a Mobile Computing Environment p. 23… (More)