Please use this identifier to cite or link to this item:
|Title:||Scheduling Nonlinear Computational Loads|
|Authors:||Hung, Jui Tsun|
Robertazzi, Thomas G.
Preservation Department, Stony Brook University Libraries.
Cataloging & Metadata Department, Stony Brook University Libraries.
Divisible load scheduling
Store and forward switching
Multilevel tree network
Nonlinear Computational Loads
|Publisher:||State University of New York at Stony Brook, College of Engineering.|
Stony Brook University.
|Citation:||IEEE Transactions on Parallel Systems, Vol. XX, No. Y, Month 2003 July 6, 2003.|
|Series/Report no.:||CEAS Technical Report|
|Abstract:||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.|
|Description:||leave(s) : ill; 28 cm.|
31 p.: 27 cm.
|Appears in Collections:||Technical Reports|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.