Instruction Replication for Reducing Delays Due to Inter-PE Communication Latency

2005 ◽  
Vol 54 (12) ◽  
pp. 1496-1507 ◽  
Author(s):  
A. Aggarwal ◽  
M. Franklin
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.


Sign in / Sign up

Export Citation Format

Share Document