Sciweavers

11211 search results - page 1911 / 2243
» Rank-Sensitive Data Structures
Sort
View
PPOPP
2009
ACM
16 years 4 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
115
Voted
SPAA
2009
ACM
16 years 4 months ago
Inherent limitations on disjoint-access parallel implementations of transactional memory
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...
Hagit Attiya, Eshcar Hillel, Alessia Milani
119
Voted
HPCA
2009
IEEE
16 years 4 months ago
Criticality-based optimizations for efficient load processing
Some instructions have more impact on processor performance than others. Identification of these critical instructions can be used to modify and improve instruction processing. Pr...
Samantika Subramaniam, Anne Bracy, Hong Wang 0003,...
123
Voted
CHI
2008
ACM
16 years 4 months ago
The cost of interrupted work: more speed and stress
We performed an empirical study to investigate whether the context of interruptions makes a difference. We found that context does not make a difference but surprisingly, people c...
Gloria Mark, Daniela Gudith, Ulrich Klocke
CHI
2008
ACM
16 years 4 months ago
A resource kit for participatory socio-technical design in rural Kenya
We describe our approach and initial results in the participatory design of technology relevant to local rural livelihoods. Our approach to design and usability proceeds from rese...
Kevin Walker, Joshua Underwood, Timothy Mwololo Wa...
« Prev « First page 1911 / 2243 Last » Next »