Sciweavers

4797 search results - page 76 / 960
» The complexity of partition tasks
Sort
View
ECRTS
2002
IEEE
14 years 1 months ago
Integrating Aperiodic and Recurrent Tasks on Fair-Scheduled Multiprocessors
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
Anand Srinivasan, Philip Holman, James H. Anderson
CCGRID
2008
IEEE
14 years 3 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
IPPS
2006
IEEE
14 years 2 months ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...
IEEEICCI
2005
IEEE
14 years 2 months ago
Toward the development of cognitive task difficulty metrics to support intelligence analysis research
Intelligence analysis is a cognitively complex task that is the subject of considerable research aimed at developing methods and tools to aid the analysis process. To support such...
Frank L. Greitzer
OPODIS
2007
13 years 10 months ago
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
Theodore P. Baker, Michele Cirinei