Sciweavers

252 search results - page 28 / 51
» Task Assignment and Scheduling under Memory Constraints
Sort
View
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 2 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini
AMC
2007
129views more  AMC 2007»
13 years 7 months ago
Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
RTSS
2000
IEEE
13 years 11 months ago
An Incremental Approach to Scheduling during Overloads in Real-Time Systems
In this paper we propose a novel scheduling framework for a real-timeenvironmentthat experiences dynamic changes. Thisframework is capable of adjusting the system workload in incr...
Pedro Mejía-Alvarez, Rami G. Melhem, Daniel...
TC
2008
13 years 7 months ago
Deferrable Scheduling for Maintaining Real-Time Data Freshness: Algorithms, Analysis, and Results
The periodic update transaction model has been used to maintain the freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus of pa...
Ming Xiong, Song Han, Kam-yiu Lam, Deji Chen