
	Where results make sense

Topic: Pointer swizzling

Related Topics

C plus plus

In the News (Fri 25 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	U.S. Patent: 5794256 - Pointer swizzling facility using three-state references to manage access to referenced objects ...
		When the pointer to a resident object descriptor is subsequently dereferenced, the main memory pointer to the loaded referenced object in the resident object descriptor is used to access the referenced object.
		In accordance with the invention, a persistent pointer swizzling facility ("the facility") replaces, in a referencing object, a persistent pointer to an unloaded referenced object with a smart pointer to the referenced object.
		When the smart pointer in the referencing object is later dereferenced, the dereferencing operation determines that the pointer contained in the smart pointer is not a direct pointer to the referenced object, and uses it to access the persistent pointer in the central data structure.
	www.everypatent.com /comp/pat5794256.html (6548 words)

	Pointer swizzling - Wikipedia, the free encyclopedia
		In computer science, pointer swizzling is the conversion of references based on name or position to direct pointer references.
		The reverse operation, replacing pointers with position-independent symbols or positions, is sometimes referred to as unswizzling, and is performed during serialization (saving).
		The reference graph of pointers might contain an arbitrary number of cycles; this complicates maintaining a mapping from the old unswizzled values to the new addresses.
	en.wikipedia.org /wiki/Unswizzling (552 words)

	The Memory Management Reference: Bibliography Abstract (Site not responding. Last check: 2007-10-30)
		Pointer swizzling at page fault time is a novel address translation mechanism that exploits conventional address translation hardware.
		This swizzling scheme can be used to provide data compatibility across machines with different word sizes, and even to provide binary code compatibility across machines with different hardware address sizes.
		Pointers are translated ("swizzled") from a long format to a shorter hardware-supported format at page fault time.
	www.memorymanagement.org /bib/wil92a.html (157 words)

	POI from FOLDOC
		A pointer may be typed, with its type indicating the type of data to which it points.
		Conversely, in C, "pointer" is used, although "a reference" is often used to denote the concept that a pointer implements.
		Pointers are like jumps, leading wildly from one part of the data structure to another.
	www.instantweb.com /d/dictionary/foldoc.cgi?query=POI (1007 words)

	The Region Trap Library: Handling Traps on Application-Defined Regions of Memory (Site not responding. Last check: 2007-10-30)
		In a persistent object system, pointers to objects may have different representations when they reside on disk than when they reside in memory, and pointer swizzling is used to update the values of pointers when objects are brought into memory or written out to disk.
		Swizzling the register containing the faulting address requires first decoding the instruction that generated the fault in order to determine which register requires swizzling, and then modifying that register.
		Consequently, when pointers or registers are swizzled from one memory area to another, their offset from the start of the region in those respective areas must be preserved (this is what permits offsets and pointer arithmetic to be used).
	bcr2.uwaterloo.ca /~brecht/papers/html/usenix99/paper.html (9135 words)

	The Old New Thing : What is the underlying object behind a COM interface pointer?
		When you're debugging, you might have a pointer to a COM interface and want to know what the underlying object is. Now, sometimes this trick won't work because the interface pointer actually points to a stub or proxy, but in the case where no marshalling is involved, it works great.
		Recall that the layout of a COM object requires that the pointer to a COM interface point to the object's vtable, and it's the vtable that is the key.
		The methodical way is to use the adjustor thunks to tell you how much the pointer needs to be adjusted in order to move from a secondary vtable to the primary one.
	blogs.msdn.com /oldnewthing/archive/2007/04/24/2252261.aspx (1695 words)

	OOPS Group Publications
		Pointer swizzling requires run-time knowledge of in-memory object layouts to locate pointers in objects.
		A key component of the design is the use of pointer swizzling at page fault time, which exploits existing virtual memory features to implement large address spaces efficiently on stock hardware, with little or no change to existing compilers.
		Long pointers are used to implement an enormous address space, but are transparently converted to the hardware-supported pointer format when pages are loaded into virtual memory.
	www.cs.utexas.edu /users/oops/papers.html (4948 words)

	System Overview
		HAC uses indirect pointer swizzling [KK90], i.e., the oref is translated to a pointer to an entry in an indirection table and the entry points to the target object.
		Both pointer swizzling and installation of objects, i.e., allocating an entry for the object in the indirection table, are performed lazily.
		Pointers are swizzled the first time they are loaded from an instance variable into a register [WD92]; the extra bit in the oref is used to determine whether a pointer has been swizzled or not.
	research.microsoft.com /~adya/pubs/hac-sosp97/node2.html (1302 words)

	Paper: Pointer Swizzling (Site not responding. Last check: 2007-10-30)
		Whereas the latter class of pointer swizzling methods has received much attention in recent literature, the first class - i.e., techniques that take "precautions" for the replacement of swizzled objects - has not yet been thoroughly investigated.
		Four different pointer swizzling techniques allowing object replacement were investigated and contrasted with the performance of an object manager employing no pointer swizzling.
		An adaptable object base run-time system was, therefore, devised that employs the full range of pointer swizzling strategies depending on the application profile characteristics which are determined by, e.g., monitoring in combination with sampling, user specifications, and/or program analysis.
	www-db.in.tum.de /research/publications/papers/swizzling.html (218 words)

	Pointer swizzling Information
		In computer science, pointer swizzling is the conversion of references based on name or position to direct pointer references.
		The reverse operation, replacing pointers with position-independent symbols or positions, is sometimes referred to as unswizzling, and is performed during serialization (saving).
		The reference graph of pointers might contain an arbitrary number of cycles; this complicates maintaining a mapping from the old unswizzled values to the new addresses.
	www.bookrags.com /wiki/Pointer_swizzling (529 words)

	New Features
		Because the choice of pointer hardness is made at the data-member level, the use of soft pointers is only meaningful as the type of a data member in a persistent class.
		The hardness of a pointer in the program schema used by an application that creates a database does not constrain the choice of hardness for other applications that later access that database.
		For outbound relocation optimization, the client avoided pointer swizzling back to external values when a page was committed, by growing the segment's persistent relocation map (PRM) to cover all possible pseudoaddress translations - in effect, the PRM became the union of its previous state with the state of the PSR at commit time.
	wwwipd.ira.uka.de /~dbprak/Doc/ObjectStore/ostore/doc/rnotes/chap1.htm (2424 words)

	Definition of Pointer swizzling
		Directly saving the pointer values won't work on most architectures, because the next time we load it the memory positions the nodes now use may be in use by other data.
		In databases, all pointers are unswizzled in this manner, and are referred to as foreign keys.
		Swizzling can be a complicated problem, because we need to traverse, in general, a general reference graph of pointers which might contain cycles, while maintaining a mapping from the old unswizzled values to the new addresses.
	www.wordiq.com /definition/Pointer_swizzling (548 words)

	pointer - Definitions from Dictionary.com
		A pointer may be typed, with its type indicating the type of data to which it points.
		Conversely, in C, "pointer" is used, although "a reference" is often used to denote the concept that a pointer implements.
		Pointers are like jumps, leading wildly from one part of the data structure to another.
	dictionary.reference.com /browse/pointer (635 words)

	Object Databases: Not Just for CAD/CAM Anymore \| Linux Journal
		The other model is a pointer swizzling technique that allows you to use the pointers to persistent objects as if they never left memory.
		I believe the pointer swizzling technique is superior in programming model and flexibility, and I will cover this technique in further detail.
		Pointer swizzling is the changing or mapping of the on-disk format pointer to the in-memory format pointer.
	www.linuxjournal.com /article/1234 (2799 words)

	Class: ICache
		It peforms pointer swizzling, and it keeps a bounded set of recently used but otherwise unreferenced in objects to avoid the cost of re-loading them.
		Pointer swizzling is the process of converting between persistent object ids and Python object ids.
		It has weak references to ghost objects, because ghost objects are only stored in the cache to satisfy the pointer swizzling requirement.
	peak.telecommunity.com /doc/src/peak/persistence/interfaces/ICache.html (309 words)

	Conference Paper: Pointer Swizzling
		In this paper we will classify and evaluate different approaches to optimizing the access to main memory resident persistent objects - techniques which are commonly referred to as "pointer swizzling".
		To speed up the access along inter-object references, the persistent pointers are transformed (swizzled) into main-memory pointers (addresses).
		We will evaluate four different pointer swizzling techniques allowing the displacement of objects from the buffer before the end of an application and contrast them with the performance of an object manager using no pointer swizzling.
	www-db.in.tum.de /research/publications/conferences/deng93.html (115 words)

	VLDB J. 4(3): 519-566(1995)
		In this article, different techniques for "pointer swizzling" are classified and evaluated for optimizing the access to main-memory resident persistent objects.
		Pointer swizzling techniques can be divided into two classes: (1) those that allow replacement of swizzled objects from the buffer before the end of an application program, and (2) those that rule out the displacement of swizzled objects.
		Four different pointer swizzling techniques allowing object replacement are investigated and compared with the performance of an object manager employing no pointer swizzling.
	www.informatik.uni-trier.de /~ley/db/journals/vldb/KemperK95.html (1011 words)

	Pointer Swizzling in Non-Mapped Object Stores - Wegner, Paul, Thamm, Thelemann (ResearchIndex)
		Here, we show how the classical Record (Tuple) Identifiers (RID, TID) scheme can be combined with run-time pointer swizzling to avoid copying of persistent objects within main memory.
		Pointer Swizzling in Non-Mapped Object Stores, Preprints Fachbereich Mathematik/Informatik, Univ. Kassel, TR 4/95 (August 1995), to appear in Proc.
		92 Working with persistent objects: To swizzle or not to swizzl..
	citeseer.ist.psu.edu /wegner95pointer.html (656 words)

	[No title]
		Software swizzling (swizzling on pointer dereference) When a persistent pointer is first dereferenced, it is swizzled (replaced by an in-memory pointer) after the object is located in memory.
		The page identifier in a pointer is a short indirect pointer: each page has a translation table that provides a mapping from the short page identifiers to full database page identifiers.
		If pointer points to a page not already allocated a virtual memory address, a virtual memory address is allocated (preferably the address in the short page identifier if it is unused).
	moosehead.cis.umassd.edu /cis552/slides/08_oo.ppt (749 words)

	[No title]
		(8 pt) Generalize the pointer swizzling exercise in the lecture slides to include the possibility that we never swizzle pointers.
		Suppose that in-memory pointers are either not followed (probability 1-p) or are followed k times (probability p).
		If a pointer is followed, it is going to be followed k times.
	www.csc.uvic.ca /~csc485d/assig1_sol.doc (987 words)

	[No title] (Site not responding. Last check: 2007-10-30)
		Pointer swizzling techniques can be directed into two classes: (1) strategies that allow replacement of swizzled objects from the buffer before the end of an application program and (2) those that outrule the displacement of swizzled objects.
		Four different pointer swizzling techniques allowing object replacement were investigated and contrasted them with the performance oan object manager employing no pointer swizzling.
		The extensive qualitative and quantitative evaluation---only part of which could be presented in this paper---proved that there is no one superior pointer swizzling strategy for all application profiles.
	www.geckil.com /~harvest/various/rwth-lt-93-06 (160 words)

	Efficient Barriers for Persistent Object Caching
		The key design decision we made was the choice of a pointer swizzling strategy.
		Pointer swizzling speeds up programs by translating persistent addresses (references to persistent objects on disk) into normal virtual memory addresses in the object cache.
		The swizzling technique we chose is simple (requires few source changes to the EVM) and performs well (adds acceptably low CPU overhead to the EVM).
	research.sun.com /forest/COM.Sun.Labs.Forest.doc.oopsla99.barriers.abs.html (232 words)

	Comp.Object FAQ Version 1.0.5 (12-13) Announcement - signature implementation for G++ 2.5.2 and tech report available
		The advantages of signatures over abstract virtual classes are - you can build a type hierarchy separate from the class inheritance (implementation) hierarchy, - subtyping becomes decoupled from inheritance, and - signatures can be used with compiled classes, while you cannot retrofit an abstract virtual class on top of compiled class hierarchies.
		All addresses in a page are translated from a persistent format to actual virtual addresses when the page is brought into virtual memory, and subsequent memory references (including pointer traversals) are just as fast as for non-persistent data.
		Papers about the pointer swizzling scheme and Texas itself (referenced below) are available via anonymous ftp from cs.utexas.edu (IP address 128.83.139.9), as postscript files swizz.ps and texaspstore.ps in the directory pub/garbage.
	www.cs.cmu.edu /Groups/AI/html/faqs/lang/oop/faq-doc-29.html (1148 words)

	[No title] (Site not responding. Last check: 2007-10-30)
		Note: I've been able to print it on a relatively new Apple LaserWriter, but not on a relatively old one, perhaps because it needs lots of RAM to interpret the postscript.) swizz.ps is "Pointer Swizzling at Page Fault Time: Efficiently and Compatibly Supporting Huge Address Spaces on Standard Hardware," from the '92 Int'l.
		(This is the latest, greatest version of our pointer swizzling shtik, which includes several improvements since an earlier version was published in SIGPLAN Notices---if you only saw the old one, you might want to get this one.) texaspstore.ps is "Texas: an Efficient, Portable Persistent Store", from Proc.
		(This paper describes the organization and implementation of our persistent store, Texas, which uses pointer swizzling at page fault time for address translation, and log-structured storage to support efficient checkpointing.) This paper is a little bit out of date---we figured out how to do this stuff without needing a preprocessor.
	www.ccs.neu.edu /home/lieber/com3360/projects/com1205-w94/REV-ENG-C-PRGM-2/project/documentation/ascii/README-documentation (588 words)

	Object-Orientation FAQ -- 41 The Texas Persistent Store (Site not responding. Last check: 2007-10-30)
		Texas is a simple, portable, high-performance and (best of all) FREE persistent store for C++ using "pointer swizzling at page fault time" to translate persistent addresses to hardware-supported virtual addresses.
		All addresses in a page are translated from a persistent format to actual virtual addresses when the page is brought into virtual memory, and subsequent memory references (including pointer traversals) are just as fast as for non-persistent data.
		Papers about the pointer swizzling scheme and Texas itself (referenced below) are available via anonymous ftp from cs.utexas.edu (IP address 128.83.139.9), as postscript files swizz.ps and texaspstore.ps in the directory pub/garbage.
	www.informatik.uni-freiburg.de /Java/OOFAQ/oo-faq-S-11.10.0.41.html (368 words)

	VLDB 1992: 419-431 (Site not responding. Last check: 2007-10-30)
		Swizzling is done a pointer-at-a-time and software checks are used to detect the use of swizzled pointers.
		In addition, the significant performance impact of pointer swizzling on the generation of recovery information is examined.
		Eliot B. Moss: Working with Persistent Objects: To Swizzle or Not to Swizzle.
	www.acm.org /turing/sigmod/dblp/db/conf/vldb/WhiteD92.html (757 words)

	Pointer Swizzling, QuickStore (Site not responding. Last check: 2007-10-30)
		This is called "swizzling" a disk pointer to a (virtual) memory pointer.
		Can be done with hash indices over the buffer pool, and special compilation (persistent-object refs turn into function calls that do hash lookups to map disk ptr to memory pointer; each time you follow a persistent ptr in C++ you call a function and traverse a hash index).
		if any of the pointers in the mapping object were changed (placed elsewhere in VM), go to bitmap object and swizzle all pointers on the page.
	db.cs.berkeley.edu /jmh/cs262b/swizzle.html (481 words)

	[No title]
		This section: how do we represent SQL datatypes as fields Plus we may have weird data in the DBMS such as OIDs (a pointer to another record) or blobs (binary, large objects -- a 2 GB MPEG video) ----------------------- B.
		The DB maintains schema info for a relation: the attrs and their types, the order in which the attrs appear, constraints on the relation (the primary key, constraints, triggers,...) May have schema pointer via 4 bytes which are an offset into an area where the schemas are stored.
		certainly not without letting B_1 know to invalidate its pointers (cuz we would be replacing B_2 in main mem with some other block..
	www.stanford.edu /~stinson/cs245/notes/ch3.txt (1288 words)

Try your search on: Qwika (all wikis)