@techreport{MooreOlivaSekerinskiYao14MultiThreadedStack,
	type = {{CAS} {Technical} {Report}},
	title = {A {Comparison} of {Scalable} {Multi}-{Threaded} {Stack} {Mechanisms}},
	copyright = {http://www.cas.mcmaster.ca/cas/0reports/CAS-14-07-ES.pdf},
	url = {https://www.cas.mcmaster.ca/~emil/pubs/MooreOlivaSekerinskiYao14MultiThreadedStack.pdf},
	abstract = {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, 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 paper, 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 is used to implement promising stack mechanisms and a suite of benchmarks is used to compare their performance and scalability under varying usage profiles.},
	number = {CAS-14-07-ES},
	institution = {McMaster University},
	author = {Moore-Oliva, Joshua and Sekerinski, Emil and Yao, Shucai},
	month = apr,
	year = {2014},
	pages = {10},
}

{"_id":"N5gpWst3Hpvb5Dpaj","bibbaseid":"mooreoliva-sekerinski-yao-acomparisonofscalablemultithreadedstackmechanisms-2014","author_short":["Moore-Oliva, J.","Sekerinski, E.","Yao, S."],"bibdata":{"bibtype":"techreport","type":"CAS Technical Report","title":"A Comparison of Scalable Multi-Threaded Stack Mechanisms","copyright":"http://www.cas.mcmaster.ca/cas/0reports/CAS-14-07-ES.pdf","url":"https://www.cas.mcmaster.ca/~emil/pubs/MooreOlivaSekerinskiYao14MultiThreadedStack.pdf","abstract":"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, 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 paper, 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 is used to implement promising stack mechanisms and a suite of benchmarks is used to compare their performance and scalability under varying usage profiles.","number":"CAS-14-07-ES","institution":"McMaster University","author":[{"propositions":[],"lastnames":["Moore-Oliva"],"firstnames":["Joshua"],"suffixes":[]},{"propositions":[],"lastnames":["Sekerinski"],"firstnames":["Emil"],"suffixes":[]},{"propositions":[],"lastnames":["Yao"],"firstnames":["Shucai"],"suffixes":[]}],"month":"April","year":"2014","pages":"10","bibtex":"@techreport{MooreOlivaSekerinskiYao14MultiThreadedStack,\n\ttype = {{CAS} {Technical} {Report}},\n\ttitle = {A {Comparison} of {Scalable} {Multi}-{Threaded} {Stack} {Mechanisms}},\n\tcopyright = {http://www.cas.mcmaster.ca/cas/0reports/CAS-14-07-ES.pdf},\n\turl = {https://www.cas.mcmaster.ca/~emil/pubs/MooreOlivaSekerinskiYao14MultiThreadedStack.pdf},\n\tabstract = {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, 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.\nIn this paper, 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 is used to implement promising stack mechanisms and a suite of benchmarks is used to compare their performance and scalability under varying usage profiles.},\n\tnumber = {CAS-14-07-ES},\n\tinstitution = {McMaster University},\n\tauthor = {Moore-Oliva, Joshua and Sekerinski, Emil and Yao, Shucai},\n\tmonth = apr,\n\tyear = {2014},\n\tpages = {10},\n}\n\n","author_short":["Moore-Oliva, J.","Sekerinski, E.","Yao, S."],"key":"MooreOlivaSekerinskiYao14MultiThreadedStack","id":"MooreOlivaSekerinskiYao14MultiThreadedStack","bibbaseid":"mooreoliva-sekerinski-yao-acomparisonofscalablemultithreadedstackmechanisms-2014","role":"author","urls":{"Paper":"https://www.cas.mcmaster.ca/~emil/pubs/MooreOlivaSekerinskiYao14MultiThreadedStack.pdf"},"metadata":{"authorlinks":{}},"downloads":2},"bibtype":"techreport","biburl":"https://api.krunk.cn/emil/bib.php","dataSources":["HEdahWqKBpmSGmDwq","rRazdBuE63ZLofRun","MF5eGzpJnqf6bSAoG","ienufKdnmJs49AsjR","So4gmSWFmbQRNEuFs","ezsmw4w22u9JFLNYJ","CvQYP6Tmpapx74Mgr","RWydLHbBJqgdeh5jr"],"keywords":[],"search_terms":["comparison","scalable","multi","threaded","stack","mechanisms","moore-oliva","sekerinski","yao"],"title":"A Comparison of Scalable Multi-Threaded Stack Mechanisms","year":2014,"downloads":2}