Task assignment in loosely‐coupled multiprocessor systems

Chen, Wen‐Tsuen; Sheu, Jang‐Ping

doi:10.1080/02533839.1987.9677032

Cited by 8 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the assigned module A, we have For the activated but unassigned modules B and c, both of them can be assigned to processors 1 and 2 . Hence, using equations ( 8 ) and (9). we obtain (3) FEB -min{ max(40,40)+50, max(O,40+10}+1oo ) = go;…”

Section: Yi Conclusionmentioning

confidence: 99%

Minimization of task turnaround time for distributed systems

Hsu¹,

Wang²,

Kuo³

[1989] Proceedings of the Thirteenth Annual International Computer Software &Amp; Applications Conference

View full text Add to dashboard Cite

This paper deals with the problem of assigning a partitioned task to a distributed computing system. Considering communication overhead and idle time, we successfully develop a mathematical model to describe the cost function, which is defined to evaluate the task turnaround time, under a genaral model of distributed computing systems. Task assignment is formulated as a DUmapping, which maps a directed acyclic task graph onto an undirected system graph. The search of optimal DU-mapping is NP-complete and is transformed into a state space search problem. An approach called critical sink underestimate is developed to attain an optimal DU-mapping and the most nodes in the state space tree are pruned. Experimental results reveal that this method performs very well due to its close evaluation to the real cost.

show abstract

Section: Yi Conclusionmentioning

confidence: 99%