{"@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.contributor","value":"The content contained herein is maintained and curated by the Preservation Department."},{"label":"dc.format","value":"Monograph."},{"label":"dc.format.extent","value":"301805 bytes"},{"label":"dc.format.medium","value":"Electronic Resource."},{"label":"dc.identifier.uri","value":"http://hdl.handle.net/1951/36194"},{"label":"dc.language.iso","value":"en_US"},{"label":"dc.relation.ispartofseries","value":"CEAS"},{"label":"dc.rights","value":"All Rights Reserved. Stony Brook University."},{"label":"dc.subject.other","value":"Divisible load scheduling"},{"label":"dcterms.abstract","value":"A scheduling model is studied where the computing time function of each node is a nonlinear function\nof the size of its assigned load. Speedup and closed form solutions for optimal load allocation are\nobtained for simultaneous load distribution. An iterative solution technique is presented for sequential load\ndistribution. Super-linear speedup is possible when the computing time function is a nonlinear function\nof the amount of fractional load assigned."},{"label":"dcterms.creator","value":"Robertazzi, Thomas G."},{"label":"dcterms.dateAccepted","value":"2015-04-24T14:25:55Z"},{"label":"dcterms.dateSubmitted","value":"2006-10-24T20:27:58Z"},{"label":"dcterms.extent","value":"leave(s) : ill; 28 cm."},{"label":"dcterms.format","value":"application/pdf"},{"label":"dcterms.isFormatOf","value":"CEAS Technical Report 823"},{"label":"dcterms.issued","value":"2006-09-05"},{"label":"dcterms.provenance","value":"Made available in DSpace on 2006-10-24T20:27:58Z (GMT). No. of bitstreams: 1\nCEAS--823.pdf: 301805 bytes, checksum: b7f3d555f344edecbae6330cdbff0735 (MD5)\n Previous issue date: 2006-09-05"},{"label":"dcterms.publisher","value":"Stony Brook University."},{"label":"dcterms.subject","value":"Divisible load scheduling"},{"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":1754,"width":1240,"images":[{"@type":"oa:Annotation","motivation":"sc:painting","resource":{"@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/14%2F04%2F64%2F140464472858131498103102381040326541032/full/full/0/default.jpg","@type":"dctypes:Image","format":"image/jpeg","height":1754,"width":1240,"service":{"@context":"http://iiif.io/api/image/2/context.json","@id":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/14%2F04%2F64%2F140464472858131498103102381040326541032","profile":"http://iiif.io/api/image/2/level2.json"}},"on":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json"}]}]}]}