Sciweavers

4539 search results - page 833 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CHI
2005
ACM
16 years 1 months ago
Digital Family Portrait Field Trial: Support for Aging in Place
A growing social problem in the U.S., and elsewhere, is enabling older adults to continue living independently, as opposed to moving to an institutional care setting. One key part...
Jim Rowan, Elizabeth D. Mynatt
HPCA
2007
IEEE
16 years 1 months ago
MemTracker: Efficient and Programmable Support for Memory Access Monitoring and Debugging
Memory bugs are a broad class of bugs that is becoming increasingly common with increasing software complexity, and many of these bugs are also security vulnerabilities. Unfortuna...
Guru Venkataramani, Brandyn Roemer, Yan Solihin, M...
HPCA
2005
IEEE
16 years 1 months ago
Improving Multiple-CMP Systems Using Token Coherence
Improvements in semiconductor technology now enable Chip Multiprocessors (CMPs). As many future computer systems will use one or more CMPs and support shared memory, such systems ...
Michael R. Marty, Jesse D. Bingham, Mark D. Hill, ...
POPL
2006
ACM
16 years 1 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 1 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...