Sciweavers

1156 search results - page 119 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
CLUSTER
2007
IEEE
14 years 4 months ago
The challenges and rewards of petascale clusters
-Jul 2 - Santa Clara Conv Ctr - abstracts by 4/30 Asilomar Conference on Signals, Systems, and Computers due by June 1 [more] - Nov 1-4, 2009 - Asilomar Conf Grounds, Pacific Grove...
Mark Seager
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 10 months ago
A computationally-efficient construction for the matrix-based key distribution in sensor network
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high d...
Abedelaziz Mohaisen
CHI
2002
ACM
14 years 10 months ago
Movement model, hits distribution and learning in virtual keyboarding
In a ten-session experiment, six participants practiced typing with an expanding rehearsal method on an optimized virtual keyboard. Based on a large amount of in-situ performance ...
Shumin Zhai, Alison E. Sue, Johnny Accot
PODC
1997
ACM
14 years 2 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
IPPS
1997
IEEE
14 years 2 months ago
A Compile-Time Partitioning Strategy for Non-Rectangular Loop Nests
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...
Rizos Sakellariou