[图书][B] Task scheduling for parallel systems
O Sinnen - 2007 - books.google.com
A new model for task scheduling that dramatically improves the efficiency of parallel systems
Task scheduling for parallel systems can become a quagmire of heuristics, models, and …
Task scheduling for parallel systems can become a quagmire of heuristics, models, and …
Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems
Generally, a parallel application consists of precedence constrained stochastic tasks, where
task processing times and intertask communication times are random variables following …
task processing times and intertask communication times are random variables following …
A study of optimal allocation of computing resources in cloud manufacturing systems
As a new advanced service-oriented networked manufacturing model, cloud manufacturing
(CMfg) has been proposed recently. The optimal allocation of computing resources (OACR) …
(CMfg) has been proposed recently. The optimal allocation of computing resources (OACR) …
A hierarchical reliability-driven scheduling algorithm in grid systems
In a Grid computing system, many distributed scientific and engineering applications often
require multi-institutional collaboration, large-scale resource sharing, wide-area …
require multi-institutional collaboration, large-scale resource sharing, wide-area …
Design of effective multiple classifier systems by clustering of classifiers
In the field of pattern recognition, multiple classifier systems based on the combination of
outputs of a set of different classifiers have been proposed as a method for the development …
outputs of a set of different classifiers have been proposed as a method for the development …
Asymptotic scheduling for many task computing in big data platforms
A Sfrent, F Pop - Information Sciences, 2015 - Elsevier
Due to the advancement of technology the datasets that are being processed nowadays in
modern computer clusters extend beyond the petabyte scale–the 4 detectors of the Large …
modern computer clusters extend beyond the petabyte scale–the 4 detectors of the Large …
Heterogeneity-driven end-to-end synchronized scheduling for precedence constrained tasks and messages on networked embedded systems
Scheduling for a directed acyclic graph (DAG) on networked embedded systems is to
maximize concurrency and minimize inter-processor communication for minimum end-to …
maximize concurrency and minimize inter-processor communication for minimum end-to …
Reliability-aware scheduling strategy for heterogeneous distributed computing systems
X Tang, K Li, R Li, B Veeravalli - Journal of Parallel and Distributed …, 2010 - Elsevier
Heterogeneous computing systems are promising computing platforms, since single parallel
architecture based systems may not be sufficient to exploit the available parallelism with the …
architecture based systems may not be sufficient to exploit the available parallelism with the …
Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization
PY Yin, SS Yu, PP Wang, YT Wang - Journal of Systems and Software, 2007 - Elsevier
In a distributed computing system, a number of program modules may need to be allocated
to different processors such that the reliability of executing successfully these modules is …
to different processors such that the reliability of executing successfully these modules is …
Runpar: An allocation algorithm for automotive applications exploiting runnable parallelism in multicores
M Panić, S Kehr, E Quiñones, B Boddecker… - Proceedings of the …, 2014 - dl.acm.org
Automotive applications increasingly rely on AUTOSAR for their design and execution.
AUTOSAR applications comprise functions, called runnables, that are grouped into …
AUTOSAR applications comprise functions, called runnables, that are grouped into …