Article

Free access

Memory organization and management for linked data structures

Author:

Hirotoshi MaegawaAuthors Info & Claims

CSC '91: Proceedings of the 19th annual conference on Computer Science

Pages 105 - 112

https://doi.org/10.1145/327164.327219

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

Andre, D. L., Paging in Lisp Programs, The Faculty of Graduate School of The University of Maryland (1986).

Google Scholar

[2]

Bishop P. B., Computer Systems with a Very Large Address Space and Garbage Collection, MIT/LCS/TR-178, Laboratory for Computer Science, MIT (1977).

Google Scholar

[3]

Bobrow, D., et al., Common Lisp Object System Specification, X3J13 Documents 88-002R (1988).

Google Scholar

[4]

Chikayama, T. and Kimura, Y., Multiple Reference Management in Flat GHC, Proc. of ICLP '87 (1987), 276-293.

Google Scholar

[5]

Cohen, J., Garbage Collection of Linked Data Structures, Computing Surveys 13, 3 (1981), 341-367.

Digital Library

Google Scholar

[6]

Courts, R., Improving Locality of Reference in a Garbage-Collecting Memory Management System, Comm. of the ACM 31, 9 (1988), 1128-1138.

Digital Library

Google Scholar

[7]

Denning, P. J., Virtual Memory, Computing Surveys 2, 3 (1970), 153-189.

Digital Library

Google Scholar

[8]

Deutch, L. P. and Bobrow, D. G., An Efficient Incremental Automatic Garbage Collector, Comm. of the ACM 19, 9 (1976), 522-526.

Digital Library

Google Scholar

[9]

Gabriel, R. P., Performance and Evaluation of Lisp Systems, MIT Press (1985).

Digital Library

Google Scholar

[10]

Lieberman, H. and Hewitt, C., A Real-Time Garbage Collection Based on the Lifetimes of Objects, Comm. of the ACM 26, 6 (1983), 419-429.

Digital Library

Google Scholar

[11]

Maegawa, H., et al., The Virtual Storage Management Method for Pointer-Linked Data, IPSJ SIG Reports SYM50-1 (1989).

Google Scholar

[12]

Maegawa, H., et al., Memory Management for Lined Data Structures, Proc. of the 39th Annual Convention IPS Japan, 1Q-4 (1989), 1279-1280.

Google Scholar

[13]

Maegawa, H., et al., A Structure Oriented Storage Organization for Linked Data, IPSJ SiG Reports ARC80-5 (1990), 33-39.

Google Scholar

[14]

Maegawa, H., et al., An Architecture based on Computational Resources and Evaluation, Proc. of the 40th Annual Convention IPS Japan, 5L-1 (1990), 1225-1226.

Google Scholar

[15]

Moon, D. A., Garbage Collection in a Large Lisp System, Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming (1984), 235-246.

Digital Library

Google Scholar

[16]

Stamos, J. W., Static Grouping of Small Objects to Enhance Performance of a Paged Virtual Memory, ACM Trans. Computer Systems 2, 2 (1984), 155-180.

Digital Library

Google Scholar

[17]

Saneto, T. and Maegawa, H., The Memory Organization for Linked Data Structures and Its Dynamic Characteristics, IPSJ SIG Reports ARC85-10 (1990), 71-78.

Google Scholar

[18]

Steele, G. L. Jr., Common Lisp: The Language, Digital Press (1984).

Digital Library

Google Scholar

[19]

Ungar, D., Generation Scavenging: A Nondisruptive High Performance Storage Reclamation Algorithm, Proc. of Software Engineering Symposium on Practical Software Development Environments (1984), 157-167.

Digital Library

Google Scholar

[20]

Yasuda, H., et al., Lilac: Parallel Distributed System based on Computational Resources, IPSJ SIG Reports SYM55-2 (1990).

Google Scholar

[21]

Yasuda, H., et al., The Organization of Parallel Distributed System Lilac, Proc. of the 41st Annual Convention iPS Japan 6, 5P-4 (1990), 147-148,

Google Scholar

Cited By

View all

Singh A(2008)A Randomized Approach to Bound Jayanti's Mutual Exclusion AlgorithmProceedings of the 2008 First International Conference on Emerging Trends in Engineering and Technology10.1109/ICETET.2008.20(1325-1330)Online publication date: 16-Jul-2008
https://dl.acm.org/doi/10.1109/ICETET.2008.20

Memory organization and management for linked data structures
1. Information systems
  1. Information retrieval
    1. Specialized information retrieval

Recommendations

Enabling Hybrid PCM Memory System with Inherent Memory Management
RACS '16: Proceedings of the International Conference on Research in Adaptive and Convergent Systems

Replacing the traditional volatile main memory, e.g., DRAM, with a non-volatile phase change memory (PCM) has become a possible solution to reduce the energy consumption of computing systems. To further reduce the bit cost of PCM, the development trend ...
Organization memory: Review of concepts and recommendations for management

The notion of corporate or organizational memory has been discussed for over a quarter of a century. A major objective of this work is to review the conceptual foundations of organizational memory drawing from information systems research, management ...
Write-aware memory management for hybrid SLC-MLC PCM memory systems

In recent years, phase-change memory (PCM) has generated a great deal of interest because of its byte addressability and non-volatility properties. It is regarded as a good alternative storage medium that can reduce the performance gap between the main ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CSC '91: Proceedings of the 19th annual conference on Computer Science

April 1991

711 pages

ISBN:0897913825

DOI:10.1145/327164

Chairmen:
C. Jinshong (C. J.) Hwang
Southwest Texas State Univ., San Marcos
,
Richard Brice
MCC

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
529
Total Downloads

Downloads (Last 12 months)65
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Singh A(2008)A Randomized Approach to Bound Jayanti's Mutual Exclusion AlgorithmProceedings of the 2008 First International Conference on Emerging Trends in Engineering and Technology10.1109/ICETET.2008.20(1325-1330)Online publication date: 16-Jul-2008
https://dl.acm.org/doi/10.1109/ICETET.2008.20

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Enabling Hybrid PCM Memory System with Inherent Memory Management

Organization memory: Review of concepts and recommendations for management

Write-aware memory management for hybrid SLC-MLC PCM memory systems