| 1. |
- Aldea, M., et al.
(författare)
-
FSF : A real-time scheduling architecture framework
- 2006
-
Ingår i: 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06). - : Institute of Electrical and Electronics Engineers (IEEE). - 9780769525167 - 0769525164 ; , s. 113-124
-
Konferensbidrag (refereegranskat)abstract
- Scheduling theory generally assumes that real-time systems are mostly composed of activities with hard real-time requirements. Many systems are built today by composing different applications or components in the same system, leading to a mixture of many different kinds of requirements with small parts of the system having hard real-time requirements and other larger parts with requirements for more flexible scheduling and for quality of service. Hard real-time scheduling techniques are extremely pessimistic for the latter part of the application, and consequently it is necessary to use techniques that let the system resources be fully utilized to achieve the highest possible quality. This paper presents a framework for a scheduling architecture that provides the ability to compose several applications or components into the system, and to flexibly schedule the available resources while guaranteeing hard real-time requirements. The framework (called FSF) is independent of the underlying implementation, and can run on different underlying scheduling strategies. It is based on establishing service contracts that represent the complex and flexible requirements of the applications, and which are managed by the underlying system to provide the required level of service.
|
|
| 2. |
- Tang, Xiao-Gai, et al.
(författare)
-
Integrating network structure and dynamic information for better routing strategy on scale-free networks
- 2009
-
Ingår i: Physica A. - Amsterdam : North-Holland. - 0378-4371 .- 1873-2119. ; 388:12, s. 2547-2554
-
Tidskriftsartikel (refereegranskat)abstract
- We study information packet routing processes on scale-free networks by mimicking the Internet traffic delivery strategies. We incorporate both the global network structure information and local queuing information in the dynamic processes. We propose several new routing strategies to guide the packet routing. The performance of the routing strategies is measured by the average transit time of the packets as well as their dependence on the traffic amount. We find that the routing strategies which integrate both global network structure information and local dynamic information perform much better than the traditional shortest-path routing protocol which takes into account only the global topological information. Moreover, from comparative studies of these routing strategies, we observe that some of our proposed methods can decrease the average transit time of packets but the performance is closely dependent on the total amount of traffic while some other proposed methods can have good performance independent of the total amount of traffic with hyper-excellent average transit time of packets. Also, numerical results show that our proposed methods integrating network structure information and local dynamic information can work much better than the methods recently proposed in [S. Sreenivasan, R. Cohen, E. López, Z. Toroczkai, H.E. Stanley, Phys. Rev. E 75 (2007) 036105, Zhi-Xi Wu, Gang Peng, Eric W.M. Wong, Kai-Hau Yeung, J. Stat. Mech. (2008) P11002.], which only considered network structure information.
|
|
