Sciweavers

8493 search results - page 1017 / 1699
» Implementing a distributed firewall
Sort
View
PODC
1993
ACM
15 years 11 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
PPOPP
1993
ACM
15 years 11 months ago
LogP: Towards a Realistic Model of Parallel Computation
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representati...
David E. Culler, Richard M. Karp, David A. Patters...
ICS
1992
Tsinghua U.
15 years 11 months ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne
ICS
1989
Tsinghua U.
15 years 11 months ago
Control flow optimization for supercomputer scalar processing
Control intensive scalar programs pose a very different challenge to highly pipelined supercomputers than vectorizable numeric applications. Function call/return and branch instru...
Pohua P. Chang, Wen-mei W. Hwu
PPOPP
1990
ACM
15 years 11 months ago
Multi-Model Parallel Programming in Psyche
Many different parallel programming models, including lightweight processes that communicate with shared memory and heavyweight processes that communicate with messages, have been...
Michael L. Scott, Thomas J. LeBlanc, Brian D. Mars...
« Prev « First page 1017 / 1699 Last » Next »