Scheduling Precedence Graphs in Systems with Interprocessor Communication Times

The problem of nonpreemptively scheduling a set of $m$ partially ordered tasks on $n$ identical processors subject to interprocessor communication delays is studied in an effort to minimize the makespan. A new heuristic, called Earliest Task First (ETF), is designed and analyzed. It is shown that th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on computing Ročník 18; číslo 2; s. 244 - 257
Hlavní autoři: Hwang, Jing-Jang, Chow, Yuan-Chieh, Anger, Frank D., Lee, Chung-Yee
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1989
Témata:
Algorithms
Applied sciences
Communication
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Heuristic
Job shops
Schedules
Scheduling
Software
Multiprocessor
Graph
Integrated planning
Heuristic method
Transmission protocol
Computer system
Distributed system
Modeling
Delay
ISSN:0097-5397, 1095-7111
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The problem of nonpreemptively scheduling a set of $m$ partially ordered tasks on $n$ identical processors subject to interprocessor communication delays is studied in an effort to minimize the makespan. A new heuristic, called Earliest Task First (ETF), is designed and analyzed. It is shown that the makespan $\omega _{{\text{ETF}}} $ generated by ETF always satisfies $\omega _{{\text{ETF}}} \leqq ({{2 - 1} / n})\omega _{{\text{opt}}}^{(i)} + C$, where $\omega _{{\text{opt}}}^{(i)} $ is the optimal makespan without considering communication delays and $C$ is the communication requirements over some immediate predecessor-immediate successor pairs along one chain. An algorithm is also provided to calculate $C$. The time complexity of Algorithm ETF is $O(nm^2 )$.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0097-5397
1095-7111
DOI:10.1137/0218016