1053 search results - page 74 / 211 » Estimating Execution Time of Distributed Applications |
103
click to vote
ISCA
2007
IEEE
15 years 6 months ago
2007
IEEE
Analytical modeling is applied to the automated design of application-specific superscalar processors. Using an analytical method bridges the gap between the size of the design sp...
123
click to vote
ICPP
1999
IEEE
15 years 4 months ago
1999
IEEE
The probability of failures in software distributed shared memory (SDSM) increases as the system size grows. This paper introduces a new, efficient message logging technique, call...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper, we propose a new, efficient logging protocol, called lazy logging, and a fast crash recovery protocol, called the prefetch-based crash recovery (PCR), for software ...
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Loop distribution is one of the most useful techniques to reduce the execution time of parallel applications. Traditionally, loop scheduling algorithms are implemented based on pa...