Sciweavers

6028 search results - page 1168 / 1206
» Randomness as a resource for design
Sort
View
PPOPP
1997
ACM
13 years 12 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
SIGMOD
1997
ACM
166views Database» more  SIGMOD 1997»
13 years 12 months ago
The InfoSleuth Project
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
Roberto J. Bayardo Jr., William Bohrer, Richard S....
ISCA
1993
IEEE
112views Hardware» more  ISCA 1993»
13 years 12 months ago
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...
Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta
ATAL
2007
Springer
13 years 11 months ago
Resolving conflict and inconsistency in norm-regulated virtual organizations
Norm-governed virtual organizations define, govern and facilitate coordinated resource sharing and problem solving in societies of agents. With an explicit account of norms, openn...
Wamberto Weber Vasconcelos, Martin J. Kollingbaum,...
DASFAA
2007
IEEE
165views Database» more  DASFAA 2007»
13 years 11 months ago
Making the Most of Cache Groups
Cache groups are a powerful concept for database caching, which is used to relieve the backend database load and to keep referenced data close to the application programs at the &q...
Andreas Bühmann, Theo Härder
« Prev « First page 1168 / 1206 Last » Next »