Mechanism to reduce the cost of forwarding pointer aliasing

Details Mechanism to reduce the cost of forwarding pointer aliasing Mechanism to reduce the cost of forwarding pointer aliasing

2006-09-12

2006-09-12

McLean-Mayo, Kimberly N. (Department: 2187)

Electrical computers and digital processing systems: memory

Address formation

Address mapping

C711S216000, C711S220000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

07107430

ABSTRACT:
Short-quasi-unique-identifiers (SQUIDs) are generated and assigned to the data objects stored in memory. Pointers to a particular data object contain the data object's assigned SQUID. If a data object is moved to a second allocated memory segment, a new pointer to the second allocated memory segment is placed at the original memory segment, so that any pointers to the original memory segment now point to the new pointer. The distribution of SQUIDs is uniform. SQUIDs can be generated by counting, generated randomly, generating through some hashing mechanism, or other means. In comparing two different pointers, it is determined that the two pointers do not reference the same data object if the SQUIDs are different. On the other hand, if the SQUIDs are identical and the address fields of the two pointers are identical, then the two pointers reference the same data object. In addition, a pointer is associated with a migration indicator field which indicates the number of migrations of the referenced data object prior to the pointer being created. The comparator determines that two pointers do not reference the same data object if their associated migration indicators indicate identical numbers of migrations and their corresponding addresses are different.

REFERENCES:
patent: 5025253 (1991-06-01), DiLullo et al.
patent: 5325524 (1994-06-01), Black et al.
patent: 5845331 (1998-12-01), Carter et al.
patent: 5900001 (1999-05-01), Wolczko et al.
patent: 5933820 (1999-08-01), Beier et al.
patent: 6560619 (2003-05-01), Flood et al.
patent: 2001/0027501 (2001-10-01), O'Hare et al.
patent: 2002/0175805 (2002-11-01), Armstrong et al.
patent: 934823 (1997-09-01), None
Moss, J. E. B., “Design of the Mneme Persistent Object Store”,ACM Transactions on Information Systems, 8 (2) :103-139 (1990).
Luk, C. K., and Mowry, T.C., “Memory Forwarding: Enabling Aggressive Layout Optimizations by Guaranteeing the Safety of Data Relocation,”Proc. ISCA'99, pp. 88-99 (1999).
Day, M., et al., “References to Remote Mobile Objects in Thor”,ACM Letters on Programming Languages&Systems, 2 (1-4) :115-126 (1993).
Carter, N. P., et al., “Hardware Support for Fast Capability-based Addressing”,Proc. 6thInternational Conference on Architectural Support for Programming Languages and Operating Systems, (1994).

Affiliated with

Also associated with

Rating

Mechanism to reduce the cost of forwarding pointer aliasing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Mechanism to reduce the cost of forwarding pointer aliasing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism to reduce the cost of forwarding pointer aliasing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3530062