Efficient write-watch mechanism useful for garbage...

Details Efficient write-watch mechanism useful for garbage... Efficient write-watch mechanism useful for garbage...

2006-06-20

2006-06-20

Bragdon, Reginald G. (Department: 2185)

Electrical computers and digital processing systems: memory

Storage accessing and control

Control technique

C711S156000, C711S170000, C707S793000

Reexamination Certificate

active

07065617

ABSTRACT:
An efficient write-watch mechanism and process. A bitmap is associated with the virtual address descriptor (VAD) for a process, one bit for each virtual page address allocated to a process having write-watch enabled. As part of the write-watch mechanism, if a virtual address is trimmed to disk and that virtual address page is marked as modified, then the corresponding bit in the VAD is set for that virtual address page. In response to an API call (e.g., from a garbage collection mechanism) seeking to know which virtual addresses in a process have been modified since last checked, the memory manager walks the bitmap in the relevant VAD for the specified virtual address range for the requested process. If a bit is set, then the page corresponding to that bit is known to have been modified since last asked. If specified by the API, the bit is cleared in the VAD bitmap so that it will reflect the state since this time of asking. If the bit is not set, to determine if the page was modified, the page table entry (PTE) is checked for that page, and if the PTE indicates the page was modified, the page is known to be modified, otherwise that page is known to be unmodified since the last call. One enhancement uses page directory tables to locate a series of trimmed pages, sometimes avoiding the need to access the PTE.

REFERENCES:
patent: 4989134 (1991-01-01), Shaw
patent: 5237673 (1993-08-01), Orbits et al.
patent: 5842016 (1998-11-01), Toutonghi et al.
patent: 5845298 (1998-12-01), O'Connor et al.
patent: 5848423 (1998-12-01), Ebrahim et al.
patent: 5857210 (1999-01-01), Tremblay et al.
patent: 5873104 (1999-02-01), Tremblay et al.
patent: 5873105 (1999-02-01), Tremblay et al.
patent: 5900001 (1999-05-01), Wolczko et al.
patent: 5903899 (1999-05-01), Steele, Jr.
patent: 5903900 (1999-05-01), Knippel et al.
patent: 5909579 (1999-06-01), Agesen et al.
patent: 5911144 (1999-06-01), Schwartz et al.
patent: 5915255 (1999-06-01), Schwartz et al.
patent: 5920876 (1999-07-01), Ungar et al.
patent: 5930807 (1999-07-01), Ebrahim et al.
patent: 5953736 (1999-09-01), O'Connor et al.
patent: 6249793 (2001-06-01), Printezis et al.
Anonymous, “A Comparison of Inferno and Java,”Computing Sciences Research of Bell Labs, http://www.lucent-inferno.com/Page . . . tion/White—Papers/infernojava.html printed Jul. 12, 1999.
Anonymous, “Blue—What is it,” http://www.sd.monash.edu.au/blue/what-is-it.html printed Jul. 9, 1999.
Anonymous, “Cmm and Java Compared: A Comparison of Modern Languages for the Internet and Worldwide Web,” (1997), http:/
ombas.com/us/otherdoc/javavcmm.html printed Jul. 12, 1999.
Anonymous, “ Elements of Comparison Java/Hotjava vs. Caml/MMM,” http://pauillac.inria.fr/˜rouaix/mmm/currentjavacomp.html printed May 28, 1999.
Anonymous, “Garbage Collection for ISC Eiffel: An Overview,”ISE Technical Report, TR-EI-56/GC, VERSION 3.3.9, http://eiffel.com/doc/manuals/technology'internal/gc/page.html printed Jul. 30, 1999.
Anonymous, “Object—Oriented Languages: A Comparison,” http://eiffel.com/doc/manuals/technology/oo—comparison/page.html printed Jul. 12, 1999.
Anonymous, “Standard ML,” http://cm.bell-labs.com/cm/cs/what/smlnj.html printed Jun. 1, 1999.
Atkinson et al., “Experiences Creating a Portable Cedar,”Proceedings of the Sigplan '89 Conference on Programming Language Design and Implementation, Sigplan Notices, vol. 24, No. 7, pp. 322-329 (Jun. 21-23, 1989).
Aubrey, David, “Lucent's Inferno: A Devil of an OS,”Communications Week, No. 633 (Oct. 14, 1996).
Bak et al., “The New Corp of Java Virtual Machines,”ACM Sigplan Notices, vol. 33, No. 10, pp. 179-182 (Oct. 1998).
Barrett et al., “Garbage Collection using a Dynamic Threatening Boundary,”ACM Sigplan Notices, vol. 30, No. 6, pp. 301-314 (1995).
Benett, John K., “The Design and Implementation of Distributed Smalltalk,”Proceedings of the Second ACM Conference on Object Oriented Programming Systems, Languages and Applications, pp. 318-330 (Oct. 4-5, 1987).
Birrell et al., “Network Objects.”Software Practice and Experience, vol. 25, No. S4, pp. S4/87-S4/130 (Dec. 1995).
Boehm et al., “Garbage Collection in an Uncooperative Environment,”Software—Practice and Experience, vol. 18, No. 9, pp. 807-820 (Sep. 1988).
Böszörmenyi, Laszlo, “A Comparison of Modula-3 and Oberon-2 (extended version),”Structured Programming, vol. 14, pp. 15-22 (1993).
Brandis et al., “ The Oberon System Family,”Institute for Computersysteme, pp. 1331-1366 (Apr. 25, 1995).
Cahill et al., “Interfacing a Language to the Virtual Machine,”The Commandos Distributed Application Platform, Springer-Verlag, pp. 209-233 (1993).
Cardelli et al., “Modula-3 Report (revised),”SRC Research Report 52, Preface, (Nov. 1, 1989), http://gatekeeper.dec.com/pub/DEC . . . -reports/abstracts/src-rr-052.html printed Jun. 1, 1999.
Cardelli et al., “The Modula-3 Type System,”Conference Record of the 16thAnnual ACM Symposium on Principals of Programming Languages, pp. 202-212 (1989).
Caudill et al., “A Third Generation Smalltalk-80 Implementation,”ACM Sigplan 1986 Conference on Object Oriented Programming Systems, Languages and Applications(OOPSLA '86), pp. 119-129 (1986).
Chambers et al.Object-Oriented Programming: Systems, Languages and Applications OOPSLA '89 Conference Proceedings Sigplan Notices, vol. 24, No. 10, pp. 49-70 (Oct. 1-6, 1989).
Clark et al.,The UCSD Pascal Handbook: A Reference and Guidebook for Programmers, ChVIII, IX, X, pp. 153-172 (1982).
de Figueiredo et al., “The Design and Implementation of a Language for Extending Applications,”Proceedings of XXI Brazilian Seminar on Software and Hardware, pp. 273-283 (1994).
de Figueiredo et al., “Lau: An Extensible Embedded Language,”Dr. Dobb's Journal, vol. 21 No. 12, pp. 26-28, 32-33, 88, 90 (Dec. 1996).
Deutsch et al. “An Efficient, Incremental, Automatic Garbage Collector.”Communications of the ACM, vol. 19, No. 9, pp. 522-526 (Sep. 1976).
Diwan et al., “Complier Support for Garbage Collection in a Statistically Typed Language,”ACM Sigplan Notices, vol. 27, No. 7, pp. 273-282 (1992).
Diwan, Amer Sulman, “Understanding and Improving the Performance of Modern Programming Languages,”Department of Computer Science, Univeristy of Massachusetts(Amherst), pp. 1-137 (Feb. 1997).
Doligez et al., “A Concurrent Garbage Collector for Multithreaded Implementation of ML,”Papers of the 20thACM Symposium on Principals of Programming Languages, pp. 113-123 (Jan. 10-13, 1989).
Dömel, Peter, “Molbile Telescript Agents and the Web,”Compcon '96 Technologies for the information Superhighway Digest of Papers, pp. 52-57 (1996).
Doward et al., “Inferno”Proceedings IEEE Compcon 97, pp. 241-244 (Feb. 23-26, 1997).
Doward et al., “Programming in Limbo,”Compcon 1997 Proceedings of IEEE Conference, pp. 245-250 (1997).
Evans et al., “Garbage Collection and Memory Management,”OOPSLA '97, Addendum to the 1997 ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages and Applications, pp. 138-143 (1997).
Fischer, André, “The Oberon Home Page,”Institute for Computersysteme(Jul. 5, 1999), http://www.oberon.ethz.ch/oberon.html printed Jul. 7, 1999.
Fischer, André, “Oberon System 3 White Paper,”Institute for Computersysteme(Feb. 11, 1999), http://www.oberon.ethz.ch/oberon/system3/white.html printed Jul. 8, 1999.
Floyd, Michael, “Comparing Object Oriented Languages,”Dr Dobb's Journal, vol. 18, No. 11, pp. 104-105, 118 (Oct. 1993).
Franz et al., “Introducing Juice,” (Oct. 30, 1996), http://caesar.ics.uci.edu/juice/intro/.html printed Jul. 7, 1999.
Gosling et al., “The Java Language Environment: White Paper,” pp. 12-1

Affiliated with

Also associated with

Rating

Efficient write-watch mechanism useful for garbage... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient write-watch mechanism useful for garbage..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient write-watch mechanism useful for garbage... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3672699