Show simple item record

dc.contributor.authorHung, Jui Tsun
dc.contributor.authorRobertazzi, Thomas G.
dc.date.accessioned2005-07-18T15:56:28Z
dc.date.available2005-07-18T15:56:28Z
dc.date.issued2004-04-12
dc.identifier.citationIEEE Transactions on Parallel Systems, Vol. XX, No. Y, Month 2003 July 6, 2003.en
dc.identifier.otherCEAS--810
dc.identifier.urihttp://hdl.handle.net/1951/412
dc.description31 p.: 27 cm.en
dc.description.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
dc.format.extent1196533 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherState University of New York at Stony Brook, College of Engineering.en
dc.relation.ispartofseriesCEAS Technical Reporten
dc.relation.ispartofseries810en
dc.subjectScalabilityen
dc.subjectDivisible load schedulingen
dc.subjectStore and forward switchingen
dc.subjectMultilevel tree networken
dc.subjectNonlinear Computational Loadsen
dc.titleScheduling Nonlinear Computational Loadsen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record