Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-11-21
2006-11-21
Ali, Mohammad (Department: 2166)
Data processing: database and file management or data structures
Database design
Data structure types
C711S117000, C711S127000, C711S137000, C711S100000, C707S793000
Reexamination Certificate
active
07139784
ABSTRACT:
The performance of an application is improved by identifying and eliminating items with dead time-stamps and eliminating work on items with irrelevant time-stamps. An algorithm executing in each node of a task graph computes and propagates guarantees which are used to eliminate both items with dead time-stamps and irrelevant computation on dead time-stamps. A continuous garbage collector eliminates items with dead time-stamps while the node continues to process received items. Unnecessary computations are reduced by automatically discerning the interest set of downstream modules for time-stamps and feeding the interest set back to upstream modules.
REFERENCES:
patent: 6067604 (2000-05-01), Ramachandran et al.
patent: 2004/0193662 (2004-09-01), Garthwaite
U.S. Appl. No 09/549,351, filed Apr. 14, 2000, Knobe et al.
K. M. Chandy and J. Misra, “Asynchronous Distributed Simulation via a Sequence of Parallel Computations,” Communications of the ACM, 24:198-206, 1981.
A. D. Christian and B. L. Avery, “Digital Smart Kiosk Project,” In ACM SIGCHI 98, pp. 155-162, Los Angeles, CA, Apr. 18-23, 1998.
R. M. Fujimoto, “Parallel Discrete Event Simulation,” Comm. of the ACM, 33(10), Oct. 1990.
R. M. Fujimoto, “Parallel and Distributed Simulation,” In Winter Simulation Conference, pp. 118-125, Dec. 1995.
D. R. Jefferson, “Virtual Time,” ACM Transactions on Programming Languages and Systems, 7 (3):404-425, Jul. 1985.
K. Knobe, et al., Scheduling constrained dynamic applications on clusters. In Proc. SC99: High Performance Networking and Computing Conf., Portland, OR, Nov. 1999. Technical paper.
R. S. Nikhil and U. Ramachandran, Garbage Collection of Timestamped Data in Stampede. In Proc. Nineteenth Annual Symposium on Principles of Distributed Computing (PODC 2000), Portland, Oregon, Jul. 2000.
J. M. Rehg, et al., “Vision for a Smart Kiosk,” In Computer Vision and Pattern Recognition, pp. 690-696, San Juan, Puerto Rico, Jun. 17-19, 1997.
P. R. Wilson, Uniprocessor Garbage Collection Techniques, Yves Bekkers and Jacques Cohen (eds.). In Intl. Wkshp. on Memory Management (IWMM 92), St. Malo, France, pp. 1-42, Sep. 1992.
Knobe Kathleen
Ramachandran Umakishore
Ali Mohammad
Harper Leon J.
Hewlett--Packard Development Company, L.P.
Lange Richard P.
LandOfFree
Dead timestamp identification and elimination does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Dead timestamp identification and elimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dead timestamp identification and elimination will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3688867