Hypercube communication delay with wormhole routing

1994 ◽  
Vol 43 (7) ◽  
pp. 806-814 ◽  
Author(s):  
Jong Kim ◽  
C.R. Das
Author(s):  
Biswaroop Maiti ◽  
Rajmohan Rajaraman ◽  
David Stalfa ◽  
Zoya Svitkina ◽  
Aravindan Vijayaraghavan

1995 ◽  
Vol 05 (03) ◽  
pp. 331-341 ◽  
Author(s):  
MICHAEL G. NORMAN ◽  
SUSANNA PELAGATTI ◽  
PETER THANISCH

We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.


2005 ◽  
Vol 25 (5) ◽  
pp. 1093-1105 ◽  
Author(s):  
Hong-Yong Yang ◽  
Yu-Ping Tian

Sign in / Sign up

Export Citation Format

Share Document