Simple Performance Bounds for Multicore and Parallel Channel Systems
Robertazzi, Thomas G.
MetadataShow full item record
SubjectCommunications Systems; Divisible Load Scheduling; Scheduled Networked Computing; Multicore Systems
A simple modi cation of existing divisible load scheduling algo- rithms, boosting link speed by M for M parallel channels per link, allows time optimal load scheduling and performance prediction for parallel channel systems. The situation for multicore models is more complex but can be handled by a substitution involving equivalent pro- cessor speed. These modi cations yield upper bounds on such parallel systems' performance. This concept is illustrated for ideal single level (star) tree networks under a variety of scheduling policies. Less than ideal parallelism can also be modeled though mechanisms of ine ciency require further research.