summaryrefslogtreecommitdiffstats
path: root/report/chapter1.tex
diff options
context:
space:
mode:
Diffstat (limited to 'report/chapter1.tex')
-rw-r--r--report/chapter1.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/report/chapter1.tex b/report/chapter1.tex
index ff1a41c..6fbb87d 100644
--- a/report/chapter1.tex
+++ b/report/chapter1.tex
@@ -10,6 +10,6 @@ Fixed priority scheduling with \emph{arbitrary} preemptions (FPPS) is extensivel
As a compromise between \emph{no} preemptions and \emph{arbitrary} preemptions, FPDS was introduced. A scheduler that employs deferred preemptive scheduling, preempts tasks only at certain points that are defined by the system designer. By controlling the points at which a task may be preempted, a system designer has some knowledge about the state of the system and computation at which the task is preempted and at the same time may limit the number of preemptions that occur. This allows for more educated guesses of the costs of context switches and hence more accurate analysis of the (real world) schedulability of task sets. \\
-An essential goal of OS resource managemnt for real-time and multimeda systems is to provide timely, guaranteed and protected access to system recources. Allthough extensive research has been commited on processor scheduling, or network scheduling alone, disk scheduling, co-processor scheduling et cetra have been studied to a smaller extend. Not to mention using those resources \emph{simultaneously} wihtin a single node. Video applications may access high volume data from a disk, processes the data and transmit it accross the network. All these stages must be completed by a deadline. Obtaining simultaneous and timely access to multiple resources is known to be an NP-complete problem, making it a very complex to handle properly. \\
+An essential goal of OS resource management for real-time and multimedia systems is to provide timely, guaranteed and protected access to system resources. Although extensive research has been commited on processor scheduling, or network scheduling alone, disk scheduling, co-processor scheduling et cetera have been studied to a smaller extend. Not to mention using those resources \emph{simultaneously} within a single node. Video applications may access high volume data from a disk, processes the data and transmit it across the network. All these stages must be completed by a deadline. Obtaining simultaneous and timely access to multiple resources is known to be an NP-complete problem, making it a very complex to handle properly.
-% One of the suggested solutions for this problem would be to decouple the resources where possible, if resources are independent of one a nother of course, and then have servers for each resources. This leads to more problems however, when for example the disk and processor pair. To access the disk one needs the CPU.
+% One of the suggested solutions for this problem would be to decouple the resources where possible, if resources are independent of one another of course, and then have servers for each resources. This leads to more problems however, when for example the disk and processor pair. To access the disk one needs the CPU.