Preview

Algorithm Scheduling

Good Essays
Open Document
Open Document
2087 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Algorithm Scheduling
REAL TIME AND EMBEDDED SYSTEMS [ECWM611]
Coursework 1: Report
Submitted by: Louis Thompson

TASK 1
(A)
An embedded system contains the following independent software tasks:

Control: The system performs closed-loop control of a robot. Loop processing takes 10 milliseconds. Alarm monitoring: A set of 5 alarm sensors are connected to the processor via a slow speed serial link. Each individual monitoring transaction (per alarm point) takes 10 milliseconds. It is assumed that all points are scanned in sequence.

Display driving: A standard monitor is used to display system status to an operator. The display subsystem has a dedicated graphics board. It takes a maximum of 20 milliseconds to update the display information.

System identification: A processing algorithm used to mathematically model the robot system. This takes 100 milliseconds to execute.

Organize the execution schedule of these tasks using simple scheduling (FIFO). Use timing diagram to show your solution.

(A) Solution Through the execution order used by the scheduling algorithm the TT (turnaround time; time taken for each process to complete) can be optimized, in that processing tasks with a smaller execution time first leads to better overall TT. In the case above we have display driving aided by the use of a dedicated Graphics card therefore the execution/ TT for this process should increase (n+1) fold where n represents the number of I/O devices being used in this case 1 therefore TT for this process is increased 2fold i.e. (display driving should take 10ms). Based on this info scheduling is done as follows: PROCESS | EXECUTION TIME | P1: CONTROL | 10ms | P2: DISPLAY | 10ms [as there is dedicated GPU] | P3: ALARM MONITORING CONTROL | 50ms | P4: SYSTEM

You May Also Find These Documents Helpful

  • Powerful Essays

    Manzana

    • 1120 Words
    • 5 Pages

    1) The TAT is based on calculating the time to complete the backlog and the new policies at the desk of…

    • 1120 Words
    • 5 Pages
    Powerful Essays
  • Satisfactory Essays

    M1 Week 3

    • 1315 Words
    • 6 Pages

    Step 4: If the smallest processing time is on the second machine, assign that job at the end of the sequence and eliminate the job.…

    • 1315 Words
    • 6 Pages
    Satisfactory Essays
  • Satisfactory Essays

    precedence diagram

    • 448 Words
    • 3 Pages

    What is the workstation cycle time (takt time)? C = Production time per day/Output per day =450 mins. x 60 seconds / 360 units per day = 27000 seconds/ 360 units C = 75 N=275/75=3.66 (4)…

    • 448 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    Block Scheduling

    • 835 Words
    • 4 Pages

    A small debate has always been discussed when talking about block scheduling and traditional class periods. Some people like the longer classes while others prefer the traditional six shorter class periods. Everyone has their own opinions about block scheduling. Block scheduling can be really helpful to high school students in many ways. Although, block scheduling is a longer time spent in one class, it should be mandatory in all high schools rather than traditional class periods.…

    • 835 Words
    • 4 Pages
    Better Essays
  • Powerful Essays

    STWTSDS problem. Regarding the latter point, note that the approach in [4] seems to be the only previous DPSO application to the single machine total weighted tardiness (STWT) problem. The rest of the paper is organized as follows. Section 2 introduces a formal problem definition and provides a general review of the relevant literature for it. Section 3 illustrates the basic aspects of the PSO algorithm, analysing in particular the DPSO approaches previously proposed in the literature. Section 4 then describes the proposed DPSO approach, discussing how it can be applied to the STWTSDS problem and highlighting the new features introduced. Section 5 presents the experimental campaign performed, which is mainly based on the benchmark set generated by Cicirello in [5] and available on the web. Finally, Section 6 draws some conclusions. II. THE STWTSDS PROBLEM The STWTSDS problem corresponds to the scheduling of n independent jobs on a single machine. All the jobs are released simultaneously, i.e., they are ready at time zero, the machine is continuously available and it can process only one job at a time. For each job j=1,..., n, the following quantities are given: a processing time pj, a due date dj and a weight wj. A sequence-dependent setup time sij must be waited before starting the processing of job j if it is immediately sequenced after job i. The tardiness of a job j is defined as Tj=max(0, Cjdj), being Cj the job j completion time. The scheduling objective is the minimization of the total weighted tardiness expressed as…

    • 5478 Words
    • 22 Pages
    Powerful Essays
  • Satisfactory Essays

    6. The process of assigning tasks to workstations in such a way that the workstations have approximately equal time requirements is called:…

    • 420 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    After completing the course on project management, your class professor suggested one could offer electronic support for weddings. You form a small group, decide on a name for your start-up company, and give it a try. To your surprise, your online ad is answered by a busy working couple planning a wedding in 2014. However they want a proper proposal with times, costs and details before going further. Fortunately from your project management course you know the 10 steps to a project proposal:…

    • 582 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    providing logically correct results. This paper reviews pre-requisites for an RTOS to be POSIX 1003.1b…

    • 5651 Words
    • 23 Pages
    Powerful Essays
  • Satisfactory Essays

    Marketing Objectives

    • 333 Words
    • 2 Pages

    * Time specific - When are you hoping to achieve these objectives, you need to define a timing plan with target timing for each specific objective?…

    • 333 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    Study of the IS for a sharing material platform (website) Information Systems A.Y. 2013/2014 Team: Luigi Cagnetta Edoardo Bruno Romit Kris Sriram Danilo Maciel de Barros Luiz Piccini Pedro Vassimon Index CHAPTER 1 - FEASIBILITY ....................................................................................... 3 1.1 Stakeholder analysis ............................................................................................. 3 1.1.1 Description Matrix .........................................................................................…

    • 14091 Words
    • 57 Pages
    Powerful Essays
  • Powerful Essays

    Usability Testing

    • 2651 Words
    • 17 Pages

     Lack of visibility of links at the footer of the home page (“library room…

    • 2651 Words
    • 17 Pages
    Powerful Essays
  • Satisfactory Essays

    04 Utilization

    • 353 Words
    • 5 Pages

    Actual u cannot exceed 1. If a calculation yields u > 1, it is called ‘implied utilization’.…

    • 353 Words
    • 5 Pages
    Satisfactory Essays
  • Good Essays

    Intro to Marketing

    • 1962 Words
    • 8 Pages

    T-TIME RELATED the objective has to have a time limit otherwise the performance of the objective will be unreliable…

    • 1962 Words
    • 8 Pages
    Good Essays
  • Good Essays

    Manzana

    • 993 Words
    • 4 Pages

    TAT & SCT: The 95% SCT is used as a predicted completion time given with 95% confidence to the agent, thereby giving a realistic timeframe of turnaround for a single policy. While a useful measure for a single policy, the average processing time of all tasks is necessary to calculate the schedule for the week. By adding the throughput time per day of each step to calculate the TAT time, the manager is assuming a batching of policies which is incorrect. It is recommended to resolve (Recommendation ii) and then quote a lead time of 2 days based on Appendix 2 – Page 9 – Process analysis (Revised).…

    • 993 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    Embedded System

    • 1981 Words
    • 8 Pages

    This text provides a brief introduction to the wide field of embedded systems. It covers the history and the main aspects of hard- and software design for embedded systems. The basic concepts of synthesis and automated verification are introduced and a short overview of well-known metrics, which are used to describe the economical and technical attributes of a system, is provided. Additionally the differences between commonly used operating systems are discussed.…

    • 1981 Words
    • 8 Pages
    Powerful Essays