Show simple item record

dc.contributor.otherPreservation Department, Stony Brook University Libraries.en_US
dc.contributor.otherCataloging & Metadata Department, Stony Brook University Libraries.en_US
dc.identifier.otherCEAS--810
dc.identifier.urihttp://hdl.handle.net/1951/412
dc.identifier.urihttp://hdl.handle.net/11401/65558
dc.descriptionleave(s) : ill; 28 cm.en_US
dc.description31 p.: 27 cm.en
dc.formatMonograph.en_US
dc.format.extent1196533 bytes
dc.format.mediumElectronic Resource.en_US
dc.language.isoen_US
dc.rightsAll Rights Reserved. Stony Brook University.en_US
dc.subject.otherScalabilityen
dc.subject.otherDivisible load schedulingen
dc.subject.otherStore and forward switchingen
dc.subject.otherMultilevel tree networken
dc.subject.otherNonlinear Computational Loadsen
dc.typeTechnical Reporten
dcterms.abstractIt 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.en
dcterms.creatorHung, Jui Tsun
dcterms.creatorRobertazzi, Thomas G.
dcterms.dateAccepted2005-07-18T15:56:28Z
dcterms.dateAccepted2015-04-24T14:27:39Z
dcterms.dateSubmitted2005-07-18T15:56:28Z
dcterms.dateSubmitted2015-04-24T14:27:39Z
dcterms.descriptionCEAS Technical Reporten
dcterms.description810en
dcterms.formatapplication/pdf
dcterms.isFormatOfIEEE Transactions on Parallel Systems, Vol. XX, No. Y, Month 2003 July 6, 2003.en
dcterms.issued2004en_US
dcterms.provenanceSubmitted by Jason Torre (fjason.torre@stonybrook.edu) on 2005-07-18T15:56:27Z No. of bitstreams: 1 CEAS_810.pdf: 1196533 bytes, checksum: 1f0c66d071a02c370da11c92c4368026 (MD5)en
dcterms.provenanceMade available in DSpace on 2005-07-18T15:56:28Z (GMT). No. of bitstreams: 1 CEAS_810.pdf: 1196533 bytes, checksum: 1f0c66d071a02c370da11c92c4368026 (MD5) Previous issue date: 2004-04-12en
dcterms.provenanceMade available in DSpace on 2015-04-24T14:27:39Z (GMT). No. of bitstreams: 3 CEAS_810.pdf.jpg: 838 bytes, checksum: 4f2fd08e619cbe302a4bce2317f12b8e (MD5) CEAS_810.pdf.txt: 31 bytes, checksum: 792680ea1ef80bbcb0718ee7aa1e2a75 (MD5) CEAS_810.pdf: 1196533 bytes, checksum: 1f0c66d071a02c370da11c92c4368026 (MD5) Previous issue date: 2004-04-12en
dcterms.publisherState University of New York at Stony Brook, College of Engineering.en
dcterms.publisherStony Brook University.en_US
dcterms.subjectScalabilityen
dcterms.subjectDivisible load schedulingen
dcterms.subjectStore and forward switchingen
dcterms.subjectMultilevel tree networken
dcterms.subjectNonlinear Computational Loadsen
dcterms.titleScheduling Nonlinear Computational Loadsen
dc.description.contributorThe content contained herein is maintained and curated by the Preservation Department.en_US
dc.description.contributorThis record is revised and maintained by the content administrators from the Cataloging & Metadata Department.en_US
dc.publisher.locationStony Brook, NY.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record