This paper presents and evaluates a new method for process scheduling in distributed systems .Scheduling in distributed operating systems has a significant role in overall system performance and throughput. An efficient scheduling is vital for system performance .The scheduling in distributed systems is known as an NPcomplete problem, even in the best conditions, and methods based on heuristic ...

—This papers deals with a new task scheduling algorithm for distributed heterogeneous computing environments. In distributed and parallel computing system, efficient task scheduling of computationally intensive applications is one of the most essential and difficult issues. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneo...

In wireless communication networks, it is important to schedule transmissions according to the priority weights of different data packets. Quite often, the scheduling is carried out in a distributed way and information exchange via wireless channels is necessary. The communication overhead of the distributed scheduling is studied, in terms of the number of communication bits needed for accompli...

This paper presents and evaluates a new method for process scheduling in distributed systems. Scheduling in distributed operating systems has a significant role in overall system performance and throughput. An efficient scheduling is vital for system performance. The scheduling in distributed systems is known as an NPcomplete problem even in the best conditions, and methods based on heuristic s...

In this paper, we propose a new solution for dynamic task scheduling in distributed environment. We argue that a function is existed in the items: execution time, the size of data and the algorithm, therefore we can deduce the execution time of a data mining task from the corresponding the size of data and algorithm. We adopt the sampling method for process the tasks scheduling in distributed d...

Advances in technology giving increasing importance to information service networks and the increasing use of personal workstations are two factors which permit the construction of distributed applications running on a large set of interconnected systems Existing frame works for the development of distributed applications only provide for manual scheduling of application services in particular ...

Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...

This study is concerned with how the quality of perishable products can be improved by shortening the time interval between production and distribution. As special types of food such as dairy products decay fast, the integration of production and distribution scheduling (IPDS) is investigated. An integrated scheduling of both processes improves the performance and costs because the separated sc...

This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) paradigm. The architecture is composed of a set of autonomous software Scheduling Agents (SAs) that solve the Employee Timetabling Problems (ETP) for each department. Each agent has its own local ETP problem and its own...

The management of Grid resources requires scheduling of both computation and communication tasks at various levels. In this study, we consider the two constituent sub-problems of Grid scheduling, namely: (i) the scheduling of computation tasks to processing resources and (ii) the routing and scheduling of the data movement in a Grid network. Regarding computation tasks, we examine two typical o...