A Comparison of Scalable Multi-Threaded Stack Mechanisms. Moore-Oliva, J. I. Master's thesis, McMaster University, Hamilton, Ontario, Canada, December, 2010. ![A Comparison of Scalable Multi-Threaded Stack Mechanisms [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex The traditional "stack grows from the top, heap grows from the bottom" memory layout allows a single-threaded process to make use of all available address space. This layout is not ideal when multiple threads of execution need to share one address space, for memory exhaustion is no longer signified by the heap meeting the stack. In the commonly used multi-threaded memory layout where each thread has its "worst case" stack memory exclusively reserved, a process may prematurely run out of memory when one thread's stack collides with another's, even if there is unused address space elsewhere. This problem is exacerbated as the number of threads in a process increases since there is less stack space available per thread. In this thesis, alternative stack mechanisms that attempt to alleviate this problem are reviewed, and a new stack mechanism is put forward that utilizes the MMU to detect stack overflow. An experimental compiler implementing a subset of the C language is used to implement promising stack mechanisms, and a suite of test programs are used to compare their performance and scalability under varying usage patterns.
@mastersthesis{moore-oliva_comparison_2010,
address = {Hamilton, Ontario, Canada},
title = {A {Comparison} of {Scalable} {Multi}-{Threaded} {Stack} {Mechanisms}},
url = {http://hdl.handle.net/11375/9011},
abstract = {The traditional "stack grows from the top, heap grows from the bottom" memory layout allows a single-threaded process to make use of all available address space. This layout is not ideal when multiple threads of execution need to share one address space, for memory exhaustion is no longer signified by the heap meeting the stack. In the commonly used multi-threaded memory layout where each thread has its "worst case" stack memory exclusively reserved, a process may prematurely run out of memory when one thread's stack collides with another's, even if there is unused address space elsewhere. This problem is exacerbated as the number of threads in a process increases since there is less stack space available per thread. In this thesis, alternative stack mechanisms that attempt to alleviate this problem are reviewed, and a new stack mechanism is put forward that utilizes the MMU to detect stack overflow. An experimental compiler implementing a subset of the C language is used to implement promising stack mechanisms, and a suite of test programs are used to compare their performance and scalability under varying usage patterns.},
school = {McMaster University},
author = {Moore-Oliva, Joshua I.},
month = dec,
year = {2010},
}
Downloads: 0
{"_id":"wgyNMKEp3nr7kP5u5","bibbaseid":"mooreoliva-acomparisonofscalablemultithreadedstackmechanisms-2010","author_short":["Moore-Oliva, J. I."],"bibdata":{"bibtype":"mastersthesis","type":"mastersthesis","address":"Hamilton, Ontario, Canada","title":"A Comparison of Scalable Multi-Threaded Stack Mechanisms","url":"http://hdl.handle.net/11375/9011","abstract":"The traditional \"stack grows from the top, heap grows from the bottom\" memory layout allows a single-threaded process to make use of all available address space. This layout is not ideal when multiple threads of execution need to share one address space, for memory exhaustion is no longer signified by the heap meeting the stack. In the commonly used multi-threaded memory layout where each thread has its \"worst case\" stack memory exclusively reserved, a process may prematurely run out of memory when one thread's stack collides with another's, even if there is unused address space elsewhere. This problem is exacerbated as the number of threads in a process increases since there is less stack space available per thread. In this thesis, alternative stack mechanisms that attempt to alleviate this problem are reviewed, and a new stack mechanism is put forward that utilizes the MMU to detect stack overflow. An experimental compiler implementing a subset of the C language is used to implement promising stack mechanisms, and a suite of test programs are used to compare their performance and scalability under varying usage patterns.","school":"McMaster University","author":[{"propositions":[],"lastnames":["Moore-Oliva"],"firstnames":["Joshua","I."],"suffixes":[]}],"month":"December","year":"2010","bibtex":"@mastersthesis{moore-oliva_comparison_2010,\n\taddress = {Hamilton, Ontario, Canada},\n\ttitle = {A {Comparison} of {Scalable} {Multi}-{Threaded} {Stack} {Mechanisms}},\n\turl = {http://hdl.handle.net/11375/9011},\n\tabstract = {The traditional \"stack grows from the top, heap grows from the bottom\" memory layout allows a single-threaded process to make use of all available address space. This layout is not ideal when multiple threads of execution need to share one address space, for memory exhaustion is no longer signified by the heap meeting the stack. In the commonly used multi-threaded memory layout where each thread has its \"worst case\" stack memory exclusively reserved, a process may prematurely run out of memory when one thread's stack collides with another's, even if there is unused address space elsewhere. This problem is exacerbated as the number of threads in a process increases since there is less stack space available per thread. In this thesis, alternative stack mechanisms that attempt to alleviate this problem are reviewed, and a new stack mechanism is put forward that utilizes the MMU to detect stack overflow. An experimental compiler implementing a subset of the C language is used to implement promising stack mechanisms, and a suite of test programs are used to compare their performance and scalability under varying usage patterns.},\n\tschool = {McMaster University},\n\tauthor = {Moore-Oliva, Joshua I.},\n\tmonth = dec,\n\tyear = {2010},\n}\n\n","author_short":["Moore-Oliva, J. I."],"key":"moore-oliva_comparison_2010","id":"moore-oliva_comparison_2010","bibbaseid":"mooreoliva-acomparisonofscalablemultithreadedstackmechanisms-2010","role":"author","urls":{"Paper":"http://hdl.handle.net/11375/9011"},"metadata":{"authorlinks":{}}},"bibtype":"mastersthesis","biburl":"https://api.zotero.org/users/2218414/collections/6P65S5DZ/items?key=5GEsy5KK5k3NW6g00lvqCrRy&format=bibtex&limit=100","dataSources":["QefEapbXGXWuTqpmX"],"keywords":[],"search_terms":["comparison","scalable","multi","threaded","stack","mechanisms","moore-oliva"],"title":"A Comparison of Scalable Multi-Threaded Stack Mechanisms","year":2010}