Showing papers on "Heap (data structure) published in 1978"
TL;DR: A real-time list processing system is presented which continuously reclaims garbage, including directed cycles, while linearizing and compacting the accessible cells into contiguous locations to avoid fragmenting the free storage pool.
Abstract: A real-time list processing system is one in which the time required by the elementary list operations (e.g. CONS, CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical implementations of list processing systems lack this property because allocating a list cell from the heap may cause a garbage collection, which process requires time proportional to the heap size to finish. A real-time list processing system is presented which continuously reclaims garbage, including directed cycles, while linearizing and compacting the accessible cells into contiguous locations to avoid fragmenting the free storage pool. The program is small and requires no time-sharing interrupts, making it suitable for microcode. Finally, the system requires the same average time, and not more than twice the space, of a classical implementation, and those space requirements can be reduced to approximately classical proportions by compact list representation. Arrays of different sizes, a program stack, and hash linking are simple extensions to our system, and reference counting is found to be inferior for many applications.
630 citations
TL;DR: A comparison of heaps and the TL structure is made and the heap appears to be a more efficient structure than any proposed in the paper.
Abstract: Following publication of our paper [2], questions arose with respect to the superiority of the TL structure over heaps,1 particularly in the face of the remarks of Gonnet [3], concerning the use of heaps for the physical realization of the simulation event set. Gonnet's communication was in response to the Vaucher and Duval paper [5], and suggested the heap to be a more efficient structure than any proposed in [5]. As regards a comparison of heaps and the TL structure we can make the following remarks:
17 citations
TL;DR: A variation of the Haddon and Waite compacting garbage collector is presented that needs only bounded workspace, but which has typical runtime proportional to the size of the heap rather than n log n for a heap of size n.
Abstract: A variation of the Haddon and Waite compacting garbage collector is presented that needs only bounded workspace, but which has typical runtime proportional to the size of the heap rather than n log n for a heap of size n. The algorithm has been measured in the context of a LISP system where it has been seen to behave close to its optimum. The relationship of this algorithm to one due to Lang and Weigbreit is also explained.
13 citations
Patent•
28 Dec 1978
TL;DR: In loading open top containers with parcels use is made of an intermediate carrier member (14) which is gradually lowered into the container so as to limit the height of fall said carrier member is tiltable foldable or otherwise retractable from under a heap of parcels formed within the container as discussed by the authors.
Abstract: In loading open top containers with parcels use is made of an intermediate carrier member (14) which is gradually lowered into the container so as to limit the height of fall Said carrier member is tiltable foldable or otherwise retractable from under a heap of parcels formed within the container
11 citations
Book•
01 Jun 1978TL;DR: A very little boy stood upon a heap of gravel for the honor of Rum Alley as mentioned in this paper, throwing stones at howling urchins from Devil's Row who were circling madly about the heap and pelting at him.
Abstract: A very little boy stood upon a heap of gravel for the honor of Rum Alley. He was throwing stones at howling urchins from Devil’s Row who were circling madly about the heap and pelting at him.
6 citations
Patent•
22 Aug 1978
TL;DR: In this article, the authors propose to eliminate loss of paper and time by connecting mutually the boxes where respective start and finish of papers which is folded to contain in a paper box, permitting to feed paper continually by changing paper feeding direction with a deflection bar.
Abstract: PURPOSE: To eliminate loss of paper and loss of time by connecting mutually the boxes where respective start and finish of papers which is folded to contain in a paper box, permitting to feed paper continually by changing paper feeding direction with a deflection bar CONSTITUTION: A paper 3 is prepared by a plural numbers of heaps, joining mutually the start and the finish ends of adjacent heaps with a tape The paper is drawn from the heap of paper 3 which is positioned at the end by means of supplementary bar 16, and deflection bar 17 to feed to the printer When the first heap of paper is used up, since the finish end thereof is connected with the start end of following heap of paper, automatically changing to the paper fed from the following heap Loading a heap of paper 3 on the belt conveyor 18 is favorable for placing continually a heap of feeding to the supplementary bar Moreover, the paper feeding direction and the forward direction of heap enables to be different, permitting to provide a wider working space COPYRIGHT: (C)1980,JPO&Japio
5 citations
TL;DR: This publication contains reprint articles for which IEEE does not hold copyright and which are likely to be copyrighted.
1 citations