dc.contributor.other | Preservation Department, Stony Brook University Libraries. | en_US |
dc.contributor.other | Cataloging & Metadata Department, Stony Brook University Libraries. | en_US |
dc.identifier.uri | http://hdl.handle.net/1951/48182 | |
dc.identifier.uri | http://hdl.handle.net/11401/65961 | |
dc.description | leave(s) : ill; 28 cm. | en_US |
dc.format | Monograph. | en_US |
dc.format.medium | Electronic Resource. | en_US |
dc.language.iso | en_US | |
dc.rights | All Rights Reserved. Stony Brook University. | en_US |
dc.subject.other | Communications Systems | en |
dc.subject.other | Divisible Load Scheduling | en |
dc.subject.other | Scheduled Networked Computing | en |
dc.subject.other | Multicore Systems | en |
dc.type | Technical Report | en |
dcterms.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 |
dcterms.creator | Robertazzi, Thomas G. | |
dcterms.creator | Gamboa, Carlos | |
dcterms.dateAccepted | 2010-09-01T14:13:25Z | |
dcterms.dateAccepted | 2015-04-24T14:29:07Z | |
dcterms.dateSubmitted | 2010-09-01T14:13:25Z | |
dcterms.dateSubmitted | 2015-04-24T14:29:07Z | |
dcterms.description | CEAS Technical Report;832 | |
dcterms.issued | 2010 | en_US |
dcterms.provenance | Submitted 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.provenance | Made 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-19 | en |
dcterms.provenance | Made 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-19 | en |
dcterms.publisher | Stony Brook University. College of Engineering and Applied Sciences. | en |
dcterms.publisher | Stony Brook University. | en_US |
dcterms.subject | Communications Systems | en |
dcterms.subject | Divisible Load Scheduling | en |
dcterms.subject | Scheduled Networked Computing | en |
dcterms.subject | Multicore Systems | en |
dcterms.title | Simple Performance Bounds for Multicore and Parallel Channel Systems | en |
dc.description.contributor | The content contained herein is maintained and curated by the Preservation Department. | en_US |
dc.description.contributor | This record is revised and maintained by the content administrators from the Cataloging & Metadata Department. | en_US |
dc.publisher.location | Stony Brook, NY. | en_US |