Sciweavers

988 search results - page 60 / 198
» The Frontiers of Data Programmability
Sort
View
CODES
2010
IEEE
14 years 10 months ago
Automatic memory partitioning: increasing memory parallelism via data structure partitioning
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
Yosi Ben-Asher, Nadav Rotem
103
Voted
TPHOL
2007
IEEE
15 years 6 months ago
Formalising Java's Data Race Free Guarantee
We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. ...
David Aspinall, Jaroslav Sevcík
108
Voted
TJS
2002
83views more  TJS 2002»
15 years 6 days ago
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
PDP
2009
IEEE
15 years 7 months ago
Task-Parallel versus Data-Parallel Library-Based Programming in Multicore Systems
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
Diego Andrade, Basilio B. Fraguela, James C. Brodm...
85
Voted
IPPS
2008
IEEE
15 years 7 months ago
A transparent non-invasive file data model for algorithmic skeletons
A file data model for algorithmic skeletons is proposed, focusing on transparency and efficiency. Algorithmic skeletons correspond to a high-level programming model that takes a...
Denis Caromel, Mario Leyton