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.
Keywords: Divisible load scheduling
Store and forward switching,
Issue Date: 5-Sep-2006
Publisher: College of Engineering and Applied Sciences
Stony Brook University.
Citation: CEAS Technical Report 823
Series/Report no.: CEAS
Abstract: A scheduling model is studied where the computing time function of each node is a nonlinear function of the size of its assigned load. Speedup and closed form solutions for optimal load allocation are obtained for simultaneous load distribution. An iterative solution technique is presented for sequential load distribution. Super-linear speedup is possible when the computing time function is a nonlinear function of the amount of fractional load assigned.
Description: leave(s) : ill; 28 cm.
Appears in Collections:Community Members' Scholarship [CEAS]

Files in This Item:
File Description SizeFormat 
CEAS--823.pdf294.73 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.