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.
We describe the methodology; the design and the implementation of scheduler block of interconnect. The scheduler block is implemented in Verilog using SYNOPSYS tool's DVE and Design_vision. The interconnect is capable of handling 72 bit packets and a total of 32 packets at a time. There are total 8 devices and we have to establish the communication between them. Each device consists of an input block...
Computational Grid is a distributed computing paradigm that provides huge computational power for the large scale distributed application. One of the challenging issues in Grid Scheduling is dynamically choosing the best resource, by exploiting the topology and load information present at the time of scheduling. Here topology represents the delay or elapse time to reach the resource. In the proposed...
Multiple instances of activity makes workflow management more flexible on handling process, but it causes some problems, such as synchronizing schedule and data sharing confliction. This paper proposes a scheme mode of object pool with lock. In the mode, object pool is constructed for each activity, all instances of the activity are deposited in respective pool, and the schedule scheme is implemented...
In a downlink orthogonal frequency division multiple access (OFDMA) system, allocating sub-channels and power across multi-user can require excessive feedback of channel state information. An efficient proportional fair scheduling algorithm based on cluster feedback scheme is proposed in the paper. Simulation results show that the scheme needs only little feedback information while maintaining guaranteed...
This paper discusses I/O architecture and key techniques of RAID controller. The main target is insert the request of the RAID module which have split user request into single disk R/D into corresponding I/O disk queue. According the priority and read/write characteristic, we adjust the requests order in response request queue or combination the fore-and-aft small requests into a big request, consequently...
This paper focuses on the performance evaluation of LTE uplink in presence of bursty data traffic. First, the performance of different power control (PC) strategies in different load conditions is evaluated. It is shown that the optimal PV policy depends on the load in the network and/or in the own cell. Simulation results demonstrate that in low load conditions applying no PC (or alternatively using...
We propose a cross-layer strategy that jointly optimizes user scheduling and resource allocation for adaptive modulation and coding (AMC) based orthogonal frequency multiple access (OFDMA). The objective of this paper is to maximize the system throughput as a function of the bit error rate (BER) and the spectral efficiency based on selected modulation and coding schemes (MCSs). The proposed optimal...
Real time traffic such as voice and video have strict requirements on the acceptable end-to-end packet delay. When there are different types of traffic with different requirements on tolerable latency, priority based packet scheduling schemes are normally used in order to reduce the queuing delay for real time services. However, in cognitive radio networks, the time that the system spends on spectrum...
We consider the problem of optimal real-time scheduling of periodic and sporadic tasks for identical multiprocessors. A number of recent papers have used the notions of fluid scheduling and deadline partitioning to guarantee optimality and improve performance. In this paper, we develop a unifying theory with the DP-FAIR scheduling policy and examine how it overcomes problems faced by greedy scheduling...
At present, power management in High-Performance Computing (HPC) environment is becoming a hot topic owning to its high operation cost, low reliability and environmental impact. In this paper, we investigate energy minimization scheduling algorithm of data dependent tasks in DVS-Enabled cluster system. Considering the data-intensive characteristics, the proposed EOTD (Energy Optimization scheduling...
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the maximum tardiness- the amount of time by which deadlines may be missed- of any feasible system of implicit-deadline sporadic tasks scheduled using global EDF. However, it is known that these bounds are not tight. In this paper,...
In modern safety-critical real-time embedded systems, performance and reliability are two most important parameters. The joint consideration of these two parameters is called performability. This paper evaluates and compares different schedulability conditions, which are used for scheduling tasks with fault-tolerant Rate-Monotonic (RM) algorithm, with respect to their performability. The task re-execution...
Reducing the power consumption while maintaining the response time constraint has been an important goal in server system design. One of the techniques widely explored in the literature to achieve this goal is Dynamic Voltage Scaling (DVS). However, DVS is not efficient in modern systems where the overall power consumption includes a large portion of static power consumption. In this paper, we aim...
In this paper with studying of all parameters in grid environment a new scheduling algorithm for independent task is introduced according to Genetic Algorithm. This algorithm can be more efficient and more dependable than similar previous algorithms. The simulated results and reasons for reaching to better makespan and more efficiency in the grid environment. In the grids with high fault with high...
This paper describes a new scheduling algorithm to distribute jobs in server farm systems. The proposed algorithm overcomes the starvation caused by SRPT (Shortest Remaining Processing Time). This algorithm is used in process scheduling in operating system approach. The algorithm was developed to be used in dispatcher scheduling. This algorithm is non-preemptive discipline, similar to SRPT, in which...
Modern real-time systems increasingly operate with multiple interactive applications. While these systems often require reliable quality of service (QoS) for the applications, even under heavy workloads, many existing CPU schedulers are not very capable of satisfying such requirements. In this paper, we design and implement an Advanced Interactive and Real-time Scheduler, called AIRS. AIRS is aimed...
Data grid integrates geographically distributed resources for solving data-sensitive scientific applications. As tasks are sensitive to data, dealing with large amount of data makes the requirement for efficiency in data access more critical. The goal of replica placement is to shorten data access time for enhancing the task execution performance. Therefore, replica placement strategies are often...
With the growth of hardware and software resources, the management of virtual machine system is becoming more and more difficult. It has become a very difficult problem that how to schedule the system resource in real time and improve the service performance of resource in a multiple virtual machine system. In order to solve this problem, the authors propose a real-time scheduling mechanism of resource...
QoS provisioning is an important issue for deploying broadband wireless access networks with real-time and non-realtime traffic integration. Opportunistic MAC (OMAC) protocol combines cross-layer design and opportunistic scheduling scheme to achieve high utilization while providing QoS supports to various applications. In this paper, we propose a cross-layer MAC protocol and scheduling framework with...
Complicated method and technology have been introduced into business workflow to solve their cooperation and load balancing. However, as combination of data management and flow management, scientific workflow's load balancing is less researched. So the phenomena of conflicting scheduling and load unbalance often occur. In this paper, we analyze functional framework and load consumption of scientific...
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.