Sciweavers

2479 search results - page 157 / 496
» A Computational Theory of Working Memory
Sort
View
HPCA
2002
IEEE
14 years 2 months ago
User-Level Communication in Cluster-Based Servers
Clusters of commodity computers are currently being used to provide the scalability required by severalpopular Internet services. In this paper we evaluate an efficient cluster-b...
Enrique V. Carrera, Srinath Rao, Liviu Iftode, Ric...
ICS
2001
Tsinghua U.
14 years 1 months ago
Tools for application-oriented performance tuning
Application performance tuning is a complex process that requires assembling various types of information and correlating it with source code to pinpoint the causes of performance...
John M. Mellor-Crummey, Robert J. Fowler, David B....
PPOPP
1999
ACM
14 years 1 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
IPPS
1999
IEEE
14 years 1 months ago
COWL: Copy-On-Write for Logic Programs
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
Vítor Santos Costa
GI
1999
Springer
14 years 1 months ago
Caching in Networks
d Abstract) Friedhelm Meyer auf der Heide   Berthold V¨ocking† Matthias Westermann   We present a general framework for the development of online algorithms for data manageme...
Matthias Westermann