Task allocation method and task allocation apparatus

Details Task allocation method and task allocation apparatus Task allocation method and task allocation apparatus

2011-04-19

2011-04-19

Patel, Ashok B (Department: 2491)

Electrical computers and digital processing systems: multicomput

Distributed data processing

Processing agent

C718S100000, C709S221000

Reexamination Certificate

active

07930339

ABSTRACT:
A distributed processing system includes plural nodes each provided with a processor and communicably connected to each other. A task information obtaining unit obtains antecedent dependency between tasks. A node information obtaining unit obtains a time constraint imposed on the tasks. A start time computing unit computes an absolute earliest start time at which a task can be started and an absolute latest start time allowed in order to complete the task within the time constraint, by referring to the time constraint. A node selector selects a destination node to which a target task not yet allocated to a node should be allocated, by referring to the absolute earliest start time and the absolute latest start time. A task placement unit causes the task to be executed in the selected node.

REFERENCES:
patent: 5980093 (1999-11-01), Jones et al.
patent: 6385636 (2002-05-01), Suzuki
patent: 6430594 (2002-08-01), Akiyama
patent: 6633942 (2003-10-01), Balasubramanian
patent: 6948172 (2005-09-01), D'Souza
patent: 2002/0124012 (2002-09-01), Liem et al.
patent: 2003/0135621 (2003-07-01), Romagnoli
patent: 2003/0140172 (2003-07-01), Woods et al.
patent: 2005/0141023 (2005-06-01), Yagita et al.
patent: 05-250338 (1993-09-01), None
patent: 10228385 (1998-08-01), None
patent: 2001166816 (2001-06-01), None
Jon Quarfoth, Task Allocation Algorithms With Communication Costs Considered, 2005, University of Minnesota, p. 6-7 (as attached).
Robert T. Futrell; Donald F. Shafer; Linda I. Safer, Quality Software Project Management, Jan. 24, 2002, Prentice Hall, pp. 1-11 (as attached).
European Search Report for Corresponding European Application No. 06255820.0.
Yu-Kwong Kwok et al: “Static scheduling algorithms for allocating directed task graphs to multiprocessors” ACM Computing Surveys ACM USA, vol. 31, No. 4, Dec. 1999, pp. 406-471.
Yu-Kwong Kwok et al: “Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors” IEEE Transactions on Parallel and Distributed Systems IEEE USA, vol. 7, No. 5, May 1996, pp. 506-521.
Wu M-Y et al: “Hypertool: a programing aid for message-passing systems” IEEE Transactions on parallel and Distributed Systems USA, vol. 1. No. 3, Jul. 1990, pp. 330-343.
Yu-Kwong Kwok, Ishfaq Ahmad: “Benchmarking and Comparison of the Task Graph Scheduling Algorithms” Journal of Parallel and Distributed Computing Mar. 17, 1999.
Chinese Office Action for corresponding Chinese Application No. 200610160369.4, Nov. 20, 2009.
Yu-Kwong Kwok et al: “Static Scheduling Algorithms for allocating Directed Task Graphs to Multiprocessors” ACM Computing Surveys, vol. 31, No. 4, Dec. 1999.
Office Action for corresponding Japanese Application No. 2005-330887, dated Aug. 24, 2010.

Affiliated with

Also associated with

Rating

Task allocation method and task allocation apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Task allocation method and task allocation apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Task allocation method and task allocation apparatus will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2669559