Preview

Task Scheduling Methods for Composable and Predictable MPSoCs

Powerful Essays
Open Document
Open Document
15068 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Task Scheduling Methods for Composable and Predictable MPSoCs
Computer Engineering

2010

Mekelweg 4,
2628 CD Delft
The Netherlands http://ce.et.tudelft.nl/ MSc THESIS
Task Scheduling Methods for Composable and
Predictable MPSoCs
Ba Thang Nguyen
Abstract
Multiprocessor Systems on a Chip (MPSoCs) are suitable platforms for executing complex embedded applications. To reduce the cost of the hardware platform, applications share resources, which may result in inter-application timing interference due to resource request conflicts. Bounding or prohibiting this interference is crucial, as the timing of real-time applications has to be predicted in each possible
CE-MS-2010-29
case. Resources that allow sharing without application interference are denoted as composable. Composability is a desired platform property, as it enables the design and analysis of applications in isolation, and their integration with linear effort. Previous work demonstrates composability for different resources, i.e., processor, interconnect, memory. Processor composability is achieved by utilizing an Operating System (OS) that schedules fixed duration task slots, using a two-level, hierarchical approach. First, the OS determines which application owns the next slot following a strict, preemptive Time Division Multiplexing (TDM) policy, and then it picks and schedules a task of that application. As scheduling decisions are taken exclusively at slots borders, when a task finishes before its slot depletes, the time left is wasted. This may result in low processor utilization for streaming applications for which the execution of a task may start after its predecessor tasks have finished. In this work we propose a new task scheduling strategy, namely application-space task scheduling that eliminates wasted slot time. We make use of the fixed duration slots and the application TDM, to preserve composability, but the application invokes the task scheduler immediately after each task finish, inside its slot. As the application-space task



Bibliography: [2] Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh, and Kai Li, The parsec benchmark suite: Characterization and architectural implications, Tech. report, Princeton University, 2008. [3] Z. Deng and J. W.-S. Liu, Scheduling real-time applications in an open environment, RTSS ’97: Proceedings of the 18th IEEE Real-Time Systems Symposium (Washington, DC, USA), IEEE Computer Society, 1997, p [4] R.P. Dick, The embedded system synthesis benchmarks suite (e3s), 2002. processing domain, Master’s thesis, Technical University of Lund, 2008. [7] G. Bilsen et al., Cyclo-static dataflow, IEEE Transactions on Signal Processing (1996), 44. chip: Concepts, architectures, and implementations, IEEE Design and Test of Computers (2005), no. 5, 414–421. Systems Design and Implementation(OSDI) (1996), 107–121. Characterization, Annual IEEE International Workshop (2001), 3–14. (2010), –. Trans. Des. Autom. Electron. Syst. (2009), no. 1, 1–24. of the IFIP Congress (1974), 74. [16] H. Kopetz, Real-time systems: Design principles for distibuted embedded applications, Kluwer Academic Publishers, 1997. [17] Tei-Wei Kuo and Ching-Hui Li, A fixed-priority-driven open environment for realtime applications, RTSS ’99: Proceedings of the 20th IEEE Real-Time Systems Symposium (Washington, DC, USA), IEEE Computer Society, 1999, p IEEE Int. Symp. on Workload Characterization, 2005, pp. 34–45. Time Technology and Applications Symposium (RTAS 2000) (Washington, DC, USA), IEEE Computer Society, 2000, p u Electronics architecture - time-triggered architecture: A consistent computing platform, IEEE Distributed Systems Online (2002), no [22] Anca Molnos and Kees Goossens, Conservative dynamic energy management for real-time dataflow applications mapped on multiple processors, DSD, 2009, pp A heterogeneous multi-processor architecture template and scalable and flexible protocol for the design of embedded signal processing systems, Design Automation for Embedded Systems (2002), no [25] Dongrui SHE, Fpga platform for emulation of composable and predictable mpsoc power management, Master’s thesis, Eindhoven University of Technology, 2009. Transactions on (2003), no. 7, 560 –576.

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Ms Project Lesson 3

    • 298 Words
    • 2 Pages

    Effort-driven scheduling extends or shortens the duration of a task to accommodate changes to resources but doesn't change the total work for the task.…

    • 298 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Capstone Project

    • 3045 Words
    • 13 Pages

    | Cloud computing is considered to be a new computing paradigm where applications, data and Information Technology services are provided over the internet. A very important factor is cloud computing research is task management which plays a key role in ensuring an efficient system. Task scheduling problems are premier considerations which relate to the efficiency of the whole cloud computing facility. Scheduling tasks in a cloud is an NP complete problem and plays a key role in cloud computing [1]. A robust ecosystem of solution providers is emerging around cloud computing.Task scheduling, one of the most famous combinatorial optimization problems, play a key role in ensuring flexible and reliable systems. The main purpose is to schedule tasks to the adaptable resources in accordance with adaptable time, which involves finding out a proper sequence in which tasks can be executed under transaction logic constraints [2].This proposal considers a task scheduling algorithm that will summarize communication overhead in a cloud environment, this is accomplished by grouping cost-based task before resource allocation according to resource capacity. Factors like type of tasks and task lengths will be taken into account for proper scheduling of tasks. The proposed model will be tested on a simulation toolkit. The simulated results will be evaluated to compare the proposed algorithm vis-à-vis the previous algorithm presented [3].…

    • 3045 Words
    • 13 Pages
    Satisfactory Essays
  • Powerful Essays

    Analyze the schedule that the authors used to test the applications using a distributed architecture.…

    • 1554 Words
    • 7 Pages
    Powerful Essays
  • Powerful Essays

    Osi vs Tcp Ip Model

    • 767 Words
    • 4 Pages

    The Open Systems Interconnection (OSI) reference model created in the late seventies and used today consists of seven layers that include Application, Presentation, Session, Transport, Network, Data Link and Physical. The Application layer often dubbed Layer 7 is the most common layer to end users and can consist of applications such as Microsoft's Internet Explorer or other browser software. The Presentation layer provides a translation of application data to network format in order to be processed and is considered bidirectional. The Session layer is responsible for controlling communication between applications by establishing, managing and ending dialogs. The Transport layer is responsible for end to end error recovery and the complete transparent transfer of data between systems. The Network layer is where all switching and routing of data takes place. This layer is responsible for congestion control as presented in this week's discussion question and also provide packet prioritization. Finally we have the Data Link and Physical layers. The Data Link is where data packets are encoded into bits and is divided into two sublayers: Media Access Control (MAC) and Logical Link Control (LLC). The Physical layer is where hardware such as Network Interface Cards (NIC) and other protocols reside. Prior to OSI becoming a standard there was a dual effort in modeling and Institute of Electrical and Electronic Engineers (IEEE) was in its infancy. IEEE 802 resides in what is known as the Data Link and Physical layer of the OSI model.…

    • 767 Words
    • 4 Pages
    Powerful Essays
  • Powerful Essays

    QNX is a microkernel real-time operating system, from now on referred to as an RTOS. A microkernel RTOS is special in the way that the OS is built up with a number of small services which each handle a specific task, this is basically a set of system calls which is available to the developer. These services only implement low-level communication over network and between processes, process scheduling and interrupt handling. Other OS functions as file-system and device drivers are deployed as user processes outside the kernel. In contrast most other OS use a monolithic kernel. In that case all kernel functions reside in…

    • 3500 Words
    • 14 Pages
    Powerful Essays
  • Powerful Essays

    Real Time Operarting System

    • 4561 Words
    • 19 Pages

    This paper presents the basic and advanced concepts of real time operating systems and a review on three term papers written by scholars of various universities. Real Time Operating Systems are increasingly becoming an indispensable part of modern day computing. The precision of RTOS is a major factor that determines its applications. So we attempt to have an insight into the world of real time operating systems. This review paper includes discussion on real time operating systems and its related terms, the problems with real time operating systems and solutions to them, real time scheduling and comparison between the various commercial RTOS. Some scheduling algorithms and analysis techniques for periodic and aperiodic tasks are also discussed. This paper also reviews prerequisites for an RTOS and also presents a comparison of the commercial RTOS.…

    • 4561 Words
    • 19 Pages
    Powerful Essays
  • Good Essays

    Embedded Systems

    • 3932 Words
    • 16 Pages

    The interfacing of an I/O device to an embedded system is always an important task. Generally interfacing means , both the physical connections of the hardware devices and the software routines that effect the data transfer .Due to incompatibility in speeds of the microcontroller and I/O devices ,there is always a problem in data transfer between two devices .This leads to a concept called ‘Latency’.…

    • 3932 Words
    • 16 Pages
    Good Essays
  • Powerful Essays

    Nano Rk Os

    • 2845 Words
    • 12 Pages

    Key words: This paper describes different features of Nano-RK, a Real Time Operating System, characterized with multi-hop networking support and fixed priority pre-emptive multitasking.…

    • 2845 Words
    • 12 Pages
    Powerful Essays
  • Powerful Essays

    Courseinfo

    • 136227 Words
    • 545 Pages

    [17] Pierre L’Ecuyer. Software for uniform random number generation: Distinguishing the good and the bad. In Proceedings of the 2001 Winter Simulation Conference, pages 95–105, December 2001. [18] Pierre L’Ecuyer, Richard Simard, E. Jack Chen, and W. David Kelton. An object-oriented random number package with many long streams and substreams. Operations Research, 2001. [19] A. Legout and E.W. Biersack. PLM: Fast convergence for cumulative layered multicast transmission schemes. In Proceedings of the ACM SIGMETRICS, Santa Clara, CA, U.S.A., June 2000. [20] J. Liebeherr and N. Christin. JoBS: Joint buffer management and scheduling for differentiated services. In Proceedings of IWQoS 2001, pages 404–418, Karlsruhe, Germany, June 2001. [21] J. Liebeherr and N. Christin. Rate allocation and buffer management for differentiated services. Computer Networks, 40(1):89–110, September 2002. [22] M. Mathis and J. Mahdavi. Forward acknowledgement: Refining TCP congestion control. In Proceedings of the ACM SIGCOMM, August 1996. [23] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanov. TCP Selective Acknowledgement Options, RFC 2018 edition, 1996. [24] S. McCanne and S. Floyd. ns—Network Simulator. http://www-mash.cs.berkeley.edu/ns/. [25] S. McCanne and V. Jacobson. The bsd packet filter: A new architecture for user-level packet capture. pages 259–269, January 1993. [26] John Ousterhout. Scripting: Higher-level programming for the 21st century. IEEE Computer, 31(3):23–30, March 1998. [27] S.K. Park and R.W. Miller. Random number generation: Good ones are hard to find. Communications of the ACM, 31(10):1192–1201, October 1988. [28] Peter Pieda, Jeremy Ethridge, Mandeep Baines, and Farhan Shallwani. A Network Simulator, Differentiated Services Implementation. Open IP, Nortel Networks, 2000. [29] T. S. Rappaport. Wireless communications, principles and practice. Prentice Hall, 1996. [30] Kah Leong Tan and Li-Jin Thng. Snoopy calendar queue. In Proceedings of the 32nd conference on Winter simulation Orlando, Florida, pages 487–495, 2000. [31] D. Waitzman, C. Partridge, and S.E. Deering. Distance Vector Multicast Routing Protocol, RFC 1075 edition, 1988. [32] Xiaoliang (David) Wei. A mini-tutorial for TCP-Linux in NS-2. http://netlab.caltech.edu/projects/ns2tcplinux/. [33] Xiaoliang (David) Wei and Pei Cao. NS-2 TCP-Linux: an NS-2 TCP implementation with congestion control algorithms from Linux. In WNS2 ’06: Proceeding from the 2006 workshop on ns-2: the IP network simulator, page 9, New York, NY, USA, 2006. ACM Press.…

    • 136227 Words
    • 545 Pages
    Powerful Essays
  • Powerful Essays

    Round Robin

    • 2242 Words
    • 9 Pages

    It is one of the oldest, simplest, fairest and most widely used scheduling algorithms, designed especially for time-sharing systems. A small unit of time, called time slice or quantum, is defined. All runnable processes are kept in a circular queue. The CPU scheduler goes around this queue, allocating the CPU to each process for a time interval of one quantum. New processes are added to the tail of the queue.…

    • 2242 Words
    • 9 Pages
    Powerful Essays
  • Good Essays

    Process Migration

    • 35735 Words
    • 143 Pages

    IEEE Technical Committee on Operating Systems Newsletter, 3(1)(1):5–7. Wang, Y.-T. and Morris, R. J. T. (March 1985). Load Sharing in Distributed Systems. IEEE Transactions on Computers, C-34(3):204–217. Wang, C.-J., Krueger, P., and Liu, M. T. (May 1993). Intelligent Job Selection for Distributed Scheduling. Proceedings of the 13th International Conference on Distributed Computing Systems, pages 288–295. Welch, B. B. and Ousterhout, J. K. (June 1988). Pseudo-Devices: User-Level Extensions to the Sprite File System. Proceedings of the USENIX Summer Conference, pages 7–49. Welch, B. (April 1990). Naming, State Management and UserLevel Extensions in the Sprite Distributed File System. Ph.D. Thesis, Technical Report UCB/CSD 90/567, CSD (EECS), University of California, Berkeley. White, J. (1997). Telescript Technology: An Introduction to the Language. White Paper, General Magic, Inc., Sunnyvale, CA. Appeared in Bradshaw, J., Software Agents, AAAI/ MIT Press. White, J.E., Helgeson, S., and Steedman, D.A. (February 1997). System and Method for Distributed Computation Based upon the Movement, Execution, and Interaction of Processes in a Network. United States Patent no. 5603031. Wiecek, C. A. (April 1992). A Model and Prototype of VMS Using the Mach 3.0 Kernel. Proceedings of the USENIX Workshop on Micro-Kernels and Other Kernel Architectures, pages 187–204. Wong, R., Walsh, T., and Paciorek, N. (April 1997). Concordia: An Infrastructure for Collaborating Mobile Agents. Proceedings of the First International Workshop on Mobile Agents, LNCS 1219, Springer Verlag, pages 86–97. Xu, J. and Hwang, K. (November 1990). Heuristic Methods for Dynamic Load Balancing in a Message-Passing Supercomputer. Proceedings of the Supercomputing’90, pages 888– 897. Zajcew, R., Roy, P., Black, D., Peak, C., Guedes, P., Kemp, B., LoVerso, J., Leibensperger, M., Barnett, M., Rabii, F., and Netterwala, D. (January 1993). An OSF/1 UNIX for Massively Parallel Multicomputers. Proceedings of the Winter USENIX Conference, pages 449–468. Zayas, E. (November 1987a). Attacking the Process Migration Bottleneck. Proceedings of the 11th Symposium on Operating Systems Principles, pages 13–24. Zayas, E. (April 1987b). The Use of Copy-on-Reference in a Process Migration System. Ph.D. Thesis, Technical Report CMU-CS-87-121, Carnegie Mellon University. Zhou, D. (1987) A Trace-Driven Simulation Study of Dynamic Load Balancing. Ph.D. Thesis, Technical Report UCB/ CSD 87/305, CSD (EECS), University of California, Berkeley. Zhou, S. and Ferrari, D. (September 1987). An Experimental Study of Load Balancing Performance. Proceedings of the 7th IEEE International Conference on Distributed Com-…

    • 35735 Words
    • 143 Pages
    Good Essays
  • Best Essays

    [11] T. Slegel et al, “IBM’s S/390 G5 microprocessor design,” in IEEE Micro, 19, pp. 12-23, 1999.…

    • 4208 Words
    • 17 Pages
    Best Essays
  • Powerful Essays

    Currently, in the mid 1990s, IC fabrication technology is advanced enough to allow unprecedented implementations of computer architectures on a single chip. Also, the current rate of process advancement allows implementations to be improved at a rate that is satisfying for most of the markets these implementations serve. In particular, the vendors of general-purpose microprocessors are competing for sockets in desktop personal computers (including workstations) by pushing the envelopes of clock rate (raw…

    • 3946 Words
    • 16 Pages
    Powerful Essays
  • Powerful Essays

    Database

    • 24717 Words
    • 99 Pages

    3. Performance: BADA80,GARC78,GARC79a, GARC79b, GELE78, REIS79a, RExs79b, ROTH77 4. Reliabihty General: ALSB76a,ALSB76b, BELF76, BERN79a, HAMMS0,LAMP76 Two-phase commzt: HAMM80,LAMP76 5. Timestamp-ordered scheduling (T/O) General: BADA78,BERN78a, BERN80a, BERN80b, BERN80d, LELA78, LIN79, RAMI79 Thomas ' Wrtte Rule: THOM79 Multivers~on t~mestamp ordering: MONT78, REED78 T~mestamp and clock management: LAMP78, THOM79 6. Two-phase locking (2PL) General. BERN79b, BREI79, ESWA76,GARD77, GRAY75, GRAY78,PAPA79, SCHL78, SILB80, STEA81 D~str~buted 2PL: MENA80, MINO79, ROSE78, STON79 Primary copy 2PL: STOle77, STON79 Centralized 2PL: ALSB76a,ALSB76b, GARc79b, GARC79C Voting 2PL: GIFF79, SEQU79, THOM79 Deadlock detection/prevention: GRAY78,KXNG74, KAWA79,ROSE78, STON79…

    • 24717 Words
    • 99 Pages
    Powerful Essays
  • Satisfactory Essays

    To introduce the notion of a thread — a fundamental unit of CPU utilization that forms the basis of…

    • 1334 Words
    • 6 Pages
    Satisfactory Essays