Sciweavers

352 search results - page 46 / 71
» Good Programming in Transactional Memory
Sort
View
PPOPP
1999
ACM
13 years 12 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
LCPC
2009
Springer
14 years 5 days ago
Fastpath Speculative Parallelization
Abstract. We describe Fastpath, a system for speculative parallelization of sequential programs on conventional multicore processors. Our system distinguishes between the lead thre...
Michael F. Spear, Kirk Kelsey, Tongxin Bai, Luke D...
CASCON
1997
74views Education» more  CASCON 1997»
13 years 9 months ago
A high performance get-put interface for ATM communications
This paper describes the implementation of a reliable Get-Put interface written for a distributed memory environment. The asynchronous semantics of the Put as well as the split tr...
Ronald Mraz, Edward Nowicki, Mathew Thoennes
SIGMOD
2007
ACM
224views Database» more  SIGMOD 2007»
14 years 7 months ago
Design of flash-based DBMS: an in-page logging approach
The popularity of high-density flash memory as data storage media has increased steadily for a wide spectrum of computing devices such as PDA's, MP3 players, mobile phones an...
Sang-Won Lee, Bongki Moon
JAVA
2001
Springer
14 years 1 days ago
Runtime optimizations for a Java DSM implementation
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. Jackal implements Java’s memory model and allows multithreaded Java programs...
Ronald Veldema, Rutger F. H. Hofman, Raoul Bhoedja...