Method and system for parallel scheduling of complex dags...

Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Health care management

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C705S002000

Reexamination Certificate

active

07908163

ABSTRACT:
A methods and systems for addressing parallel scheduling problem where a directed acyclic graph (dag) modeling t tasks and their dependencies needs to be executed on n unreliable workers. The methods and systems determine how workers get assigned to tasks (possibly in parallel and redundantly) throughout execution, so as to minimize expected completion time. Disclosed is a polynomial time method for the problem restricted to the case when dag width is at most a constant and the number of workers is also at most a constant.

REFERENCES:
patent: 5179702 (1993-01-01), Spix et al.
patent: 5202975 (1993-04-01), Rasbold et al.
patent: 5343388 (1994-08-01), Wedelin
patent: 5386562 (1995-01-01), Jain et al.
patent: 5742821 (1998-04-01), Prasanna
patent: 5768594 (1998-06-01), Blelloch et al.
patent: 5850552 (1998-12-01), Odani et al.
patent: 5887174 (1999-03-01), Simons et al.
patent: 6044222 (2000-03-01), Simons et al.
patent: 6260190 (2001-07-01), Ju
patent: 6434590 (2002-08-01), Blelloch et al.
patent: 6957202 (2005-10-01), Skaanning et al.
patent: 7627537 (2009-12-01), Lai
patent: 2006/0123009 (2006-06-01), Bruno et al.
patent: 2006/0218123 (2006-09-01), Chowdhuri et al.
Dandass, Yoginder. Generalizing List Scheduling for Stochastic Soft Real-Time Parallel Applications. Mississippi State University. Dec. 2003. p. 1-278.
Fernandez, et al.; “Understanding Simulation Solutions to Resource Constrained Project Scheduling Problems with Stochastic Task Durations”; Engineering Management Journal; vol. 10; No. 4; 1998; pp. 5-13.
Fernandez, et al.; A Model for the Resource Constrained Project Scheduling Problem with Stochastic Task Durations; 7thIndustrial Engineering Research Conference Proceedings; 1998.
Goel, et al.; “Stochastic Load Balancing and Related Problems”; 40thAnnual Symposium on Foundations of Computer Science (FOCS); 1999; pp. 579-586.
Mori, et al.; “A Resource Constrained Project Scheduling Problem with Reattempt at Failure: A Heuristic Approach”; Journal of the Operations Research Society of Japan; vol. 40; No. 1; 1997; pp. 33-44.
Narasimhan, et al.; “A Fast Approach to Computing Exact Solutions to the Resource-constrained Scheduling Problem”; ACM Transactions on Design Automation of Electronic Systems; vol. 6; No. 4; 2001; pp. 490-500.
Özdamar, et al.; A Survey on the Resource-Constrained Project Scheduling Problem; IIE Transactions; vol. 27; 1995; pp. 574-586.
Skutella, et al.; “Scheduling Precedence-constrained Jobs With Stochastic Processing Times on Parallel Machines”; 12thACM-SIAM Symposium on Discrete Algorithms (SODA); 2001; pp. 589-590.
Tseng, et al.; “A Project Scheduling Model Considering the Success Probability”; Proceedings of the Association of Asian Pacific Operational Research Societies (APROS); 1994; pp. 399-406.
Turnquist, et al.; “Allocating Time and Resources in Project Management Under Uncertainty”; Proceedings of the 36thAnnual Hawaii International Conference on System Science (HICSS); 2003; pp. 250.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and system for parallel scheduling of complex dags... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system for parallel scheduling of complex dags..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for parallel scheduling of complex dags... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2697627

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.