Show simple item record

dc.contributor.authorRobertazzi, Thomas G.
dc.contributor.authorGamboa, Carlos
dc.date.accessioned2010-09-01T14:13:25Z
dc.date.available2010-09-01T14:13:25Z
dc.date.issued2010-07-19
dc.identifier.urihttp://hdl.handle.net/1951/48182
dc.description.abstractA 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.en
dc.language.isoen_USen
dc.publisherStony Brook University. College of Engineering and Applied Sciences.en
dc.relation.ispartofseriesCEAS Technical Report;832
dc.subjectCommunications Systemsen
dc.subjectDivisible Load Schedulingen
dc.subjectScheduled Networked Computingen
dc.subjectMulticore Systemsen
dc.titleSimple Performance Bounds for Multicore and Parallel Channel Systemsen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record