| Document Date: 2011-02-16 09:43:38
Open Document File Size: 570,20 KBShare Result on Facebook
Country United States / / / Facility D. P. Anderson University of California / Osaka University / / IndustryTerm worker operating systems / pull-style volunteer computing environments / low latency computing / evolutionary based optimization algorithms / low latency computing model / volunteer computing projects / latency computing / client software / volunteer computing workers / higher computing efficiency / e-heien / actual systems / actual volunteer computing project / volunteer computing systems / public-resource computing / few guarantees about network / synchronous batch computing / actual volunteer computing environments / low latency batch computing / scheduling algorithms / computing / machine/network / suitable algorithms / later algorithms / volunteer computing environments / grid computing environments / volunteer computing / / OperatingSystem Windows Vista / UNIX / Mac OS X / Windows XP / Linux / Microsoft Windows / / Organization Graduate School / Anderson University / University of California / Berkeley / Osaka University / / Person Theorem / Kenichi Hagihara / Eric Martin Heien / Corollary / David P. Anderson / / Position Author / standard VC worker / Analyzing Worker / Sample Worker / Modeling VC Worker Communication / Available Workers Worker / worker / single worker / unavailable worker / permanent worker / Worker Lifespan Worker / / ProvinceOrState California / / Technology 4 Task Distribution Algorithms / network address translation / evolutionary based optimization algorithms / simulation / operating systems / UNIX/Linux / / URL Springerlink.com / /
SocialTag |
J Grid Computing DOIs10723Computing Low Latency Batches with Unreliable Workers in Volunteer Computing Environments Eric Martin Heien · David P. Anderson ·