Sciweavers

12742 search results - page 2365 / 2549
» On canonical number systems
Sort
View
HPCA
2003
IEEE
16 years 7 months ago
Slipstream Execution Mode for CMP-Based Multiprocessors
Scalability of applications on distributed sharedmemory (DSM) multiprocessors is limited by communication overheads. At some point, using more processors to increase parallelism y...
Khaled Z. Ibrahim, Gregory T. Byrd, Eric Rotenberg
CHI
2004
ACM
16 years 7 months ago
Automatic support for web user studies with SCONE and TEA
This paper describes the concepts of TEA, a flexible tool that supports user tests by automating repetitive tasks and collecting data of user inputs and actions. TEA was specifica...
Hartmut Obendorf, Harald Weinreich, Torsten Hass
POPL
2006
ACM
16 years 6 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
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 6 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 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 ...
« Prev « First page 2365 / 2549 Last » Next »