DSpace Repository

Simple Performance Bounds for Multicore and Parallel Channel Systems

Show simple item record

dc.contributor.author Robertazzi, Thomas G.
dc.contributor.author Gamboa, Carlos
dc.date.accessioned 2010-09-01T14:13:25Z
dc.date.available 2010-09-01T14:13:25Z
dc.date.issued 2010-07-19
dc.identifier.uri http://hdl.handle.net/1951/48182
dc.description.abstract 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. en
dc.language.iso en_US en
dc.publisher Stony Brook University. College of Engineering and Applied Sciences. en
dc.relation.ispartofseries CEAS Technical Report;832
dc.subject Communications Systems en
dc.subject Divisible Load Scheduling en
dc.subject Scheduled Networked Computing en
dc.subject Multicore Systems en
dc.title Simple Performance Bounds for Multicore and Parallel Channel Systems en
dc.type Technical Report en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account