Sciweavers

6299 search results - page 256 / 1260
» Data and Computation Abstractions for Dynamic and Irregular ...
Sort
View
PPOPP
1997
ACM
15 years 11 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
FMCO
2007
Springer
196views Formal Methods» more  FMCO 2007»
15 years 11 months ago
Coordinating Object Oriented Components Using Data-Flow Networks
We propose a framework for component-based modeling of distributed systems. It provides separation of concerns between computation (in object oriented components), coordination (vi...
Mohammad Mahdi Jaghoori
WABI
2005
Springer
16 years 22 days ago
Rotamer-Pair Energy Calculations Using a Trie Data Structure
Abstract. Protein design software places amino acid side chains by precomputing rotamer-pair energies and optimizing rotamer placement. If the software optimizes by rapid stochasti...
Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink
IPPS
2009
IEEE
16 years 1 months ago
Dynamic high-level scripting in parallel applications
Parallel applications typically run in batch mode, sometimes after long waits in a scheduler queue. In some situations, it would be desirable to interactively add new functionalit...
Filippo Gioachin, Laxmikant V. Kalé
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
15 years 8 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel