Normal view MARC view ISBD view

An Enhancement of Futures Runtime in Presence of Cache Memory Hierarchy

By:

Botincan, Matko

Material type: Article

ArticleDescription: 2008 16 (4) : 339-344Online resources:

Click here to access online

In: Novática 2000(143,145-147)Summary: 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.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 1 )

Holdings
Item type	Home library	Call number	Status	Date due	Barcode
Artículo de revista	Biblioteca de la Facultad de Informática	RA NOV (Browse shelf(Opens below))	No corresponde

Browsing Biblioteca de la Facultad de Informática shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	RA NOV Web-enabling Cache Daemon for Complex Data	RA NOV N-Queens-based Algorithm for Moving Object Detection in Distributed Wireless Sensor Networks	RA NOV HGRID: A Self-configuring Grid Resource Discovery	RA NOV An Enhancement of Futures Runtime in Presence of Cache Memory Hierarchy	RA NOV Using a Typed Mind Map as a Data Model in a TDD DICE System	RA NOV ¿Está nuestra organización preparada para quedarse sin servicio informático durante semanas? ¿Estamos poniendo en marcha buenas prácticas tipo ITIL?	RA NOV Salidas profesionales del Ingeniero e Ingeniero Técnico en Informática en la Educación	Next

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.