Results 301 to 310 of about 3,971,753 (362)
Some of the next articles are maybe not open access.
Scheduling parallelizable tasks
ACM SIGMETRICS Performance Evaluation Review, 1992In this paper we formulate the following natural multiprocessor scheduling problem: Consider a parallel system with P processors. Suppose that there are N tasks to be scheduled on this system, and that the execution time of each task j ε {1,…, N
John Turek +3 more
openaire +1 more source
Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470), 2003
Proposes an architecture for manufacturing enterprises based on the holonic concept. The main advantage of this approach is the decentralised, distributed nature of the system as well as its heterarchic organisation as opposed to the rigid hierarchic and centralised nature of computer integrated manufacturing (CIM).
P. Sousa, C. Ramos
openaire +1 more source
Proposes an architecture for manufacturing enterprises based on the holonic concept. The main advantage of this approach is the decentralised, distributed nature of the system as well as its heterarchic organisation as opposed to the rigid hierarchic and centralised nature of computer integrated manufacturing (CIM).
P. Sousa, C. Ramos
openaire +1 more source
Task scheduling algorithms for energy optimization in cloud environment: a comprehensive review
Cluster Computing, 2022Reyhane Ghafari +2 more
semanticscholar +1 more source
2001
This chapter presents a task-scheduling algorithm for a heterogeneous computing environment with a bounded number of processors. We first present the Heterogeneous Earliest Finish Time (HEFT) Algorithm [53] proposed by Haluk Rahmi Topcuoglu, and we then present the Dynamic Heterogeneous Prediction-Based (DHPB) Schedeuling Algorithm, and analyze its ...
Dongmin Kim, Salim Hariri
openaire +1 more source
This chapter presents a task-scheduling algorithm for a heterogeneous computing environment with a bounded number of processors. We first present the Heterogeneous Earliest Finish Time (HEFT) Algorithm [53] proposed by Haluk Rahmi Topcuoglu, and we then present the Dynamic Heterogeneous Prediction-Based (DHPB) Schedeuling Algorithm, and analyze its ...
Dongmin Kim, Salim Hariri
openaire +1 more source
Task scheduling of cloud computing based on hybrid particle swarm algorithm and genetic algorithm
Cluster Computing, 2021Xueliang Fu +3 more
semanticscholar +1 more source
Scheduling UET multiprocessor tasks
1994Summary: Classical scheduling theory assumed that a task for its processing may require only one processor at a time. This assumption is not so obvious in the context of new parallel computer systems and parallel algorithms. In this work we consider deterministic scheduling of unit execution time (UET) tasks, each of which requires more than one ...
BIANCO L. +3 more
openaire +2 more sources