Sciweavers

511 search results - page 16 / 103
» More Precise Partition Abstractions
Sort
View
IPPS
2010
IEEE
13 years 6 months ago
Scalable parallel I/O alternatives for massively parallel partitioned solver systems
Abstract--With the development of high-performance computing, I/O issues have become the bottleneck for many massively parallel applications. This paper investigates scalable paral...
Jing Fu, Ning Liu, Onkar Sahni, Kenneth E. Jansen,...
AGP
1999
IEEE
14 years 1 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
14 years 2 months ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik
TCAD
2008
75views more  TCAD 2008»
13 years 8 months ago
Static Analysis of Transaction-Level Communication Models
We propose a methodology for the early estimation of communication implementation choices eftarting from an abstract transaction level system model (TLM). The reference version of ...
Giovanni Agosta, Francesco Bruschi, Donatella Sciu...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 9 months ago
Multiprocessor Global Scheduling on Frame-Based DVFS Systems
In this work, we are interested in multiprocessor energy efficient systems where task durations are not known in advance but are known stochastically. More precisely we consider g...
Vandy Berten, Joël Goossens