The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Recent advances in parallel and distributed computing have made it very challenging for programmers to reach the performance potential of current systems. In addition, recent advances in numerical algorithms and software optimizations have tremendously increased the number of alternatives for solving a problem, which further complicates the software tuning process. Indeed, no single algorithm can...
The task scheduling model and algorithm is very important to achieve high performance for message passing programs. The SPG (subtask precedence graph) model abstracts a task as a set of communication and computation sections so it can explore the dependence among subtasks precisely. The TSSF (task section based scheduling framework ) is designed to show how to generate subtasks and how to schedule...
In the paper, an extended version of the computer experimentation system MESMS2 for testing task scheduling algorithms is presented. The system designed and implemented by authors may be used for making comparative analysis of the properties of scheduling algorithms to be applied in managing complex computer systems. Paper presents the properties of the investigated algorithms in created various simulation...
DEVS is a formalism intended to model both discrete and continuous systems. The use of discrete events, rather than time steps, as the basis for simulation has been shown to reduce the computation time in many applications. Parallel DEVS is an extension to standard DEVS, which provides means to handle simultaneous scheduling. In this paper, we present an implementation of the parallel DEVS simulation...
This paper introduces a model and a job scheduling algorithm in grid computing environments. In grid computing several applications require numerous resources for execution which are not often available for them, thus presence of a scheduling system to allocate resources to input jobs is vital. The resource selection criteria in the proposed algorithm are based on input jobs, communication links and...
We study two parallel scheduling problems and their use in designing parallel algorithms. First, we define a novel scheduling problem; it is solved by repeated, rapid, approximate reschedulings. This leads to a first optimal PRAM algorithm for list ranking, which runs in logarithmic time. Our second scheduling result is for computing prefix sums of logn bit numbers. We give an optimal parallel algorithm...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.