1 Background and Introduction Fine-grain scheduling based on software feedback 3] was introduced in the Synthesis operating system 4, 2] to solve two problems: the dependency between jobs in a pipeline and the low-latency requirements of multimedia type applications. The performance level achieved and the adaptive-ness of applications running on Synthesis demonstrated the success of ne-grain sc...

Grid scheduling is the process of mapping each and every task for the job completion with respect to the service level agreements. Grid scheduling produces effective decisions, and involves the resources from various administrative domains. The complexity of generic scheduling issue is NP-Complete. The scheduling issue is more problematic due to certain unique features of grid computations. In ...

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 ...

The increasing acceptance of the Earliest Deadline First (EDF) scheduling algorithm in industrial environments, together with the continued usage of Fixed Priority (FP) scheduling is leading to heterogeneous systems with different scheduling policies in the same distributed system. Schedulability analysis techniques usually consider the entire system as a whole (holistic approach), with only on...

We propose an asynchronous iterative scheme that allows a set of interconnected nodes to distributively reach agreement within pre-specified bound in finite number steps. While this could be adopted wide variety applications, we discuss it the context task scheduling for data centers. In context, algorithm is guaranteed approximately converge optimal plan, given available resources, Furthermore...

Scheduling algorithms are fundamental components in the process of resource management in mobile communication networks with heterogeneous QoS requirements such as delay, delay jitter, packet loss rate or throughput. The random characteristics of the propagation environment and the use of complex physical layers in order to combat this random behavior does not ease in the design of simple, effi...

Grid computing refers to the harnessing of computer systems to collaboratively solve a problem requiring a lot of Central Processing Unit (CPU) or data storage and processing far more than one system to handle. Grids are formed with resources owned by many organizations across borders and thus are not dedicated to single user or organization leading to security and trust issues. Various schedul...

Distributed real-time applications require flexible and dynamic scheduling mechanisms to provide timeliness guarantees to application objects. In this paper we present a new scheduling algorithm that exploits the task laxities and the object importances to make effective scheduling decisions. The algorithm uses current timing and resource measurements to determine the feasibility of the tasks a...