Naive versus Optimal Scheduling for Data Intensive Applications

dc.contributor.author	Robertazzi, Thomas G.
dc.contributor.author	Ko, Kwangil
dc.date.accessioned	2005-07-19T15:22:24Z
dc.date.available	2005-07-19T15:22:24Z
dc.date.issued	2003-07-17
dc.identifier.other	CEAS--808
dc.identifier.uri	http://hdl.handle.net/1951/569
dc.description	40 p.: 27 cm.	en
dc.format.extent	953904 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en_US	en
dc.publisher	State University of New York at Stony Brook, College of Engineering.	en
dc.relation.ispartofseries	CEAS Technical Report	en
dc.relation.ispartofseries	808	en
dc.subject	Data Intensive Applications	en
dc.subject	Divisible Computation	en
dc.subject	Sensor Networks	en
dc.title	Naive versus Optimal Scheduling for Data Intensive Applications	en
dc.type	Technical Report	en

Files in this item

Community Members' Scholarship
This collection contains technical reports, articles and other published and unpublished scholarship authored by the college's diverse scholarly and research community.
Technical Reports