Sciweavers

4542 search results - page 813 / 909
» Design patterns for data structures
Sort
View
PPOPP
2009
ACM
16 years 13 days ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...
PPOPP
2009
ACM
16 years 13 days 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...
SPAA
2009
ACM
16 years 13 days 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
CHI
2008
ACM
16 years 8 days 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
2007
ACM
16 years 8 days ago
A minimal model for predicting visual search in human-computer interaction
Visual search is an important part of human-computer interaction. It is critical that we build theory about how people visually search displays in order to better support the user...
Tim Halverson, Anthony J. Hornof