Sciweavers

2452 search results - page 70 / 491
» The Case for Precision Sharing
Sort
View
INFOCOM
1997
IEEE
15 years 4 months ago
Atomic Resource Sharing in Noncooperative Networks
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
Lavy Libman, Ariel Orda
ICPP
1994
IEEE
15 years 4 months ago
Optimizing IPC Performance for Shared-Memory Multiprocessors
We assert that in order to perform well, a shared-memory multiprocessorinter-process communication (IPC)facility mustavoid a) accessing any shared data, and b) acquiring any locks...
Benjamin Gamsa, Orran Krieger, Michael Stumm
EUROCRYPT
2000
Springer
15 years 3 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
SIGCOMM
1995
ACM
15 years 3 months ago
Pipelined Memory Shared Buffer for VLSI Switches
ABSTRACT: Switch chips are building blocks for computer and communication systems. Switches need internal buffering, because of output contention; shared buffering is known to perf...
Manolis Katevenis, Panagiota Vatsolaki, Aristides ...
CF
2005
ACM
15 years 1 months ago
Exploiting processor groups to extend scalability of the GA shared memory programming model
Exploiting processor groups is becoming increasingly important for programming next-generation high-end systems composed of tens or hundreds of thousands of processors. This paper...
Jarek Nieplocha, Manojkumar Krishnan, Bruce Palmer...