Sciweavers

4940 search results - page 438 / 988
» On the Complexity of Universal Programs
Sort
View
CPAIOR
2006
Springer
15 years 10 months ago
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 10 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
FPCA
1987
15 years 10 months ago
Categorical multi-combinators
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
Rafael Dueire Lins
HOTDEP
2008
122views Hardware» more  HOTDEP 2008»
15 years 9 months ago
Dependable Self-Hosting Distributed Systems Using Constraints
We describe a technique for writing distributed applications which manage themselves over one or more utility computing infrastructures: by dynamically acquiring new computational...
Qin Yin, Justin Cappos, Andrew Baumann, Timothy Ro...
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 8 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi