Sciweavers

Share
407 search results - page 2 / 82
» Malleable Proof Systems and Applications
Sort
View
EUROPAR
2004
Springer
12 years 9 months ago
Lookahead Scheduling for Reconfigurable GRID Systems
Abstract This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic...
Jesper Andersson, Morgan Ericsson, Welf Löwe,...
CCGRID
2007
IEEE
13 years 4 days ago
Dynamic Malleability in Iterative MPI Applications
Malleability enables a parallel application’s execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to...
Kaoutar El Maghraoui, Travis J. Desell, Boleslaw K...
SRDS
2006
IEEE
12 years 11 months ago
MOve: Design of An Application-Malleable Overlay
Peer-to-peer overlays allow distributed applications to work in a wide-area, scalable, and fault-tolerant manner. However, most structured and unstructured overlays present in lit...
Sébastien Monnet, Ramsés Morales, Ga...
FPL
2004
Springer
144views Hardware» more  FPL 2004»
12 years 9 months ago
A Methodology for Energy Efficient FPGA Designs Using Malleable Algorithms
A recent trend towards integrating FPGAs with many heterogeneous components, such as memory systems, dedicated multipliers, etc., has made them an attractive option for implementin...
Jingzhao Ou, Viktor K. Prasanna
VMCAI
2012
Springer
11 years 1 months ago
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
Tobias Nipkow
books