Composable Flexible Real-time Packet Scheduling for Networks on-Chip
نویسندگان
چکیده
Network on chip is an emerging interconnection paradigm to address the scalability of traditional bus architecture. Time-critical systems need the capability to control packet delays in a network on-chip. The inflexibility and/or non-composability reduce the scalability of several proposed real-time service approaches for hard real-time networks onchip. In the era of “dark silicon” when large portions of multicore chips are turned off to save energy and control temperature, the incremental deployment capability of applications is crucial. In incremental deployment, application components are turned on and off. For time-critical applications, these components need to be composable in the sense that new incoming applications should not affect the behaviors of existing applications. In this paper, we propose a composable and flexible work-conserving packet scheduling discipline for hard real-time networks on chip. Our scheduling discipline employs an earliest deadline first (EDF) scheduler, which reduces average packet delays by 80% in comparison with a previous non-work-conserving EDF scheduling discipline running on the same 8×8 network with various popular traffic patterns. Our proposed scheduling discipline provides guaranteed service without sacrificing high consistent average performance. We also derive sufficient buffer sizes for our scheduling discipline. However, our scheduling discipline incurs a reasonable communication overhead.
منابع مشابه
ارزیابی سیاستهای زمانبندی در نسل چهارم شبکههای سلولی (LTE)
New generation of wireless networks, LTE and WiMAX, supports many services which consume a lot of resources (such as VOIP, Video Conference, Digital Video, Multimedia streams and online Multi-player Games). Supporting multi-media services in wireless communication systems provide new resource allocation challenges. Because of high loads in downlink, efficient resource allocation is vital in dow...
متن کاملDynamic Secure-Aware Real Time Scheduling Algorithm for Packet Switched Network
Now a day wireless networks are mostly preferred over wired networks because wireless networks are flexible and required no wire. If we talk about successful communication then end to end delivery of message is very important. In a heavy loaded networks scheduling of packets are key, by the proper scheduling of packets we can improve the guarantee ratio hence overall performance of the network ...
متن کاملSchedulability Analysis for Fixed Priority Wormhole Switching in On-Chip Networks
In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach and its extension are presented. By evaluating diverse inter-relationships among the traffic-flows, this approach can predict the packet network latency for all practical situations. Due to the inevitable existence of parallel int...
متن کاملImprovement of Schedulability Analysis with a Priority Share Policy in On-Chip Networks
Priority-based wormhole switching with a priority share policy has been proposed as a possible solution for real-time on-chip communication. However, the blocking introduced by priority share complicates the analysis process. In this paper, we propose a new “per-priority” basis analysis scheme which computes the total time window at each priority level instead of each traffic-flow. By checking ...
متن کاملReal-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm
The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012