Results 231 to 240 of about 437,526 (285)
Some of the next articles are maybe not open access.
ACM SIGOPS Operating Systems Review, 1996
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplize programming.
Jiubin Ju, Yong Wang
openaire +1 more source
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplize programming.
Jiubin Ju, Yong Wang
openaire +1 more source
IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339), 2003
This paper presents a brief description of an intelligent system, used in the control of load exchange between two robotic manipulators. An intelligent tasks scheduler, that uses mainly fuzzy logic to define which task will be executed in a certain instant, controls the whole system. Tasks are used in actions and in system control. In a low level, each
J.R. da Silva Ferreira +2 more
openaire +1 more source
This paper presents a brief description of an intelligent system, used in the control of load exchange between two robotic manipulators. An intelligent tasks scheduler, that uses mainly fuzzy logic to define which task will be executed in a certain instant, controls the whole system. Tasks are used in actions and in system control. In a low level, each
J.R. da Silva Ferreira +2 more
openaire +1 more source
Scheduling Tasks from Selfish Multi-tasks Agents
2015We are interested in scheduling tasks from several selfish agents on a set of parallel identical machines. A coordination mechanism consists in giving a scheduling policy to each machine. Given these policies, each agent chooses the machines on which she assigns her tasks, and her aim is to minimize the average completion times of her tasks. The aim of
Cohen, Johanne, Pascual, Fanny
openaire +1 more source
Uniprocessor-Dependent Task Scheduling
2019Scheduling is the process of assigning tasks to a processor or a set of processors as in the case of a multiprocessor system or to a network of computing elements when a distributed real-time system is considered. A real-time task has a release time, execution time, a deadline, and resource requirements.
openaire +1 more source
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
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
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