Sciweavers

4797 search results - page 31 / 960
» The complexity of partition tasks
Sort
View
ICARIS
2010
Springer
13 years 7 months ago
A Developmental and Immune-Inspired Dynamic Task Allocation Algorithm for Microprocessor Array Systems
Abstract. This paper presents a high level dynamic task allocation algorithm that is inspired by the biological development process and the immune system. For a microprocessor (µP...
Yang Liu, Jon Timmis, Omer Qadir, Gianluca Tempest...
IPPS
1997
IEEE
14 years 1 months ago
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
Alan A. Bertossi, Andrea Fusiello, Luigi V. Mancin...
CASES
2005
ACM
13 years 10 months ago
Architectural support for real-time task scheduling in SMT processors
In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architec...
Francisco J. Cazorla, Peter M. W. Knijnenburg, Riz...
ICMCS
2005
IEEE
99views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Finding the Optimal Temporal Partitioning of Video Sequences
The existing techniques for shot partitioning either process each shot boundary independently or proceed sequentially. The sequential process assumes the last shot boundary is cor...
Ba Tu Truong, Svetha Venkatesh
ESWS
2010
Springer
14 years 18 days ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani