Resource reclaiming in multiprocessor real time systems

Assignment Help Computer Engineering
Reference no: EM132494076 , Length: 4 pages

Question 1:

Table 1 provides the attributes of a set of 8 tasks. Each task requires a processor and some need an additional resource r. The scheduled start times sti and scheduled finish times fti are also given in Table 1.

Task τi

pid

C,

C;

d,

I)

Sti

ft;

Task τ1

1

50

25

100

-

0

50

Task T2

1

175

75

250

-

50

225

Task T3

1

75

50

350

-

225

300

Task T4

1

100

100

500

shared

300

400

Task T5

1

150

100

600

-

400

550

Task T6

2

150

125

150

-

0

150

Task T7

2

50

50

200

exclusive

150

200

Task T8

2

75

75

300

-

200

275

Task T9

2

100

100

600

exclusive

450

550

Task T10

3

50

50

50

-

0

50

Task T11

3

100

50

300

-

150

250

Task T12

3

150

100

450

shared

300

450

Task T13

3

100

100

475

-

450

550

Table 1. Task Parameters

Assume the number of processors as 3,
1. Draw the post mu schedule without resource reclaiming
2. With reference to the Basic Reclaiming Algorithm steps, Fill the following table:
Time
reclaim 8
3. Draw post run schedule with resource reclaiming .

Question 2:
a) Define Resource Reclaiming in Multiprocessor Real Time Systems.
b) Table 1 provides the attributes of a set of 8 tasks. Each task requires a processor and some need an additional resource r. The scheduled start times st and scheduled finish times ft are also given in Table 1.

Task τi

pid

Ci

Ci

di

ri

sti

fti

Task τ1

1

150

125

150

-

0

150

Task T2

1

50

50

200

exclusive

150

200

Task T3

1

75

75

300

-

200

275

Task T4

1

100

100

600

exclusive

450

550

Task T5

2

50

50

50

-

0

50

Task T6

2

100

50

300

-

150

250

Task T7

2

150

100

450

shared

300

450

Task T8

2

100

100

575

-

450

550

Table 1. Task Parameters

Feasible schedule S according to tasks' worst case computation tunes is given in Figure 2, Draw the post run schedule without resource reclaiming (Figure 3) and post run schedule with resource reclaiming (Figure 4) in the given separate sheet. Assume the number of processors as 2. Write your answers on the separate answer sheet (page 3).

Reference no: EM132494076

Questions Cloud

Minimum spanning tree of graph g : Show that even when the minimum spanning tree of graph G is unique, more than one spanning tree of G may have the second lowest weight.
What should be the annual growth rate for kam chan limited : What should be the annual growth rate for Kam Chan Limited. The sales revenue of Kam Chan Limited for 2014 is $100 million.
Construct a context diagram : Erickson, Inc. sells plumbing supplies to contractors in the northeast region of the United States. Construct a context diagram
Value of the holding register to achieve a clock : If a 1 GHz crystal is used in a programmable clock (in square-wave mode), what should be the value of the holding register to achieve a clock resolution
Resource reclaiming in multiprocessor real time systems : Draw the post mu schedule without resource reclaiming and With reference to the Basic Reclaiming Algorithm steps, Fill the table - Draw post run schedule
Benefits and challenges of big data : List the benefits and challenges of big data in the 21st-century globalized economy.
Fundamentals differences between big data : There are fundamentals differences between Big Data, Data Mining and Data Analytics. Define each and outline the differences.
How much must donate today to fund the award : Your alma mater is able to invest the funds at a constant, annual, tax-free rate of 8%. How much must you donate today to fund this award?
Pros and cons of an agile methodology for is planning : What are the pros and cons of an agile methodology for IS planning?

Reviews

Write a Review

Computer Engineering Questions & Answers

  Mathematics in computing

Binary search tree, and postorder and preorder traversal Determine the shortest path in Graph

  Ict governance

ICT is defined as the term of Information and communication technologies, it is diverse set of technical tools and resources used by the government agencies to communicate and produce, circulate, store, and manage all information.

  Implementation of memory management

Assignment covers the following eight topics and explore the implementation of memory management, processes and threads.

  Realize business and organizational data storage

Realize business and organizational data storage and fast access times are much more important than they have ever been. Compare and contrast magnetic tapes, magnetic disks, optical discs

  What is the protocol overhead

What are the advantages of using a compiled language over an interpreted one? Under what circumstances would you select to use an interpreted language?

  Implementation of memory management

Paper describes about memory management. How memory is used in executing programs and its critical support for applications.

  Define open and closed loop control systems

Define open and closed loop cotrol systems.Explain difference between time varying and time invariant control system wth suitable example.

  Prepare a proposal to deploy windows server

Prepare a proposal to deploy Windows Server onto an existing network based on the provided scenario.

  Security policy document project

Analyze security requirements and develop a security policy

  Write a procedure that produces independent stack objects

Write a procedure (make-stack) that produces independent stack objects, using a message-passing style, e.g.

  Define a suitable functional unit

Define a suitable functional unit for a comparative study between two different types of paint.

  Calculate yield to maturity and bond prices

Calculate yield to maturity (YTM) and bond prices

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd