Hierarchical fair scheduling algorithm in a distributed...

Details Hierarchical fair scheduling algorithm in a distributed... Hierarchical fair scheduling algorithm in a distributed...

2006-07-25

2010-12-28

Nguyen, Phuoc (Department: 2443)

Electrical computers and digital processing systems: multicomput

Distributed data processing

C709S223000, C709S224000

Reexamination Certificate

active

07860918

ABSTRACT:
The present invention provides embodiments of a network monitoring system that includes a scheduling agent for generating groupings of test agents and scheduling network measurements to be performed by each test agent grouping. The system may provide identifiers to members of first and second sets of objects. Then, the system can generate first and second sequences of the identifiers for each of the first and second sets, respectively and associate the identifiers to provide a plurality of groupings of identifiers. Finally the system may schedule a corresponding event for each of the grouping of identifiers. The systems and methods present can require very little state memory, ensure fair coverage of the object groupings; and can avoid the problems associated with round robin scheduling.

REFERENCES:
patent: 4187392 (1980-02-01), Safford
patent: 5271000 (1993-12-01), Engbersen et al.
patent: 5448639 (1995-09-01), Arazi
patent: 5610951 (1997-03-01), Higginson et al.
patent: 5768520 (1998-06-01), Dan et al.
patent: 6192354 (2001-02-01), Bigus et al.
patent: 6483811 (2002-11-01), Jabbarnezhad
patent: 6704883 (2004-03-01), Zhang et al.
patent: 6934934 (2005-08-01), Osborne et al.
patent: 6963533 (2005-11-01), Kukic
patent: 7031264 (2006-04-01), Adhikari et al.
patent: 7161902 (2007-01-01), Carter et al.
patent: 7386522 (2008-06-01), Bigus et al.
patent: 2003/0084010 (2003-05-01), Bigus et al.
patent: 2004/0010584 (2004-01-01), Peterson et al.
patent: 2004/0057580 (2004-03-01), Tie et al.
patent: 2004/0071085 (2004-04-01), Shaham et al.
patent: 2004/0121749 (2004-06-01), Cui et al.
patent: 2005/0068907 (2005-03-01), Garg et al.
patent: 2006/0050649 (2006-03-01), Botton-Dascal et al.
patent: 2007/0076605 (2007-04-01), Cidon et al.
“Modular arithmetic” from Wikipedia, the free encyclopedia; http://en.wikipedia.org/wiki/Modular—arithmetic; printed Nov. 14, 2005; 4 pages.
“Modular Arithmetic”; http://www.cut-the-knot.org/blue/Modulo.shtml; printed Nov. 14, 2005; 4 pages.
“Primitive root modul n”; http://primitive-root-modulo-n.area51.ipupdater.com/; printed Nov. 14, 2005; 2 pages.
“Coprime” from Wikipedia, the free encyclopedia; http://en.wikipedia.org/wiki/Coprime; printed Nov. 14, 2005; 2 pages.
“Relatively Prime”; from Mathworld; http://mathworld.wolfram.com/RelativelyPrime.html; printed Nov. 14, 2005; 3 pages.
PlanetMath.org; definition of coprime; http://planetmath.org/encyclopedia/Coprime.html; printed Nov. 14, 2005; 1 page.
Sebastián Martin Ruiz; “Applications of Smarandache Function, and Prime and Coprime Functions” Smaranda@teleline.es; www.terra.es/personal/smaranda; American Research Press Rehoboth 2002; 25 pages.
Paul Garrett; “Abstract Algebra: Lectures and Worked Examples for a Graduate Course”; Jul. 8, 2005; http://www.math.umn.edu/˜garrett/; 222 pages.

Affiliated with

Also associated with

Rating

Hierarchical fair scheduling algorithm in a distributed... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Hierarchical fair scheduling algorithm in a distributed..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical fair scheduling algorithm in a distributed... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4154509