{"@context":"http://iiif.io/api/presentation/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/manifest.json","@type":"sc:Manifest","label":"Scheduling Nonlinear Computational Loads","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.extent","value":"1196533 bytes"},{"label":"dc.format.medium","value":"Electronic Resource."},{"label":"dc.identifier.other","value":"CEAS--810"},{"label":"dc.identifier.uri","value":"http://hdl.handle.net/1951/412"},{"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":"Scalability"},{"label":"dcterms.abstract","value":"It is demonstrated that supra-linear (greater than linear) speedup is possible in processing distributed divisible computational loads when computation time is a nonlinear function of load size.  This result is radically different from the traditional distributed processing of divisible computational loads with linear processing complexity appearing in over 50 journal papers."},{"label":"dcterms.creator","value":"Robertazzi, Thomas G."},{"label":"dcterms.dateAccepted","value":"2015-04-24T14:27:39Z"},{"label":"dcterms.dateSubmitted","value":"2015-04-24T14:27:39Z"},{"label":"dcterms.description","value":"CEAS Technical Report"},{"label":"dcterms.format","value":"application/pdf"},{"label":"dcterms.isFormatOf","value":"IEEE Transactions on Parallel Systems, Vol. XX, No. Y, Month 2003 July 6, 2003."},{"label":"dcterms.issued","value":"2004"},{"label":"dcterms.provenance","value":"Made available in DSpace on 2015-04-24T14:27:39Z (GMT). No. of bitstreams: 3\nCEAS_810.pdf.jpg: 838 bytes, checksum: 4f2fd08e619cbe302a4bce2317f12b8e (MD5)\nCEAS_810.pdf.txt: 31 bytes, checksum: 792680ea1ef80bbcb0718ee7aa1e2a75 (MD5)\nCEAS_810.pdf: 1196533 bytes, checksum: 1f0c66d071a02c370da11c92c4368026 (MD5)\n  Previous issue date: 2004-04-12"},{"label":"dcterms.publisher","value":"State University of New York at Stony Brook, College of Engineering."},{"label":"dcterms.subject","value":"Scalability"},{"label":"dcterms.title","value":"Scheduling Nonlinear Computational Loads"},{"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":1271,"images":[{"@type":"oa:Annotation","motivation":"sc:painting","resource":{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/42%2F93%2F43%2F4293437818820838641410212486783581094/full/full/0/default.jpg","@type":"dctypes:Image","format":"image/jpeg","height":1650,"width":1271,"service":{"@context":"http://iiif.io/api/image/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/42%2F93%2F43%2F4293437818820838641410212486783581094","profile":"http://iiif.io/api/image/2/level2.json"}},"on":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json"}]}]}]}