Sciweavers

29 search results - page 3 / 6
» Edge maps: Representing flow with bounded error
Sort
View
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
POPL
1996
ACM
15 years 1 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
14 years 9 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
HIPEAC
2007
Springer
15 years 1 months ago
Efficient Program Power Behavior Characterization
Fine-grained program power behavior is useful in both evaluating power optimizations and observing power optimization opportunities. Detailed power simulation is time consuming and...
Chunling Hu, Daniel A. Jiménez, Ulrich Krem...
CAGD
2006
120views more  CAGD 2006»
14 years 9 months ago
Quality meshing of implicit solvation models of biomolecular structures
This paper describes a comprehensive approach to construct quality meshes for implicit solvation models of biomolecular structures starting from atomic resolution data in the Prot...
Yongjie Zhang, Guoliang Xu, Chandrajit L. Bajaj