{"@context":"http://iiif.io/api/presentation/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/manifest.json","@type":"sc:Manifest","label":"Simple Performance Bounds for Multicore and Parallel Channel Systems","metadata":[{"label":"dc.contributor.other","value":"Cataloging & Metadata Department, Stony Brook University Libraries."},{"label":"dc.description","value":"leave(s) : ill;  28 cm."},{"label":"dc.description.contributor","value":"This record is revised and maintained by the content administrators from the Cataloging & Metadata Department."},{"label":"dc.format","value":"Monograph."},{"label":"dc.format.medium","value":"Electronic Resource."},{"label":"dc.identifier.uri","value":"http://hdl.handle.net/11401/65961"},{"label":"dc.language.iso","value":"en_US"},{"label":"dc.publisher.location","value":"Stony Brook, NY."},{"label":"dc.rights","value":"All Rights Reserved.  Stony Brook University."},{"label":"dc.subject.other","value":"Divisible Load Scheduling"},{"label":"dcterms.abstract","value":"A simple modi cation of existing divisible load scheduling algo-\nrithms, boosting link speed by M for M parallel channels per link,\nallows time optimal load scheduling and performance prediction for\nparallel channel systems. The situation for multicore models is more\ncomplex but can be handled by a substitution involving equivalent pro-\ncessor speed. These modi cations yield upper bounds on such parallel\nsystems' performance. This concept is illustrated for ideal single level\n(star) tree networks under a variety of scheduling policies. Less than\nideal parallelism can also be modeled though mechanisms of ine ciency\nrequire further research."},{"label":"dcterms.creator","value":"Robertazzi, Thomas G."},{"label":"dcterms.dateAccepted","value":"2010-09-01T14:13:25Z"},{"label":"dcterms.dateSubmitted","value":"2015-04-24T14:29:07Z"},{"label":"dcterms.description","value":"CEAS Technical Report;832"},{"label":"dcterms.issued","value":"2010"},{"label":"dcterms.provenance","value":"Made available in DSpace on 2010-09-01T14:13:25Z (GMT). No. of bitstreams: 1\nCEAS-832-Gamboa-Robertazzi-July-19-2010.pdf: 620578 bytes, checksum: 9765d4c20e49f0d85dd2a2c0db71de44 (MD5)\n  Previous issue date: 2010-07-19"},{"label":"dcterms.publisher","value":"Stony Brook University."},{"label":"dcterms.subject","value":"Divisible Load Scheduling"},{"label":"dcterms.title","value":"Simple Performance Bounds for Multicore and Parallel Channel Systems"},{"label":"dc.type","value":"Technical Report"}],"description":"This manifest was generated dynamically","viewingDirection":"left-to-right","sequences":[{"@type":"sc:Sequence","canvases":[{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json","@type":"sc:Canvas","label":"Page 1","height":1650,"width":1275,"images":[{"@type":"oa:Annotation","motivation":"sc:painting","resource":{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/12%2F24%2F59%2F122459463279786053303078388521423146912/full/full/0/default.jpg","@type":"dctypes:Image","format":"image/jpeg","height":1650,"width":1275,"service":{"@context":"http://iiif.io/api/image/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/12%2F24%2F59%2F122459463279786053303078388521423146912","profile":"http://iiif.io/api/image/2/level2.json"}},"on":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json"}]}]}]}