Grid computing, emerging as a new paradigm for next-generation computing, enables the sharing, selection, and aggregation of geographically distributed heterogeneous resources for solving large-scale problems in science, engineering, and commerce. The resources in the Grid are heterogeneous and geographically distributed. Availability, usage and cost policies vary depending on the particular us...

Multisite task scheduling plays more and more important role in the grid computing as the WAN becomes faster and faster. Through the development of a three-level architecture of the distributed computing grid model and a grid schedule model, a scalable environment for multisite task scheduling is put forward. Then, a multisite Distributed Scheduling Server is designed and its prototype is imple...

Wireless sensor network (WSN) of active sensors suffers from serious inter-sensor interference (ISI) and imposes new design and implementation challenges. In this paper, based on the ultrasonic sensor network, two time-division based distributed sensor scheduling schemes are proposed to deal with ISI by scheduling sensors periodically and adaptively respectively. Extended Kalman filter (EKF) is...

We consider scheduling distributable real-time threads with dependencies (e.g, due to synchronization) in partially synchronous systems in the presence of node failure. We present a distributed real-time scheduling algorithm called DQBUA. The algorithm uses quorum systems to coordinate nodes’ activities when constructing a global schedule. DBQUA detects and resolves distributed deadlock in a ti...

Market mechanisms solve distributed scheduling problems by allocating the scheduled resources according to market prices. We model distributed scheduling as a discrete resource allocation problem, and demonstrate the applicability of economic analysis to this framework. Drawing on results from the literature, we discuss the existence of equilibrium prices for some general classes of scheduling ...

Scheduling is a fundamental issue in achieving high performance in multiclusters and computational grids. In this paper, we investigate the scheduling problem using the proposed scheduler uses a distributed approach with the capability of considering the local clusters advantages for executing the jobs. On the other hand, the distributed scheduler exploits the capabilities of fuzzy logic to qua...

Scheduling plays a pivotal role in the competitiveness of job shop facility. The traditional scheduling problem (JSSP) is centralized or semi-distributed. With advent Industry 4.0, there has been paradigm shift manufacturing industry from to smart distributed (SDS). implementation 4.0 results increased flexibility, high product quality, short lead times, and customized production. Smart/intelli...

The Imprecise Computation technique has been proposed as an approach to the construction of real-time systems that are able to provide both guarantee and flexibility. This paper analyzes the utilization of Imprecise Computation in the scheduling of distributed real-time applications. First we discuss the main problems associated with that goal, and we define a task model suitable to distributed...

This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to be included, together with a set of aperiodic servers to deal with the processor utilisation and the network bandwidth local to the system nodes, in a distributed aperiodic server, and ii) an extensive analysis of the b...

This paper presents a complete system model for scheduling and dispatching CORBA service requests that have hard as well as soft real-time timing requirements in a distributed environment. The model provides the methodology for expressing and enforcing time-based QoS constraints for real-time CORBA service requests. Therefore, the presented model complements the state of the art in real-time sc...