Methods and arrangements for ordering changes in computing...

Details Methods and arrangements for ordering changes in computing... Methods and arrangements for ordering changes in computing...

2004-02-27

2009-02-24

Zhen, Wei Y (Department: 2191)

Data processing: software development, installation, and managem

Software installation

C717S120000

Reexamination Certificate

active

07496912

ABSTRACT:
Methods and arrangements for automatically determining allowable sequences of changes, e.g., sequences where the order in which changes are carried out will transition a computing system from a workable state into another workable state, are disclosed.

REFERENCES:
patent: 4751635 (1988-06-01), Kret
patent: 5493682 (1996-02-01), Tyra et al.
patent: 5634056 (1997-05-01), Casotto
patent: 5721824 (1998-02-01), Taylor
patent: 5805891 (1998-09-01), Bizuneh et al.
patent: 5805898 (1998-09-01), Barsness et al.
patent: 5835777 (1998-11-01), Staelin
patent: 5867714 (1999-02-01), Todd et al.
patent: 5890166 (1999-03-01), Eisenberg et al.
patent: 5953533 (1999-09-01), Fink et al.
patent: 5960196 (1999-09-01), Carrier, III et al.
patent: 5960206 (1999-09-01), Barsness et al.
patent: 5999740 (1999-12-01), Rowley
patent: 6009525 (1999-12-01), Horstmann
patent: 6052707 (2000-04-01), D'Souza
patent: 6192368 (2001-02-01), Gerard et al.
patent: 6345294 (2002-02-01), O'Toole et al.
patent: 6385768 (2002-05-01), Ziebell
patent: 6477660 (2002-11-01), Sohner
patent: 6675382 (2004-01-01), Foster
patent: 6681391 (2004-01-01), Marino et al.
patent: 6847970 (2005-01-01), Keller et al.
patent: 6918112 (2005-07-01), Bourke-Dunphy et al.
patent: 6952825 (2005-10-01), Cockx et al.
patent: 7027996 (2006-04-01), Levinson
patent: 7076417 (2006-07-01), Jain et al.
patent: 7286999 (2007-10-01), Majd et al.
patent: 7290258 (2007-10-01), Steeb et al.
patent: 2004/0039935 (2004-02-01), Pisecky
patent: 2004/0243995 (2004-12-01), Sheehy
Dean, Thomas, “Using Temporal Hierarchies to Efficiently Maintain Large Temporal Databases”, 1989, ACM, p. 687-718.
Szymanek et al., “Partial Task Assignment of Task Graphs under Heterogeneous Resource Constraints,” Jun. 2003, ACM, p. 244-249.
Adve et al., “Parallel Program Performance Prediction Using Deterministic Task Graph Analysis,” Feb. 2004, ACM, p. 94-136.
J. Blazewicz, K. Ecker, G. Schmidt, J. Weglarz, Scheduling in Computer and Manufacturing Systems, Springer-Verlag, 1993.
E. Coffman, editor, Computer and Job-Shop Scheduling Theory, John Wiley and Sons, 1976.
M. Pindeo, Scheduling: Theory Algorithms and Systems, Prentice Hall 1995.
E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
W. Press, B. Flanner, S. Teukolsk, W. Vetterling, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, 1986.
M. Garey, D. Johnson, Computers & Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Company, 1979.
R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
The Institute of Electrical and Electronics Engineers, Inc., 1996, IEEE Standard for Information Technology—Portable Operating System Interface (POSIX) System Administration Part 2: Software Administration.
CAE Specification, Systems Management: Distributed Software Administration (XDSA), The Open Group, Jan. 1998.

Affiliated with

Also associated with

Rating

Methods and arrangements for ordering changes in computing... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and arrangements for ordering changes in computing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and arrangements for ordering changes in computing... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4113003