Sciweavers

15485 search results - page 451 / 3097
» Computing Optimal Subsets
Sort
View
WG
2004
Springer
16 years 6 days ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
RTCSA
2000
IEEE
15 years 11 months ago
Scheduling optional computations in fault-tolerant real-time systems
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
Pedro Mejía-Alvarez, Hakan Aydin, Daniel Mo...
IPPS
1997
IEEE
15 years 11 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
181
Voted
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
15 years 11 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
174
Voted
IPPS
1995
IEEE
15 years 10 months ago
Index translation schemes for adaptive computations on distributed memory multicomputers
Current research in parallel programming is focused on closing the gap between globally indexed algorithms and the separate address spaces of processors on distributed memory mult...
Bongki Moon, Mustafa Uysal, Joel H. Saltz