Manufacturing scheduling is a complex combinatorial problem, particularly in distributed and dynamic environments. This paper presents a holonic approach to manufacturing scheduling, which in opposite to traditional approaches, distributes the scheduling functions over several entities, combining their calculation power and local optimization. In this scheduling and control approach, the schedu...

Wireless link scheduling is one of the major challenging issues in multi hop wireless networks when they need to be designed in distributed fashion. In this work we improve the general randomized scheduling method by using learning automata based framework that allows throughput optimal scheduling algorithms could be developed in distributed fashion. We propose a distributed scheduling algorith...

This research is motivated by an application of solving a distributed scan scheduling problem in distributed sensor networks. In this paper, we study distributed stochastic algorithm (DSA) and distributed breakout algorithm (DBA), two distributed algorithms developed earlier for distributed constraint satisfaction problems. We experimentally study their properties and compare their performance ...

For a large multi-hop wireless network, nodes are preferable to make distributed and localized link-scheduling decisions with only interactions among a small number of neighbors. However, for a slowly decaying channel and densely populated interferers, a small size neighborhood often results in nontrivial link outages and is thus insufficient for making optimal scheduling decisions. A question ...

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. this rese...

Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...

Contrary to traditional belief, we show in this paper, that for distributed systems non-preemptive scheduling can perform better than preemptive scheduling in the worst case in terms of task schedulability, under certain circumstances. We derive a worst-case delay bound for tasks scheduled using non-preemptive scheduling in a distributed system, where the task flow paths form a directed acyclic...

Abstract— High-performance computing and vast storage are two key factors required for executing data-intensive applications. In comparison with traditional distributed systems like data grid, cloud computing provides these factors in a more affordable, scalable and elastic platform. Furthermore, accessing data files is critical for performing such applications. Sometimes accessing data becomes...