DocumentCode
3628515
Title
An enhancement of futures runtime in presence of cache memory hierarchy
Author
Matko Botincan;Davor Runje
Author_Institution
Department of Mathematics, University of Zagreb, Bijeni?ka cesta 30, 10000, Croatia
fYear
2008
fDate
6/1/2008 12:00:00 AM
Firstpage
925
Lastpage
930
Abstract
A future is a simple abstraction mechanism for exposing potential concurrency in programs. In this paper, we propose an enhancement of our previously developed runtime for scheduling and executing futures based on the lazy task creation technique that aims to reflect the cache memory hierarchy present in modern multi-core and multiprocessor systems.
Keywords
"Runtime","Program processors","Cache memory","Concurrent computing","Magnetic cores","Binary trees","Organizations"
Publisher
ieee
Conference_Titel
Information Technology Interfaces, 2008. ITI 2008. 30th International Conference on
ISSN
1330-1012
Print_ISBN
978-953-7138-12-7
Type
conf
DOI
10.1109/ITI.2008.4588535
Filename
4588535
Link To Document