• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Stochastic formulations of the redundancy allocation problem (1996)

by D Coit, A Smith
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

Probabilistic allocation of tasks on desktop grids

by Joshua Wingstrom, Henri Casanova - in Proceedings of PCGrid. IEEE CS , 2008
"... While desktop grids are attractive platforms for executing parallel applications, their volatile nature has often limited their use to so-called “high-throughput ” applications. Checkpointing techniques can enable a broader class of applications. Unfortunately, a volatile host can delay the entire e ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
While desktop grids are attractive platforms for executing parallel applications, their volatile nature has often limited their use to so-called “high-throughput ” applications. Checkpointing techniques can enable a broader class of applications. Unfortunately, a volatile host can delay the entire execution for a long period of time. Allocating redundant copies of each task to hosts can alleviate this problem by increasing the likelihood that at least one instance of each application task completes successfully. In this paper we demonstrate that it is possible to use statistical characterizations of host availability to make sound task replication decisions. We find that strategies that exploit such statistical characterizations are effective when compared to alternate approaches. We show that this result holds for real-world host availability data, in spite of only imperfect statistical characterizations. 1
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University