Sciweavers

3663 search results - page 497 / 733
» Problems in the ontology of computer programs
Sort
View
HPDC
1996
IEEE
15 years 10 months ago
Customized Dynamic Load Balancing for a Network of Workstations
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Althoughstatic load balancing can solve ma...
Mohammed Javeed Zaki, Wei Li, Srinivasan Parthasar...
IPPS
1996
IEEE
15 years 10 months ago
Maximizing Speedup through Self-Tuning of Processor Allocation
We address the problem of maximizing application speedup through runtime, self-selection of an appropriate number of processors on which to run. Automatic, runtime selection of pr...
Thu D. Nguyen, Raj Vaswani, John Zahorjan
ECAI
1992
Springer
15 years 10 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
ICALP
1992
Springer
15 years 10 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
CP
2006
Springer
15 years 10 months ago
Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
Michele Lombardi, Michela Milano