Buscar
Mostrando ítems 1-10 de 51
Multiprocessor task scheduling on heterogeneous environments by a Hybrid Chemical Reactions Optimization
(Institute of Electrical and Electronics Engineers Inc., 2017)
This work presents the modeling and implementation of a Hybrid Chemical Reactions Optimization that uses CRO operators to find good solutions, and heuristics to initialize the first population and mapping tasks in processors ...
Evolutionary Models applied to Multiprocessor TaskScheduling: Serial and Multipopulation Genetic Algorithm
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2019)
Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
(Springer, 2012-11)
Optimal multiprocessor real-time schedulers incur significant overhead for preemptions and migrations. We present RUN, an efficient scheduler that reduces the multiprocessor problem to a series of uniprocessor problems. ...
Limited Preemption in Real-Time Scheduling
(Computación y Sistemas, 2009)
Escalonamento de tarefas e fluxos de comunicação para sistemas semi-particionados em arquiteturas NoC
(Universidade Federal de Santa MariaBRCiência da ComputaçãoUFSMPrograma de Pós-Graduação em Informática, 2014-03-24)
Despiste the fact that many scheduling models teoretically capable of high system resource
utilization were proposed with the development of the real-time system, the industry still uses
the first scheduling model proposed ...
A generalized parallel task model for recurrent real-time processes
(Association for Computing Machinery, 2019)
A model is considered for representing recurrent precedence-constrained tasks that are to execute on multiprocessor platforms. A recurrent task is specified as a directed acyclic graph (DAG), a period, and a relative ...
A polynomial-time branching procedure for the multiprocessor scheduling problem
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
On the processor utilization bound of the C=D Scheduling Algorithm
(CreateSpace Independent Publishing Platform, 2013-03)
Under semi-partitioned multiprocessor scheduling some (or most) tasks are partitioned to the available processors while the rest may migrate between different processors, under a carefully managed scheme.
One of the best ...
Scheduling multiprocessor tasks with genetic algorithms
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)