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.
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 addresses joint power control and link scheduling problem in Spatial-reuse Time Division Multiple Access (STDMA) networks with consecutive transmission constraint, where multiple links should be scheduled in a number of consecutive time slots. By multi-link management with power control and scheduling, the network can provide lower transmission latency or support more users. In this paper,...
Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fully preemptive scheduling when reduced blocking times need to coexist with an acceptable context switch overhead. To achieve this goal, preemptions are allowed only at selected points of the code of each task, decreasing the preemption overhead and simplifying the estimation of worst-case execution parameters...
In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end-to-end deadline. Each task of the chain is bound to execute on a particular processing element. The complexity of designing and analyzing a DRE can be reduced by applying a component-based methodology: each pipeline can be...
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...
A solution is urgently expected to meet the higher-quality web service requirements of various applications on the limited bandwidth of internet. This paper presents a new scheme of load balance of web cluster servers, making possible the service of the two-class priority station polling system under the mixed policy of exhaustive and gated services, optimizing the services of the system in time of...
In the design of time-critical applications, schedulability analysis can be used to define the feasibility region of tasks so that optimization techniques can find the best design solution that satisfies the deadlines. This method has been applied to obtain the optimal task implementation, priority assignment or placement of tasks onto CPUs in previous work. The definition of the feasibility region...
Optimal assigning jobs to resources is an important problem in grid computing. Now grid scheduling policies are mostly traditional heuristic algorithms for scheduling n independent tasks on m processors in early finishing time. However grids have developed to wide area, heterogeneous and non autonomous environments, business objective also became crucial for the success of the scheduling. Therefore...
Providing guaranteed quality-of-service (QoS) for resource-hungry multimedia applications over wireless fading channels is challenging. Traditional layered architecture fails miserably in providing the QoS requirement of high throughput, low latency demand of these kinds of applications in wireless mobile networks. Cross-layer design approaches are critical for efficient utilization of the scarce...
Optical burst switching is a promising technology in optical network. Scheduling of data burst in data channels in an optimal way is one of a key problem in optical burst switched networks. The main concerns in this paper is to schedule the incoming bursts in proper data channel such that more burst can be scheduled so burst loss will be less. There are different algorithms exists to schedule data...
Management of resource and application scheduling in a highly distributed heterogeneous Grid environment is a complex and challenging task. Processing jobs at the grid resources in a fine grained form results in a low computation - communication ratio. This necessitates the dynamic assembly of fine grained jobs into groups of jobs before dispatching them to the resources. Recent advances in computer...
We show that for a large class of scheduling algorithms, when the algorithm minimizes the drift of a Lyapunov function, the algorithm is optimal in maximizing the asymptotic decay-rate of the probability that the Lyapunov function value exceeds a large threshold. The result in this paper extends our prior results to the important and practically-useful case when the Lyapunov function is not linear...
Jobshop scheduling is a typical NP hard problem. In the distributed manufacturing environment, it becomes a more intractable one with the characters of distributed object, multiple target and strong dynamic. A novel distribution jobshop scheduling method based on multi-agent mechanism and genetic algorithm is presented. A distributed scheduling system framework, which composed of several jobshop agents,...
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.