Sciweavers

1137 search results - page 73 / 228
» A study of slipstream processors
Sort
View
TC
1998
13 years 7 months ago
Analysis of Checkpointing Schemes with Task Duplication
—This paper suggests a technique for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execut...
Avi Ziv, Jehoshua Bruck
TPDS
1998
95views more  TPDS 1998»
13 years 7 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
MODELS
2010
Springer
13 years 6 months ago
Transformation-Based Parallelization of Request-Processing Applications
Abstract. Multicore, multithreaded processors are rapidly becoming the platform of choice for high-throughput request-processing applications (RPAs). We refer to this class of mode...
Taylor L. Riché, Harrick M. Vin, Don S. Bat...
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 2 months ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Georg Moser, Andreas Schnabl
ICCD
2004
IEEE
96views Hardware» more  ICCD 2004»
14 years 4 months ago
Dynamic Address Compression Schemes: A Performance, Energy, and Cost Study
Dynamic address compression schemes that exploit address locality can help reduce both address bus energy and cost simultaneously with only a small performance penalty. In this wo...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...