mirror of
https://github.com/cs341-illinois/coursebook.git
synced 2026-10-19 05:40:09 +08:00
67 lines
2.9 KiB
BibTeX
67 lines
2.9 KiB
BibTeX
@book{rangan1999foundations,
|
|
title={Foundations of Software Technology and Theoretical Computer Science: 19th Conference, Chennai, India, December 13-15, 1999 Proceedings},
|
|
author={Rangan, C.P. and Raman, V. and Ramanujam, R.},
|
|
isbn={9783540668367},
|
|
lccn={99058792},
|
|
series={FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE},
|
|
url={https://books.google.com/books?id=0uHME7EfjQEC},
|
|
year={1999},
|
|
publisher={Springer}
|
|
}
|
|
|
|
@misc{mallocinternals, title={Overview of Malloc}, url={https://sourceware.org/glibc/wiki/MallocInternals}, journal={MallocInternals - glibc wiki}, publisher={Free Software Foundation}, year={2018}, month={Mar}}
|
|
|
|
@misc{jones2010wg14,
|
|
title={WG14 N1539 Committee Draft ISO/IEC 9899: 201x},
|
|
author={Jones, Larry},
|
|
year={2010},
|
|
publisher={International Standards Organization}
|
|
}
|
|
|
|
@inproceedings{Garey:1972:WAM:800152.804907,
|
|
author = {Garey, M. R. and Graham, R. L. and Ullman, J. D.},
|
|
title = {Worst-case Analysis of Memory Allocation Algorithms},
|
|
booktitle = {Proceedings of the Fourth Annual ACM Symposium on Theory of Computing},
|
|
series = {STOC '72},
|
|
year = {1972},
|
|
location = {Denver, Colorado, USA},
|
|
pages = {143--150},
|
|
numpages = {8},
|
|
url = {http://doi.acm.org/10.1145/800152.804907},
|
|
doi = {10.1145/800152.804907},
|
|
acmid = {804907},
|
|
publisher = {ACM},
|
|
address = {New York, NY, USA},
|
|
}
|
|
|
|
@InProceedings{10.1007/3-540-60368-9_19,
|
|
author="Wilson, Paul R.
|
|
and Johnstone, Mark S.
|
|
and Neely, Michael
|
|
and Boles, David",
|
|
editor="Baler, Henry G.",
|
|
title="Dynamic storage allocation: A survey and critical review",
|
|
booktitle="Memory Management",
|
|
year="1995",
|
|
publisher="Springer Berlin Heidelberg",
|
|
address="Berlin, Heidelberg",
|
|
pages="1--116",
|
|
abstract="Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. In this survey, we describe a variety of memory allocator designs and point out issues relevant to their design and evaluation. We then chronologically survey most of the literature on allocators between 1961 and 1995. (Scores of papers are discussed, in varying detail, and over 150 references are given.)",
|
|
isbn="978-3-540-45511-0"
|
|
}
|
|
|
|
@misc{vma_paging, title={Virtual Memory Allocation And Paging}, url={https://ftp.gnu.org/old-gnu/Manuals/glibc-2.2.3/html_chapter/libc_3.html}, journal={The GNU C Library - Virtual Memory Allocation And Paging}, publisher={Free Software Foundation}, year={2001}, month={May}}
|
|
|
|
@book{knuth1973art,
|
|
title={The Art of Computer Programming: Fundamental Algorithms},
|
|
author={Knuth, D.E.},
|
|
number={v. 1-2},
|
|
isbn={9780201038217},
|
|
series={Addison-Wesley series in computer science and information processing},
|
|
url={https://books.google.com/books?id=dC05RwAACAAJ},
|
|
year={1973},
|
|
publisher={Addison-Wesley}
|
|
}
|
|
|
|
|