Sciweavers

314 search results - page 35 / 63
» Reducing Parallel Overheads Through Dynamic Serialization
Sort
View
ICPP
2008
IEEE
14 years 3 months ago
Scalable Techniques for Transparent Privatization in Software Transactional Memory
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
Virendra J. Marathe, Michael F. Spear, Michael L. ...
IPPS
2005
IEEE
14 years 2 months ago
A Lightweight Scheme for Auto-configuration in Mobile Ad Hoc Networks
An efficient addressing scheme is necessary for auto-configuration and seamless communication in pervasive computing environments. In this paper, we propose an efficient and simple...
Mijeom Kim, Mohan Kumar, Behrooz Shirazi
ASPLOS
2009
ACM
14 years 9 months ago
Kendo: efficient deterministic multithreading in software
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...
Marek Olszewski, Jason Ansel, Saman P. Amarasinghe
IPPS
2006
IEEE
14 years 2 months ago
On-the-fly kernel updates for high-performance computing clusters
High-performance computing clusters running longlived tasks currently cannot have kernel software updates applied to them without causing system downtime. These clusters miss oppo...
Kristis Makris, Kyung Dong Ryu
IEEEPACT
2002
IEEE
14 years 1 months ago
Increasing and Detecting Memory Address Congruence
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...
Samuel Larsen, Emmett Witchel, Saman P. Amarasingh...