Sciweavers

7456 search results - page 1357 / 1492
» Parallelism in Logic Programming
Sort
View
142
Voted
PPOPP
2012
ACM
13 years 11 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ICDCS
2012
IEEE
13 years 5 months ago
Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing
—Cloud resources are usually priced in multiple markets with different service guarantees. For example, Amazon EC2 prices virtual instances under three pricing schemes — the su...
Wei Wang, Baochun Li, Ben Liang
PPOPP
2009
ACM
16 years 3 months ago
A compiler-directed data prefetching scheme for chip multiprocessors
Data prefetching has been widely used in the past as a technique for hiding memory access latencies. However, data prefetching in multi-threaded applications running on chip multi...
Dhruva Chakrabarti, Mahmut T. Kandemir, Mustafa Ka...
230
Voted
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 3 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
PPOPP
2010
ACM
16 years 17 days ago
Using data structure knowledge for efficient lock generation and strong atomicity
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
Gautam Upadhyaya, Samuel P. Midkiff, Vijay S. Pai
« Prev « First page 1357 / 1492 Last » Next »