文件名称:Least-Slack-Time.tar
介绍说明--下载内容均来自于网络,请自行研究使用
It is written in C programming language. Problem: Building and simulating a Least-Slack-Time scheduler using linked
list and stack data structures
Descr iption: In time shared systems, tasks submitted to the system are
assigned to a limited number of processors for execution in a time shared
manner. Time allocation of processors to tasks is known as scheduling prob-
lem. One of the most prevalent scheduling policy employed in embedded
systems is Least-Slack-Time ¯ rst. The policy always executes the task hav-
ing the least runtime left. In this assignment, you are expected to write a
C console program simulating a Least-Slack-Time ¯ rst scheduler on a single
processor system. The functionalities and constraints are speci¯ ed below.
list and stack data structures
Descr iption: In time shared systems, tasks submitted to the system are
assigned to a limited number of processors for execution in a time shared
manner. Time allocation of processors to tasks is known as scheduling prob-
lem. One of the most prevalent scheduling policy employed in embedded
systems is Least-Slack-Time ¯ rst. The policy always executes the task hav-
ing the least runtime left. In this assignment, you are expected to write a
C console program simulating a Least-Slack-Time ¯ rst scheduler on a single
processor system. The functionalities and constraints are speci¯ ed below.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
11788079Least-Slack-Time.tar