List processing real time serial computer

Background Citations. Methods Citations. Results Citations. Topics from this paper. Citation Type. Has PDF. Publication Type. More Filters. List processing in real time on a serial computer. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. LFP ' Concurrent, parallel, real-time garbage-collection. ISMM ' Non-blocking object copy for real-time garbage collection.

JTRES ' A performance perspective on the Active Memory System. View 1 excerpt, cites results. Metadata Show full item record. Classical list processing systems such as LISP do not have this property because a call to CONS may invoke the garbage collector which requires time proportional to the number of accessible cells to finish. The space requirement of a classical LISP system with N accessible cells under equilibrium conditions is 1.

A list processing system is presented which: 1 is real-time--i. Extensions of the system to handle a user program stack, compact list representation "CDR-coding" , arrays of non-uniform size, and hash linking are discussed.

We'll do our best to fix them. Check all that apply - Please note that only the first page is available if you have not selected a reading option after clicking "Read Article". Include any more information that will help us locate the issue and fix it faster for you. A real-time list processing system is one in which the time required by the elementary list operations e. 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. Continue with Facebook. Sign up with Google. Log in with Microsoft.

Bookmark this article. You can see your Bookmarks on your DeepDyve Library. Sign Up Log In.