SPAA 2009 - PDF Preprint Papers

SPAA 2009 ACM Symposium on Parallel Algorithms and Architectures

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SPAA-2009 Paper

click to vote

SPAA
2009
ACM

1514views Distributed And Parallel Com...» more SPAA 2009»

A lightweight in-place implementation for software thread-level speculation

14 years 5 months ago

Download parasol.tamu.edu

Thread-level speculation (TLS) is a technique that allows parts of a sequential program to be executed in parallel. TLS ensures the parallel program's behaviour remains true ...

Cosmin E. Oancea, Alan Mycroft, Tim Harris

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	1514	A lightweight in-place implementation for software thread-level speculation	claim
2	196	Reducers and other Cilk++ hyperobjects	claim
3	174	Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures	claim
4	173	On randomized representations of graphs using short labels	claim
5	170	Brief announcement: a lower bound for depth-restricted work stealing	claim
6	168	Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design	claim
7	160	Approximation algorithms for time-constrained scheduling on line networks	claim
8	160	Weak graph colorings: distributed algorithms and applications	claim
9	159	NZTM: nonblocking zero-indirection transactional memory	claim
10	159	Locally scalable randomized consensus for synchronous crash failures	claim
11	156	Brief announcement: low depth cache-oblivious sorting	claim
12	155	The bell is ringing in speed-scaled multiprocessor scheduling	claim
13	153	Classifying peer-to-peer network coding schemes	claim
14	151	Buffer management for colored packets with deadlines	claim
15	149	Dynamic external hashing: the limit of buffering	claim
16	145	Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks	claim
17	141	Brief announcement: selfishness in transactional memory	claim
18	141	Distributed algorithms for QoS load balancing	claim
19	138	On the complexity of the regenerator placement problem in optical networks	claim
20	135	An optimal local approximation algorithm for max-min linear programs	claim
21	132	The weakest failure detector for wait-free dining under eventual weak exclusion	claim
22	129	A randomized, o(log w)-depth 2 smoothing network	claim
23	125	On avoiding spare aborts in transactional memory	claim
24	121	A DoS-resilient information system for dynamic data management	claim
25	117	Towards transactional memory semantics for C++	claim
26	117	Routing without ordering	claim
27	117	Gradient clock synchronization in dynamic networks	claim
28	117	Optimizing transactions for captured memory	claim
29	113	Inherent limitations on disjoint-access parallel implementations of transactional memory	claim
30	109	At-most-once semantics in asynchronous shared memory	claim
31	109	Field-split parallel architecture for high performance multi-match packet classification using FPGAs	claim
32	108	Mapping filtering streaming applications with communication costs	claim
33	106	Scheduling to minimize staleness and stretch in real-time data warehouses	claim
34	102	Speed scaling of processes with arbitrary speedup curves on a multiprocessor	claim
35	98	Remote storage with byzantine servers	claim
36	97	Scalable reader-writer locks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers