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.
New Grid and cloud solutions for distributed data mining and data processing are needed for execution of data intensive workflows. In contrast of the standard workflows, in which data between the jobs are exchanged in the form of files and the jobs are finished when they process the input data, data intensive workflows receive data organized in blocks which are streamed on inputs, analyze the data...
As processors on-chip gain in numbers and complexity, task scheduling has become an important concern in system design, and the related research has produced substantial and diversified knowledge. As a result, the efficient taping and management of this knowledge has become a concern in itself. In particular, it can bring new ways to improve scheduling algorithms. This paper describes a new algorithm...
With the advent of increasingly higher numbers of processors on-chip, task scheduling has become an important concern in system design, and research in this area has produced substantial and diversified knowledge. As a result, the efficient management and taping of this knowledge has become a concern in itself. This paper addresses the issue of how to effectively extract performance information about...
In this paper, we are interested in using large-deviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity. We consider ad-hoc wireless networks where each link interferes with a given set of other links, and we focus on a distributed scheduling algorithm called Q-SCHED,...
Data grids provide such data-intensive applications with a large virtual storage framework with unlimited power. However, conventional scheduling algorithms for data grids are unable to meet the reputation service requirements of data-intensive applications. In this paper we address the problem of scheduling data-intensive jobs on data grids subject to reputation service constraints. Using the reputation-aware...
A floating-point accumulator for FPGA-based high performance computing applications is proposed and evaluated. Compared to previous work, our accumulator uses a fixed size circuit, and can reduce an arbitrary number of input sets of varying sizes without requiring prior knowledge of the bounds of summands. In this paper, we describe how the adder accumulator operator can be heavily pipelined to achieve...
Rate Monotonic Scheduling is one of the well known fixed-priority driven scheduling algorithms for real time systems. However, not many well known real time operating systems directly provide this scheduler, although almost all of them provide some form of pre-emptive, priority driven scheme. The design of any real time system hinges on time being considered as one of the important design parameters...
Due to its ability to provide high-performance computing environment, the grid has become an important infrastructure to support eScience. To utilise the grid for parameter sweep experiments, workflow technology combined with tools such as Nimrod/K are used to orchestrate and automate scientific services provided on the grid. As parameter sweeping over a workflow needs to be executed numerous times,...
We study opportunistic scheduling algorithms in a wireless network with a central base station communicating with multiple users on a single shared channel using time division multiple access. We assume the coexistence of both rate guaranteed (RG) users and best effort (BE) users in the system. A RG user asks for a specific transmission rate and the system should provision the exact amount being asked...
This paper focuses on the resource scheduling of LTE-Advanced system with carrier aggregation. With different fading characters, the aggregated carriers have different coverage between each other. Consequently, the carrier aggregation causes that the number of carriers which users can be scheduled on is various. The allocation fairness can not be achieved with the original proportional fair (PF) scheduling...
Through describing the characteristic of current genetic scheduling algorithm, a modified genetic scheduling algorithm (MGA) is proposed according to multi-objective Flexible Job Shop Scheduling Problem. This algorithm introduces a specific representation to reduce the solving space. It obtains the reasonable individuals by the selected principle and weakest link effect. Based on analyzing the benchmark...
The functional consolidation induced by the cost reduction trends in embedded systems can force tasks of different criticality (e.g. ABS Brakes with DVD) to share a processor and interfere with each other. These systems are known as mixed criticality systems. While traditional temporal isolation techniques prevent all inter-task interference, they waste utilization because they need to reserve for...
Aiming at dynamic and autonomic characteristics of grid market, this paper proposes a new resources set availability evaluation approach. It utilizes statistics method to describe resource availability and improves the availability of resources set effectively. Then a resources composing based batch scheduling algorithm framework is proposed. This algorithm considers resources set availability and...
Input-queued scheduling algorithms are designed to improve the throughput which use the input and output terminal in the router to obtain the maximum packets. And the length of the input queue is an important target, that can decides the superiority-inferiority about the capability of the input algorithm. With the existing algorithms, the main content about the scheduling algorithm are ensuring the...
In this paper an adaptive order release strategy for job shop production with well-defined routes is presented. The release strategy is a combination of different known methods. It balances altering machine load of a plant due to different products produced in the job shop. Additionally the constraint of the due date of each individual order is kept. Balanced load on all machines is achieved by controlling...
Current proportional thread-fair scheduling algorithms allocate CPU resources based on the total weight of runnable threads in the system instead of the total weight within runnable processes. This results in starvation issue in multithreading environments as the scheduler prefers processes with larger number of threads. We illustrate this issue through experimental evaluations on the Linux completely...
With increasing popularity of inter-vehicular communication, the need to provide emergency and infotainment services to vehicles in a fair and efficient manner is top priority. These data items can be downloaded or uploaded from a Hotspot which is Roadside Unit. The only difference between a hotspot and a roadside unit is hotspots are kept far apart as compared to roadside units. When many vehicles...
Consider the lack of cache and serve time-delay in the media streaming system, a proxy-caching scheduler based on P2P cooperation (PCSPC) is raised. First according to the principle of more popularly data assigned more cache, we distribute corresponding cache to every media file's prefix by its popularity. Then we sort prefix sequence in ascending order and proxy sequence in descending order by transmission...
To achieve the best quality of overall optimal performance on grid environment and user services, job loads need to be balanced in grids due to the non-uniformly distributed nature of jobs submitted to grids. Jobs are transferred from a heavy loaded grid to other grids in order to achieve performance optimization. The running cost of a job is calculated at the time it is completed. In this paper,...
Scheduling algorithms are very important in WiMAX for the efficient use of radio resources. However, the standard does not specify which scheduling algorithm(s) should be used. A scheduling algorithm should take into account the WiMAX QoS classes and service requirements. The scheduling algorithm also has to taken into account other models of the WiMAX system such as power saving and pricing models...
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.