Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5703Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Steele, Guy L., Jr. | - |
| dc.date | 2004-10-01T20:31:53Z | - |
| dc.date | 2004-10-01T20:31:53Z | - |
| dc.date | 1980-08-01 | - |
| dc.date.accessioned | 2013-10-09T02:40:56Z | - |
| dc.date.available | 2013-10-09T02:40:56Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-587 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5703 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Linked list structures can be compactly represented by encoding the CDR ("next") pointer in a two-bit field and linearizing list structures as much as possible. This "CDR-coding" technique can save up to 50% on storage for linked lists. The RPLACD (alter CDR pointer) operation can be accommodated under such a scheme by using indirect pointers. Standard destructive reordering algorithms, such as REVERSE and SORT, use RPLACD quite heavily. If these algorithms are used on CDR-coded lists, the result is a proliferation of indirect pointers. We present here algorithms for destructive reversal and sorting of CDR-coded lists which avoid creation of indirect pointers. The essential idea is to note that a general list can be viewed as a linked list of array-like "chunks". The algorithm applied to such "chunky lists" is a fusion of separate array- and list-specific algorithms; intuitively, the array-specific algorithm is applied to each chunk, and the list algorithm to the list with each chunk considered as a single element. | - |
| dc.format | 15 p. | - |
| dc.format | 5323679 bytes | - |
| dc.format | 3774242 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-587 | - |
| dc.title | Destructive Reordering of CDR-Coded Lists | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.