Sciweavers

4460 search results - page 854 / 892
» Resources in process algebra
Sort
View
SIGMOD
1997
ACM
166views Database» more  SIGMOD 1997»
15 years 10 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....
ASPLOS
1996
ACM
15 years 10 months ago
Analysis of Branch Prediction Via Data Compression
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge
VLDB
1997
ACM
126views Database» more  VLDB 1997»
15 years 10 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
ISCA
1993
IEEE
112views Hardware» more  ISCA 1993»
15 years 10 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
SP
1989
IEEE
15 years 10 months ago
Security Issues in Policy Routing
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
Deborah Estrin, Gene Tsudik