Show simple item record

dc.contributor.otherPreservation Department, Stony Brook University Libraries.en_US
dc.contributor.otherCataloging & Metadata Department, Stony Brook University Libraries.en_US
dc.identifier.urihttp://hdl.handle.net/1951/48182
dc.identifier.urihttp://hdl.handle.net/11401/65961
dc.descriptionleave(s) : ill; 28 cm.en_US
dc.formatMonograph.en_US
dc.format.mediumElectronic Resource.en_US
dc.language.isoen_US
dc.rightsAll Rights Reserved. Stony Brook University.en_US
dc.subject.otherCommunications Systemsen
dc.subject.otherDivisible Load Schedulingen
dc.subject.otherScheduled Networked Computingen
dc.subject.otherMulticore Systemsen
dc.typeTechnical Reporten
dcterms.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
dcterms.creatorRobertazzi, Thomas G.
dcterms.creatorGamboa, Carlos
dcterms.dateAccepted2010-09-01T14:13:25Z
dcterms.dateAccepted2015-04-24T14:29:07Z
dcterms.dateSubmitted2010-09-01T14:13:25Z
dcterms.dateSubmitted2015-04-24T14:29:07Z
dcterms.descriptionCEAS Technical Report;832
dcterms.issued2010en_US
dcterms.provenanceSubmitted by Jason Torre (fjason.torre@stonybrook.edu) on 2010-09-01T14:13:25Z No. of bitstreams: 1 CEAS-832-Gamboa-Robertazzi-July-19-2010.pdf: 620578 bytes, checksum: 9765d4c20e49f0d85dd2a2c0db71de44 (MD5)en
dcterms.provenanceMade available in DSpace on 2010-09-01T14:13:25Z (GMT). No. of bitstreams: 1 CEAS-832-Gamboa-Robertazzi-July-19-2010.pdf: 620578 bytes, checksum: 9765d4c20e49f0d85dd2a2c0db71de44 (MD5) Previous issue date: 2010-07-19en
dcterms.provenanceMade available in DSpace on 2015-04-24T14:29:07Z (GMT). No. of bitstreams: 3 CEAS-832-Gamboa-Robertazzi-July-19-2010.pdf.jpg: 1142 bytes, checksum: f759fbc928fa693e571c1e0e31f2d1be (MD5) CEAS-832-Gamboa-Robertazzi-July-19-2010.pdf: 620578 bytes, checksum: 9765d4c20e49f0d85dd2a2c0db71de44 (MD5) CEAS-832-Gamboa-Robertazzi-July-19-2010.pdf.txt: 32429 bytes, checksum: e3c7999762c8b5f5cacec5d82dd2c3fb (MD5) Previous issue date: 2010-07-19en
dcterms.publisherStony Brook University. College of Engineering and Applied Sciences.en
dcterms.publisherStony Brook University.en_US
dcterms.subjectCommunications Systemsen
dcterms.subjectDivisible Load Schedulingen
dcterms.subjectScheduled Networked Computingen
dcterms.subjectMulticore Systemsen
dcterms.titleSimple Performance Bounds for Multicore and Parallel Channel Systemsen
dc.description.contributorThe content contained herein is maintained and curated by the Preservation Department.en_US
dc.description.contributorThis record is revised and maintained by the content administrators from the Cataloging & Metadata Department.en_US
dc.publisher.locationStony Brook, NY.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record