{"@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":"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/11401/65087"},{"label":"dc.language.iso","value":"en_US"},{"label":"dc.relation.ispartofseries","value":"CEAS Technical Report"},{"label":"dc.rights","value":"All Rights Reserved.  Stony Brook University."},{"label":"dc.subject.other","value":"Multilevel tree network"},{"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":"Hung, Jui Tsun"},{"label":"dcterms.dateAccepted","value":"2015-04-24T14:25:52Z"},{"label":"dcterms.dateSubmitted","value":"2005-07-18T15:56:28Z"},{"label":"dcterms.extent","value":"31 p.: 27 cm."},{"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-04-12"},{"label":"dcterms.provenance","value":"Made available in DSpace on 2005-07-18T15:56:28Z (GMT). No. of bitstreams: 1\nCEAS_810.pdf: 1196533 bytes, checksum: 1f0c66d071a02c370da11c92c4368026 (MD5)\n  Previous issue date: 2004-04-12"},{"label":"dcterms.publisher","value":"Stony Brook University."},{"label":"dcterms.subject","value":"Store and forward switching"},{"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/18%2F64%2F19%2F18641919318324844166103999888880243843/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/18%2F64%2F19%2F18641919318324844166103999888880243843","profile":"http://iiif.io/api/image/2/level2.json"}},"on":"https://repo.library.stonybrook.edu/cantaloupe/iiif/2/canvas/page-1.json"}]}]}]}