3.5: Multimedia Operating Systems Resource Management. Resource Management Synchronization. Process Management Multimedia
|
|
- MargaretMargaret Owen
- 6 years ago
- Views:
Transcription
1 Chapter 2: Basics Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Communication Multimedia Transfer and Control Protocols Quality of Service and 3.5: Multimedia Operating Systems Resource Management Resource Management Synchronization Process Management Multimedia Scheduling Strategies Operating Systems Prototype System Chapter 4: Multimedia Systems Storage Aspects Chapter 5: Multimedia Usage Page 1
2 Operating System Aspects For multimedia applications not only transferring data has to be considered also, the processing of the data on sender and receiver host has to be fast. Operating System Aspects for Multimedia Processing Most conventional operating systems offer only little or no support for in-time processing of continuous media. This concerns all functions of an operating system like process, memory, file or device management 1. Resource Management How to achieve a coordinated processing of all operating system functions in order to achieve an end-to-end Quality of Service (delay, capacity, loss rate, jitter,...)? An abstract continuous resource model A common resource management procedure 2. Process Management How to schedule processes permitting each to terminate according to its deadline? Rate Monotonic Scheduling Earliest Deadline First Page 2
3 Resource Management Tasks 1. Admission control If a new data stream wants to start: is there enough remaining capacity to handle the additional stream? 2. QoS calculation Which characteristics (e.g. in terms of throughput and delay) are available for the new stream? 3. Resource reservation Reserves the resources which are required to meet the deadlines 4. QoS enforcement Quality of service can be (possibly) obtained by appropriate scheduling, e.g. by reordering tasks (serving a tasks with urgent deadlines earlier than a task with less strict bounds) Page 3
4 Real-Time Systems What means real-time? A real-time task is a process which delivers its result in a given time or according to a given deadline. A deadline is given e.g. in the order of msec for interactive voice and video data or in the order of days for text documents. What means the term deadline? A deadline represents the latest acceptable time for finishing the processing of a task. Deadlines are called hard if failures are mission-critical or threatening human beings. Deadlines are called soft if they cannot exactly be determined or a violation is less critical. Fields of application Control systems for manufacturing processes, military systems, telecommunication systems, aircrafts, automobiles, nuclear power plants or interactive multimedia systems. Page 4
5 Classification of Real-Time Systems real-time systems soft real-time systems hard real-time systems high availability high integrity fail safe fail operational telephone switching on-line banking railway signaling flight control High availability Down-time is minimal High integrity Consistency of data must survive any system failure and malicious attempt to alter the data Fail safe Probability to detect any failure is close to 1 System can be stopped in case of violation Fail operational Minimal service even in case of failure System cannot be stopped Page 5
6 Real-Time Systems Processing Requirements Predictable fast response to time-critical events Accurate timing information High degree of schedulability, i.e. resource capacity is not wasted (nearly optimal scheduling; finding optimal schedules is often a NP-complete task) Stability under transient overload, i.e. use of buffering to cope with bursty systems Aspects specific to Multimedia Systems In-time processing, transmission and presentation of audio and video data Requirements are described as QoS parameters Throughput, local delay, global (i.e. end-to-end) delay, jitter, and reliability Specified by average values, worst case values, peak rates, distribution functions, and/or moments of the distribution functions Resource Management and Process Management for dealing with deadlines Page 6
7 Resource Management Killer Application Resource Requirements Interactive Video insufficient scarce High-Quality Audio Network File Access abundant Hardware resources in Year x Even sophisticated compression techniques cannot compensate resource bottlenecks In current (interactive) multimedia systems, capacity is necessary for audio and video transmission as well as processing power Page 7
8 Classification of Resources Active vs. passive resources (depending on their autonomous processing capabilities) Active resources: CPU, network interface card, etc Passive resources: file system, main memory, etc Shared vs. exclusive resource usage Active resource are usually allocated exclusively whereas passive ones can be shared by multiple tasks Single vs. multiple resource occurrences A normal wortkstation for a human user usually contains only a single CPU, whereas many servers contain two or more CPUs Page 8
9 Resource Management Procedure Resources CPU 4. Reservation Resource Manager 2. Schedulability 3. QoS Calculation 1. Request by a new task Add Task I/O Queue 8. Assign Resources 5. Calculate Schedule 7. Schedule Task Dispatcher Steps 1 to 5: preparation of task processing Steps 6 to 8: task processing Page 9
10 Reservation Strategies Principle Base for schedulability test Resource utilization Timelines of processing Optimistic detect and resolve conflicts average test potentially high overbooking possible no guarantee Pessimistic avoid conflicts maximum for peak rate load no overbooking guarantee Airline example: Northwest Airlines Risky, lots of overbooking, solve conflicts by finding customers who leave the aircraft (by paying something in cash or better - in terms of a voucher) Lufthansa very cautious airline (no overbooking, no-shows), low actual load, high prices Page 10
11 Abstract Continuous Media Modeling: Workload Resource Messages Interfaces Messages Data streams consist of periodically arriving Logical Data Units (called Messages) and are described by the Linear Bounded Arrival Process (LBAP) Model A data stream is a triple (M, R, B), where M is the maximal message size R is the maximal message rate (i.e. the number of message per time unit) B is the maximal burstiness or allowed workahead The model is named linear bound arrival process because it assumes that the number of message arrivals N in a given time interval is bound by N ( ) = R + B (R message arrivals in time units) Page 11
12 Abstract Continuous Media Modeling: Workahead w(t) t a 1 l(m 1 ) a 2 l(m 2 ) a 3 a 4 l(m 3 ) l(m 4 ) The workahead w(t) of a LBAP at time t describes how many messages have arrived that are not yet processed. It is defined by w(t) = max {0, N( [t 0, t] ) - R t - t 0 }. The logical arrive time l(m i ) of message m i is the time at which a message is effectively being scheduled. The scheduling is done by FIFO (First In, First Out). The logical arrival time then is defined by l(m i ) = a i + w(a i ) / R (= actual arrival time + delay due to workahead) l(m i+1 ) = max {a i+1, l(m i ) + 1 / R} where a i is the actual arrival time of message m i Page 12
13 Abstract Continuous Media Modeling: Resources Resource Queue Messages Server Interfaces Messages The logical delay d(m) of messages m between two interfaces I 1 and I 2 is defined by d(m) = l 2 (m) - l 1 (m) The buffer requirements of resource for a given data stream are defined by buf = B + R (D - U) with B = number of messages which arrive unexpectedly due to burstiness D = maximum logical delay between input and output interfaces U = minimum (unbuffered) actual delay between the same interfaces R (D - U) = number of messages which may be build up due to the variation of processing times Page 13
14 Process Management Process Management deals with the assignment of the CPU to processes/tasks. A process may be in one of five basic states: initial, i.e. it is created, but not in schedule; process is idle ready, i.e. it is waiting for CPU assignment running, i.e. it is running on the CPU waiting, i.e. it is waiting for an external event finished A scheduler chooses the next process to become running according to a given schedule. The schedule determines the order of CPU assignment to processes. Goals of traditional scheduling Optimal throughput, optimal resource utilization, fair queuing in re ru fi Goals of real-time scheduling Execute maximum number of processes in time, i.e. according to their deadlines Minimize deadline violations wa Page 14
15 Classification of Real-Time Scheduling Strategies Scheduling strategies can be distinguished by... static vs. dynamic schedule calculation (static = calculation of schedule in advance dynamic = re-calculation whenever a new task arrives) central vs. distributed schedule calculation preemptive vs. non-preemptive task processing (preemptive = a task may be interrupted by any task with higher priority) They schedule... tasks with periodic or aperiodic processing requirements independent tasks or tasks with precedence constraints They are applied to... uniprocessor systems multiprocessor systems (neglecting communication delay) multicomputer systems (taking communication delay into account) Page 15
16 Schedulability Tests and Optimal Schedulers The test to determine whether a schedule exists for a given task set is called a schedulability test There are three kinds of test: sufficient, exact, and necessary ones: Sufficient test: if the test is positive, the set of tasks is schedulable. A negative result is possible even if the task set is schedulable ( cautious test). Necessary test: if the test is negative, the set of tasks is not schedulable. A positive result does not guarantee the schedulability of a task set ( optimistic test). Exact test: if the tasks set is schedulable, it returns a positive result. Most exact schedulability tests belong to the class of NP-complete problems A scheduler is called optimal if it always finds a schedule for task sets satisfying an exact schedulability test Page 16
17 Model for Real-Time Tasks A task is characterized by its timing constraints and its resource requirements Most tasks in multimedia systems are periodic and have no precedence constraints p i s i d i e i period 1 period 2 period 3 period 4 Model for a task timing constraint: (s i, e i, d i, p i ) with s i starting point, i.e. ready time for first period e i processing time for period p i d i deadline for period p i (relative to its period s ready time) If a task set consisting of periodic tasks (T 1,..., T n ) is schedulable [T i = (s i, e i, d i, p i )], then the processor utilization is given by n ei U = (where e i /p i = relative processor i= 1pi utilization by task T i ) Page 17
18 Preemptive vs. Non-Preemptive Scheduling There are tasks sets that have valid preemptive schedules but no non-preemptive ones. If the cost for preemption is neglected, preemptive scheduling is always better or equal than non-preemptive scheduling. Deadlines d a d b d c, d 1 d d d f, d 2 d e p 1 High-Rated Task T 1 a b c d e f p 2 Low-Rated Task T Non-Preemptive Schedule a 1 b c d 2 e f Preemptive Schedule a 1 b 1 c 1 d 2 e 2 f 2 Deadline violation Page 18
19 Rate Monotonic Algorithm The Rate Monotonic Algorithm (RM) is a static, preemptive algorithm for periodic tasks Assumptions All time-critical tasks have periodic computing requirements Tasks are mutually independent (i.e. no precedence constraints) A task s deadline equals its period (d i = p i ) A task s maximum computing time is constant and a-priori known Context switches are considered timeless, i.e. preemption is assumed to come without cost (at least without time cost) Principles Shortest period highest priority (i.e. tasks are ordered by decreasing period) Priorities are recalculated if a new task is added to the task set or a task is deleted from the task set (schedule calculation only once for a given task set) RM is optimal among static scheduling algorithms, i.e. if a task set is schedulable by any static algorithm then there exists a feasible RM schedule Page 19
20 Rate Monotonic Algorithm - Example Principle of operation: high rated tasks preempt lower rated tasks The performance of RM depends on the arrival pattern; in the worst case ( critical instant ), every task with higher priority arrives at the same time than a lower rated task (i.e. maximum disadvantage for lower rated tasks) Deadlines High-Rated Task T 1 period of T 1 d a d b, d 1 d c d d, d 2 a b c d period of T 2 Low-Rated Task T RM Schedule a 1 b 1 c 2 d 2 preemption of T 2 T 2 is resumed Page 20
21 Earliest Deadline First (EDF) Earliest Deadline First is a dynamic, preemptive algorithm for periodic tasks Principle of operation: Earliest deadline highest priority Priorities are re-calculated each time a task becomes ready (even for an unchanged task set) Calculation has worst case complexity of O(n 2 ) Deadlines d a d b, d 1 d c d d, d 2 High-Rated Task T 1 a b c d Low-Rated Task T EDF Schedule a 1 b c 2 d Page 21
22 Comparison of EDF and RM RM schedules require more context switches, i.e. more preemptions, than EDF: Deadlines d a d b, d 1 d c d d, d 2 High-Rated Task T 1 a b c d Low-Rated Task T EDF Schedule a 1 b c 2 d RM Schedule a 1 b 1 c 2 d 2 The higher number of preemptions for RM has to be compared with the additional cost for EDF due to recalculation of schedules Page 22
23 Comparison of EDF and RM Rate monotonic vs. EDF: Processor Utilization and Deadline Violations d 1 d 2 d A d 3 d 4 d 5, d B d 6 d 7 d C d 8 Deadlines period High-Rated period Low-Rated A B C EDF 1 A 2 A 3 B 4 B 5 6 C 7 C Rate Monotonic EDF is better than RM: If RM can schedule a task set then the same is valid for EDF but not vice versa 1 A 2 A 3 AB 4 B 5 B 6 C 7 C 8 C d A not met Deadline Violations d C not met Page 23
24 Achievable Processor Utilization with RM Minimum utilization for all sets of tasks (T 1,..., T n ) which are schedulable and which fully utilize the processor: A task set fully utilizes a processor if the task set can be scheduled If for a single task which is increased in processing time by ε > 0, the assignment becomes infeasible Example: Given a task set (T 1, T 2, T 3 ) with period p i and processing time e i for each task: p 1 = 3, e 1 = 1; p 2 = 4, e 2 = 1; p 3 = 5, e 3 = 1 It can be shown that in this case p p e = p e e = = ,max p2 p1 Page 24
25 Achievable Processor Utilization with RM: Theorem A set of n independent and periodic tasks (T 1,..., T n ) can be scheduled if 1 e1 e2 en n n (2 1) p p p 1 2 n For n ln 2 0,693 this expression converges to As a consequence: A lower bound for processor utilization is: ln 2 if RM is applied But: 1 (lower and upper bound) if EDF is applied (and deadline = end of period) Page 25
26 Achievable Processor Utilization with EDF For EDF a much better (i.e. perfect) utilization is possible: e1 e2 en p p p 1 2 n Mixed scheme: Suppose we have n periodic tasks Priorities given according to RM are T 1, T 2,..., T n (T 1 shortest period, T n = longest period), i.e. highest priority for task 1 Compromise: Schedule the highest priority tasks T 1, T 2,..., T k with RM (1 k n) Schedule T k+1, T k+2,..., T n with EDF when the processor is not occupied by T 1, T 2,..., T k Page 26
27 Achievable Processor Utilization with RM and EDF A 1 A 2 A 3 A 4 A 9 A 14 A 20 Task 1 (p 1 = 3, e 1 = 1) 0 60 B 1 B 2 B 3 B 4 B 5 Task 2 (p 2 = 4, e 2 = 1) C 1 C 2 C 3 Task 3 (p 3 = 5, e 3 = 1) occupation + + =, i.e. 13 out of 60 slots remain empty A 1 C 1 B 2 A 3 B 3 C 3 A 5 A 6 C 4 A 8 B 7 A 10 C 7 A 12 C 8 B 10 A 14 C 9 A 16 B 13 A 18 C 12 A 20 RM B 1 A 2 C 2 A 4 B 4 B 5 A 7 B 6 C 5 A 9 C 6 B 8 A 11 B 9 A 13 B 11 A 15 B 12 C 10 A 17 C 11 B 14 A 19 B 15 C 1 C 2 C 3 Task 3, new with e 3 = 2 A 1 C 1 C 1 A 3 A 4 C 3 C 3 A occupation + + = C 4 C 4 C 6 C 6 A 8 A 9 59, 60 A 11 i.e. only 1 out of 60 slots remains empty A 12 C 8 B 10 A 14 C 9 C 9 A 16 A 17 C 11 C 11 A 19 A 20 B 1 A 2 B 2 Mixed strategy C 2 (Task 1 with RM, 2 and 3 with EDF) B 3 A 5 B 4 B 5 A 7 B 6 C 5 B 7 A 10 B 8 C 7 B 9 A 13 C 8 B 11 A 15 B 12 C 10 B 13 A 18 B 14 C 12 B 15 Page 27
28 Deadline Monotonic Algorithm Shortest deadline first is a static algorithm which gives higher priority to a task with shorter deadline, i.e. T 1 > T 2 if d 1 < d 2 If deadline = period RM algorithm This algorithm is similar but not identical to EDF Page 28
29 Shortest (Remaining) Processing Time In this strategy, highest priority is given to the task with shortest process time (if non-preemptive) shortest remaining time (if preemptive) Properties: This strategy serves the maximum number of customers In an overload situation and if all tasks have the same deadline then this strategy minimizes the number of deadline violations Page 29
30 Preemptive vs. Non-Preemptive Preemptive is more complicated than non-preemptive but... increases the feasibility of scheduling (in some cases a preemptive schedule exists but no non-preemptive schedule) reduces the amount of priority inversion (i.e. situations where lower priority jobs are executed while higher priority jobs are waiting) A task set with processing times e i and with request periods p i is schedulable if: e i ln2 p i ei p i (if task priorities are fixed assigned) 1 (if priorities may be dynamically adjusted, e.g. by EDF strategy) In general, the resulting schedule is a preemptive one Page 30
31 Preemptive vs. Non-Preemptive Schedulability for non-preemptive strategies is more complicated: Task T k can be scheduled (worst case consideration) if its deadline d k satisfies the following: n j j dk ek + maxei + ej + 1 i k j= k+ 1 pj (***) (*) (**) d Here, T n is the highest priority task, T 1 is the lowest priority task (*) = own execution time (**) = waiting time due to job found in service at arrival time (worst case: maximum execution time of all jobs of other priority classes) (***) = execution time of all jobs of higher priority which are present at arrival time or which arrive during the waiting time (**) (***) e job of priority k arrives my service time higher priority jobs arrive and are served x Requirement : dk! x Page 31
32 Example for Achievable Processor Utilization Given a task set (T 1, T 2, T 3 ) with period p i and processing time e i for each task: p 1 = 3, e 1 = 1 ; p 2 = 4, e 2 = 1; p 3 = 5, e 3,max = 2 T 1 and T 2 scheduled with RM, T 3 scheduled with EDF Utilization (mixed scheme): + + = % Utilization (RM): + + = % * Utilization (EDF): + + = 1 = 100%, when increasing e3 to e3 = Conjecture: Mixed scheme is nearer to the better side (namely EDF) than to the poor side (namely RM) Page 32
33 Achievable Processor Utilization (here RM) Task T 1 T 1 T 1 T 1 T 1 Task T 2 T 2 T 2 T 2 Task T 3 RM schedule T 3 T 3 T 1 T 2 T 3 T 1 T 2 T 3 T 1 T 2 t Utilization: e e e Uactual = + + = + + = p1 p2 p The actual utilization is slightly better than the theoretical minimum: 1 3 Utheorem 3 = 2 1 = 0.78 Page 33
34 Least Laxity First (LLF) In this strategy, the task with shortest remaining laxity is scheduled first Definition: The laxity L k (t) of task T in period k at time t is the remaining time from t to the deadline d of task T in period k that is not necessary for processing task T: L k (t) = (s + (k-1) p + d) - (t + e rem (t)) = (Deadline in period k) - (actual time + remaining processing time) e e rem (t 1 ) L k (t 1 ) L k (t 2 ) Deadline in period k s + k p s s + (k-1)p t 1 t t 2 period k s + (k-1) p+d LLF has no advantage over the EDF for uniprocessor systems. If tasks have similar laxity values, context switches can occur frequently (calculation overhead compared to EDF). LLF might be suitable only in multiprocessor systems, i.e. when several resources are scheduled simultaneously. Page 34
35 Least Laxity First - Example for Two Tasks Example with a minimum CPU time granularity of 2 (if no granularity is assumed, then two tasks with equal laxity would preempt each other continuously, i.e. processor sharing would be the result) d 2 d 1 Task T Task T 2 LLF Schedule T 1 T 2 T 1 T 2 T 1 T 2 T 1 t L 2 (T 1 ) = 20 L 2 (T 2 ) = 14 T 2 interrupts T 1 L 8 (T 1 ) = 14 L 8 (T 2 ) = 14 T 1 interrupts T 2 L 10 (T 1 ) = T 2 finished L 10 (T 2 ) = 12 T 2 interrupts T 1 T 1 finished Laxities do not change during execution time of a task but become smaller when a task is not served. If the laxity of a waiting task becomes smaller than that of the running task, the running task is interrupted. Page 35
36 Scheduling Aperiodic (but Independent) Tasks Multimedia applications comprise both, periodic and aperiodic tasks Periodic tasks are used for transport and processing of continuous media data whereas control or management tasks are aperiodic Often it is reasonable to give to periodic tasks priority over aperiodic tasks Problem How to schedule a task set which is composed of periodic as well as aperiodic tasks? Idea One special periodic task (called server) is polling aperiodic tasks to be processed New problem Aperiodic tasks can only be processed when server task is scheduled, i.e. they miss their deadline if it is earlier than the next time the server is scheduled Solution: Bandwidth preserving algorithms like Priority Exchange Deferrable Server Sporadic Server Page 36
37 Bandwidth Preserving Algorithms Priority Exchange One periodic task T s serves all aperiodic tasks. The server exchanges priority with a lower priority periodic task T i if no aperiodic task is ready. The server receives its initial priority for the next period. Case 1: T s serves > 0 aperiodic tasks T 1 T s T 2... T i... T n T 1 T s T 2... T i... T n period k period k+1 Case 2: T s has no task to serve, changes priority with T i and is reactivated at the time T i was scheduled T 1 T i T 2... T s... T n T 1 T i T 2... T s... T n period k period k+1 Page 37
38 Bandwidth Preserving Algorithms Deferrable Server One periodic task (called deferrable server) serves all aperiodic tasks. It defers its processing time if no aperiodic task is ready but retains its priority. As soon as an aperiodic task request occurs, it either (immediately) preempts the running task (that has a lower priority), or resumes processing after the current task terminates aperiodic task arrival T 1 T s T 2 T 3 T 4... T n nothing to serve Interrupt T 4 or wait until T 4 is finished Page 38
39 Bandwidth Preserving Algorithms Sporadic server Tries to combine the advantages of the Priority Exchange and the Deferrable Server algorithm A sporadic server exchanges its priority when no aperiodic task is ready. Any spare CPU capacity, i.e. time not used by periodic tasks, is transformed into a ticket, that is given to a sporadic server, which then replenishes its initial priority. This way, the sporadic server is allowed to use any idle time of the CPU. Page 39
40 Scheduling Tasks with Blocking The blocking of a task is caused by mutual exclusion when trying to access a critical section currently occupied by another task Priority Inversion Effect: Assume a high-priority task T h wants to enter a critical section currently occupied by a low-priority task T l. T h is blocked until T l leaves the critical section. Until then, not only T l but all medium-priority tasks T m having higher priority than T l and lower priority than T h will be processed prior to T h. This phenomenon is called priority inversion. wait(s) processing signal(s) Task T l Task T m Task T h critical section proc. blocked until Page 40
41 Scheduling Tasks with Critical Sections Several algorithms have been developed in order to avoid priority inversion, e.g. Priority Inheritance, or the Ceiling Protocol Priority Inheritance: A low-priority task T l inherits the priority of a high-priority task T h if it causes the blocking of T h. T l retains its initial priority when leaving the critical section. Thus: Ready jobs between low and high are blocked Disadvantage: Lower utilization of server, possible deadline violations Advantage: Sequence of schedules is preserved Page 41
42 Scheduling Tasks with Critical Sections More Problems with standard priority inheritance: Tasks can be blocked in each critical section Deadlocks can occur Transitive blocking is possible, i.e. T 3 is blocked by T 2 that is blocked by T 1 Attempt for solution of the problem (Ceiling protocol): Each task has two priorities: A static one assigned by the scheduler, e.g. according to RM strategy A dynamic one, i.e. the maximum of the static priority and the highest priority inherited Each semaphore has a maximum ceiling priority value of all tasks that actually use it. A semaphore only can be locked by a task with a higher dynamic priority than any currently locked semaphore. (Comparable to hierarchy of resources approach to deadlock avoidance.) Benefit: a task is only blocked once, no deadlocks and transitive blocking Price: restrictive locking policy (brute force method) longer blocking delays for other tasks Page 42
43 Prototype Systems - Real-Time Mach Real-Time Mach (RT Mach) is an experimental distributed operating system for realtime applications based on ARTS (Advanced Real-Time System), both developed at Carnegie Mellon University at Pittsburgh, PA, USA. RT Mach supports multi-processor operation clusters n 1 processors into a processor set assigns a separate run queue and scheduling strategies to each processor set enables an application to select the current scheduling strategy (at run-time) processor processor set scheduler strategy RT Mach Kernel run queue Page 43
44 Task Scheduling in RT Mach RT Mach offers three classes of tasks (called RT Threads): Periodic tasks with hard deadlines Aperiodic (sporadic) tasks with hard deadlines Tasks with soft deadlines Tasks are scheduled by one of the following strategies (dynamically changeable): Rate monotonic with deferrable server (RM/DS) or sporadic server (RM/SS) Fixed priority (FP) Round robin (RR) Thread dispatching management controls idle threads and aperiodic server (DS or SS). Processor set management performs context switching, thread preemption, or processor assignment. RM Generic Scheduler RM/DS Thread Dispatching Mgmt. RM/DS Processor Set Mgmt. FP RR Page 44
45 The QoS Ticket Model The QoS Ticket Model combines resource reservation and adaptation Has been implemented on RT Mach 3.0 supporting so-called Q-Threads QoS Manager 2. Calculation of resource allocation 1. QoS Request 4. Issue Ticket Multimedia Session QoS Ticket 5. Consumption Information 3. Resource reservation RT Mach kernel QoS tickets allow users to specify tolerance ranges for period and computation time A ticket is issued for each session comprising several threads QoS parameters are adapted dynamically based on the current resource consumption Page 45
46 Comparison of RT-Threads and Q-Threads Periodic RT-Thread Q-Thread Invocation time user-defined entry point is called periodically Thread attributes Invocation period Guarantee of execution Purpose fixed invocation period fixed (can be re-specified) none (possible with CPU reservation) real-time processing ranges for period and computation time dynamic, within range, based on QoS control policy guaranteed, within the available computation time continuous-media processing Page 46
47 Conclusions Lehrstuhl für Informatik 4 Multimedia Applications need lots of protocols to work: Control protocols like H.323 or SIP for session management and coordination Transfer protocols like RTP/RTCP for data transfer Transferring multimedia data streams is not trivial: Quality of Service and resource management QoS Negotiation, Admission Control, Traffic Shaping, Scheduling, Error Control Synchronization aspects Operating system aspects for processing multimedia data Page 47
Event-Driven Scheduling. (closely following Jane Liu s Book)
Event-Driven Scheduling (closely following Jane Liu s Book) Real-Time Systems, 2009 Event-Driven Systems, 1 Principles Admission: Assign priorities to Jobs At events, jobs are scheduled according to their
More informationCIS 480/899 Embedded and Cyber Physical Systems Spring 2009 Introduction to Real-Time Scheduling. Examples of real-time applications
CIS 480/899 Embedded and Cyber Physical Systems Spring 2009 Introduction to Real-Time Scheduling Insup Lee Department of Computer and Information Science University of Pennsylvania lee@cis.upenn.edu www.cis.upenn.edu/~lee
More information5. Process and thread scheduling
5. Process and thread scheduling 5.1 Organization of Schedulers Embedded and Autonomous Schedulers Priority Scheduling 5.2 Scheduling Methods A Framework for Scheduling Common Scheduling Algorithms Comparison
More information10. BSY-1 Trainer Case Study
10. BSY-1 Trainer Case Study This case study is interesting for several reasons: RMS is not used, yet the system is analyzable using RMA obvious solutions would not have helped RMA correctly diagnosed
More informationContents. Basic Concepts. Histogram of CPU-burst Times. Diagram of Process State CHAPTER 5 CPU SCHEDULING. Alternating Sequence of CPU And I/O Bursts
Contents CHAPTER 5 CPU SCHEDULING Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Basic Concepts Maximum CPU utilization obtained with multiprogramming
More informationEnergy Efficient Scheduling Techniques For Real-Time Embedded Systems
Energy Efficient Scheduling Techniques For Real-Time Embedded Systems Rabi Mahapatra & Wei Zhao This work was done by Rajesh Prathipati as part of his MS Thesis here. The work has been update by Subrata
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Sections from the textbook: 6.1, 6.2, and 6.3 6.2 Silberschatz,
More informationA Virtual Deadline Scheduler for Window-Constrained Service Guarantees
Boston University OpenBU Computer Science http://open.bu.edu CAS: Computer Science: Technical Reports 2004-03-23 A Virtual Deadline Scheduler for Window-Constrained Service Guarantees Zhang, Yuting Boston
More informationCOMET DISTRIBUTED ELEVATOR CONTROLLER CASE STUDY
COMET DISTRIBUTED ELEVATOR CONTROLLER CASE STUDY System Description: The distributed system has multiple nodes interconnected via LAN and all communications between nodes are via loosely coupled message
More informationIntroduction to Real-Time Systems
Introduction to Real-Time Systems Real-Time Systems, Lecture 1 Martina Maggio and Karl-Erik Årzén 16 January 2018 Lund University, Department of Automatic Control Content [Real-Time Control System: Chapter
More informationOutline for February 6, 2001
Outline for February 6, 2001 ECS 251 Winter 2001 Page 1 Outline for February 6, 2001 1. Greetings and felicitations! a. Friday times good, also Tuesday 3-4:30. Please send me your preferences! 2. Global
More informationReal-Time Task Scheduling for a Variable Voltage Processor
Real-Time Task Scheduling for a Variable Voltage Processor Takanori Okuma Tohru Ishihara Hiroto Yasuura Department of Computer Science and Communication Engineering Graduate School of Information Science
More informationScheduling. Radek Mařík. April 28, 2015 FEE CTU, K Radek Mařík Scheduling April 28, / 48
Scheduling Radek Mařík FEE CTU, K13132 April 28, 2015 Radek Mařík (marikr@fel.cvut.cz) Scheduling April 28, 2015 1 / 48 Outline 1 Introduction to Scheduling Methodology Overview 2 Classification of Scheduling
More information15 CAN Performance Distributed Embedded Systems Philip Koopman October 21, Copyright , Philip Koopman
15 CAN Performance 18-649 Distributed Embedded Systems Philip Koopman October 21, 2015 Copyright 2000-2015, Philip Koopman Where Are We Now? Where we ve been: CAN an event-centric protocol Where we re
More informationMultiple Access (3) Required reading: Garcia 6.3, 6.4.1, CSE 3213, Fall 2010 Instructor: N. Vlajic
1 Multiple Access (3) Required reading: Garcia 6.3, 6.4.1, 6.4.2 CSE 3213, Fall 2010 Instructor: N. Vlajic 2 Medium Sharing Techniques Static Channelization FDMA TDMA Attempt to produce an orderly access
More informationThe Case for Feedback Control Real-Time Scheduling. Abstract
The Case for Feedback Control Real-Time Scheduling John A. Stankovic, Chenyang Lu and Sang H. Son Department of Computer Science University of Virginia Charlottesville, VA22903 USA e-mail: {stankovic,
More informationRouting Messages in a Network
Routing Messages in a Network Reference : J. Leung, T. Tam and G. Young, 'On-Line Routing of Real-Time Messages,' Journal of Parallel and Distributed Computing, 34, pp. 211-217, 1996. J. Leung, T. Tam,
More informationTiming Analysis of the FlexRay Communication Protocol
Downloaded from orbit.dtu.dk on: May 09, 2018 Timing Analysis of the FlexRay Communication Protocol Pop, Traian; Pop, Paul; Eles, Petru; Peng, Zebo Published in: Euromicro Conference on Real-Time Systems
More informationFIFO WITH OFFSETS HIGH SCHEDULABILITY WITH LOW OVERHEADS. RTAS 18 April 13, Björn Brandenburg
FIFO WITH OFFSETS HIGH SCHEDULABILITY WITH LOW OVERHEADS RTAS 18 April 13, 2018 Mitra Nasri Rob Davis Björn Brandenburg FIFO SCHEDULING First-In-First-Out (FIFO) scheduling extremely simple very low overheads
More informationReal Time Operating Systems Lecture 29.1
Real Time Operating Systems Lecture 29.1 EE345M Final Exam study guide (Spring 2014): Final is both a closed and open book exam. During the closed book part you can have a pencil, pen and eraser. During
More informationMultiple Access Methods
Helsinki University of Technology S-72.333 Postgraduate Seminar on Radio Communications Multiple Access Methods Er Liu liuer@cc.hut.fi Communications Laboratory 16.11.2004 Content of presentation Protocol
More informationEnergy Efficient Soft Real-Time Computing through Cross-Layer Predictive Control
Energy Efficient Soft Real-Time Computing through Cross-Layer Predictive Control Guangyi Cao and Arun Ravindran Department of Electrical and Computer Engineering University of North Carolina at Charlotte
More informationExact Response Time of FlexRay Communication Protocol
Exact Response Time of FlexRay Communication Protocol Lucien Ouedraogo and Ratnesh Kumar Dept. of Elect. & Comp. Eng., Iowa State University, Ames, IA, 501, USA Emails: (olucien, rkumar)@iastate.edu Abstract
More informationModular Performance Analysis
Modular Performance Analysis Lothar Thiele Simon Perathoner, Ernesto Wandeler ETH Zurich, Switzerland 1 Embedded Systems Computation/Communication Resource Interaction 2 Models of Computation How can we
More informationScheduling in WiMAX Networks
Scheduling in WiMAX Networks Ritun Patney and Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Ritun@cse.wustl.edu Presented at WiMAX Forum AATG F2F Meeting, Washington
More informationFramework for Performance Analysis of Channel-aware Wireless Schedulers
Framework for Performance Analysis of Channel-aware Wireless Schedulers Raphael Rom and Hwee Pink Tan Department of Electrical Engineering Technion, Israel Institute of Technology Technion City, Haifa
More informationTransportation Timetabling
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING 1. Sports Timetabling Lecture 16 Transportation Timetabling Marco Chiarandini 2. Transportation Timetabling Tanker Scheduling Air Transport Train Timetabling
More informationDeadline scheduling: can your mobile device last longer?
Deadline scheduling: can your mobile device last longer? Juri Lelli, Mario Bambagini, Giuseppe Lipari Linux Plumbers Conference 202 San Diego (CA), USA, August 3 TeCIP Insitute, Scuola Superiore Sant'Anna
More informationBASIC CONCEPTS OF HSPA
284 23-3087 Uen Rev A BASIC CONCEPTS OF HSPA February 2007 White Paper HSPA is a vital part of WCDMA evolution and provides improved end-user experience as well as cost-efficient mobile/wireless broadband.
More informationEffect of Priority Class Ratios on the Novel Delay Weighted Priority Scheduling Algorithm
Effect of Priority Class Ratios on the Novel Delay Weighted Priority Scheduling Algorithm Vasco QUINTYNE Department of Computer Science, Physics and Mathematics, University of the West Indies Cave Hill,
More informationA premium passenger car is controlled and managed by 80+ Embedded Systems. Communication systems for vehicle electronics
Presentation overview Background automotive electronics, an application area for time triggered communication. Time triggered protocols A premium passenger car is controlled and managed by 80+ Embedded
More informationThe Evolution of Real-Time Programming
The Evolution of Real-Time Programming Christoph M. Kirsch Department of Computer Sciences University of Salzburg E-mail: ck@cs.uni-salzburg.at Raja Sengupta Department of Civil Engineering University
More informationScheduling and Communication Synthesis for Distributed Real-Time Systems
Scheduling and Communication Synthesis for Distributed Real-Time Systems Department of Computer and Information Science Linköpings universitet 1 of 30 Outline Motivation System Model and Architecture Scheduling
More informationEfficient Method of Secondary Users Selection Using Dynamic Priority Scheduling
Efficient Method of Secondary Users Selection Using Dynamic Priority Scheduling ABSTRACT Sasikumar.J.T 1, Rathika.P.D 2, Sophia.S 3 PG Scholar 1, Assistant Professor 2, Professor 3 Department of ECE, Sri
More informationA two Layer Guaranteed and Sustained Rate based Scheduler for IEEE based WiMAX Networks
A two Layer Guaranteed and Sustained Rate based Scheduler for IEEE 802.16-2009 based WiMAX Networks Volker Richter, Rico Radeke, and Ralf Lehnert Technische Universität Dresden Dresden, Mommsenstrasse
More informationCSE502: Computer Architecture CSE 502: Computer Architecture
CSE 502: Computer Architecture Out-of-Order Schedulers Data-Capture Scheduler Dispatch: read available operands from ARF/ROB, store in scheduler Commit: Missing operands filled in from bypass Issue: When
More informationAnomalies in Optimal Rate-control and Scheduling Protocols for Cognitive Radio Networks
Anomalies in Optimal Rate-control and Scheduling Protocols for Cognitive Radio Networks Vinay Kolar 1 V. Munishwar 2 N. Abu-Ghazaleh 1,2 1 Department of Computer Science Carnegie Mellon University, Qatar
More informationExperimental Evaluation of the MSP430 Microcontroller Power Requirements
EUROCON 7 The International Conference on Computer as a Tool Warsaw, September 9- Experimental Evaluation of the MSP Microcontroller Power Requirements Karel Dudacek *, Vlastimil Vavricka * * University
More informationTSIN01 Information Networks Lecture 9
TSIN01 Information Networks Lecture 9 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 26 th, 2017 Danyo Danev TSIN01 Information
More informationLecture on Sensor Networks
Lecture on Sensor Networks Copyright (c) 2008 Dr. Thomas Haenselmann (University of Mannheim, Germany). Permission is granted to copy, distribute and/or modify this document under the terms of the GNU
More informationPower Conscious Fixed Priority Scheduling for Hard Real-Time Systems
_ Power Conscious Fixed Priority Scheduling for Hard Real-Time Systems Youngsoo Shin and Kiyoung Choi School of Electrical Engineering Seoul National University Seoul 151-742, Korea Abstract Power efficient
More informationVLSI System Testing. Outline
ECE 538 VLSI System Testing Krish Chakrabarty System-on-Chip (SOC) Testing ECE 538 Krish Chakrabarty 1 Outline Motivation for modular testing of SOCs Wrapper design IEEE 1500 Standard Optimization Test
More informationLecture 2: Embedded Systems: An Introduction
Design & Co-design of Embedded Systems Lecture 2: Embedded Systems: An Introduction Adapted from ECE456 course notes, University of California (Riverside), and EE412 course notes, Princeton University
More informationUNIT 6 ANALOG COMMUNICATION & MULTIPLEXING YOGESH TIWARI EC DEPT,CHARUSAT
UNIT 6 ANALOG COMMUNICATION & MULTIPLEXING YOGESH TIWARI EC DEPT,CHARUSAT Syllabus Multiplexing, Frequency-Division Multiplexing Time-Division Multiplexing Space-Division Multiplexing Combined Modulation
More informationA Problem in Real-Time Data Compression: Sunil Ashtaputre. Jo Perry. and. Carla Savage. Center for Communications and Signal Processing
A Problem in Real-Time Data Compression: How to Keep the Data Flowing at a Regular Rate by Sunil Ashtaputre Jo Perry and Carla Savage Center for Communications and Signal Processing Department of Computer
More informationRaj Jain. The Ohio State University
VBR Voice over ATM: Analysis of Multiplexing Gain and Effect of Scheduling & Drop Policies Jayaraman Iyer,, Sohail Munir Sudhir Dixit, Nokia Research Center Contact: Jain@CIS.Ohio-State.Edu http://www.cis.ohio-state.edu/~jain/
More informationOutline. EEC-484/584 Computer Networks. Homework #1. Homework #1. Lecture 8. Wenbing Zhao Homework #1 Review
EEC-484/584 Computer Networks Lecture 8 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline Homework #1 Review Protocol verification Example
More informationRESOURCE ALLOCATION IN CELLULAR WIRELESS SYSTEMS
RESOURCE ALLOCATION IN CELLULAR WIRELESS SYSTEMS Villy B. Iversen and Arne J. Glenstrup Abstract Keywords: In mobile communications an efficient utilisation of the channels is of great importance. In this
More informationUtilization-Aware Adaptive Back-Pressure Traffic Signal Control
Utilization-Aware Adaptive Back-Pressure Traffic Signal Control Wanli Chang, Samarjit Chakraborty and Anuradha Annaswamy Abstract Back-pressure control of traffic signal, which computes the control phase
More informationCT-Bus : A Heterogeneous CDMA/TDMA Bus for Future SOC
CT-Bus : A Heterogeneous CDMA/TDMA Bus for Future SOC Bo-Cheng Charles Lai 1 Patrick Schaumont 1 Ingrid Verbauwhede 1,2 1 UCLA, EE Dept. 2 K.U.Leuven 42 Westwood Plaza Los Angeles, CA 995 Abstract- CDMA
More informationWireless LAN Applications LAN Extension Cross building interconnection Nomadic access Ad hoc networks Single Cell Wireless LAN
Wireless LANs Mobility Flexibility Hard to wire areas Reduced cost of wireless systems Improved performance of wireless systems Wireless LAN Applications LAN Extension Cross building interconnection Nomadic
More informationEECS 473. Review etc.
EECS 473 Review etc. Nice job folks Projects went well. Last groups demoed on Sunday. Due date issues Assignment 2 and the Final Report are both due today. There was some communication issues with due
More informationInter-Device Synchronous Control Technology for IoT Systems Using Wireless LAN Modules
Inter-Device Synchronous Control Technology for IoT Systems Using Wireless LAN Modules TOHZAKA Yuji SAKAMOTO Takafumi DOI Yusuke Accompanying the expansion of the Internet of Things (IoT), interconnections
More information(
AN INTRODUCTION TO CAMAC (http://www-esd.fnal.gov/esd/catalog/intro/introcam.htm) Computer Automated Measurement And Control, (CAMAC), is a modular data handling system used at almost every nuclear physics
More informationIntelligent Adaptation And Cognitive Networking
Intelligent Adaptation And Cognitive Networking Kevin Langley MAE 298 5/14/2009 Media Wired o Can react to local conditions near speed of light o Generally reactive systems rather than predictive work
More informationModule 3: Physical Layer
Module 3: Physical Layer Dr. Associate Professor of Computer Science Jackson State University Jackson, MS 39217 Phone: 601-979-3661 E-mail: natarajan.meghanathan@jsums.edu 1 Topics 3.1 Signal Levels: Baud
More informationReal Time User-Centric Energy Efficient Scheduling In Embedded Systems
Real Time User-Centric Energy Efficient Scheduling In Embedded Systems N.SREEVALLI, PG Student in Embedded System, ECE Under the Guidance of Mr.D.SRIHARI NAIDU, SIDDARTHA EDUCATIONAL ACADEMY GROUP OF INSTITUTIONS,
More informationReal-Time Systems Hermann Härtig Introduction
Real-Time Systems Hermann Härtig Introduction 08/10/10 Organisation Issues Web-Page http://os.inf.tu-dresden.de/studium/rts/ Subscribe to the mailing list!!! Time 3 SWS: 2 lectures + 1 exercises Thursday,
More informationPower-Aware Scheduling for Embedded Real-Time Systems
Power-Aware Scheduling for Embedded Real-Time Systems STEFAN OLOFSSON Master of Science Thesis MMK 2009:100 MDA 372 KTH Industrial Engineering and Management Machine Design SE-100 44 STOCKHOLM iii. Master
More informationITEE Journal. Information Technology & Electrical Engineering
Volume, Issue August 0 ISSN: - 06-708X 0- International Journal of Information Technology and Electrical Engineering Scheduling in Multi-core Systems: Minimizing Average Waiting Time by merging (Round-Robin
More informationIncreasing Broadcast Reliability for Vehicular Ad Hoc Networks. Nathan Balon and Jinhua Guo University of Michigan - Dearborn
Increasing Broadcast Reliability for Vehicular Ad Hoc Networks Nathan Balon and Jinhua Guo University of Michigan - Dearborn I n t r o d u c t i o n General Information on VANETs Background on 802.11 Background
More informationCOSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section B
MAC: Scheduled Approaches 1. Reservation Systems 2. Polling Systems 3. Token Passing Systems Static Channelization: TDMA and FDMA COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of
More informationTELETRAFFIC ISSUES IN HIGH SPEED CIRCUIT SWITCHED DATA SERVICE OVER GSM
TELETRAFFIC ISSUES IN HIGH SPEED CIRCUIT SWITCHED DATA SERVICE OVER GSM Dayong Zhou and Moshe Zukerman Department of Electrical and Electronic Engineering The University of Melbourne, Parkville, Victoria
More informationIntelligent Handoff in Cellular Data Networks Based on Mobile Positioning
Intelligent Handoff in Cellular Data Networks Based on Mobile Positioning Prasannakumar J.M. 4 th semester MTech (CSE) National Institute Of Technology Karnataka Surathkal 575025 INDIA Dr. K.C.Shet Professor,
More informationEfficient implementation of voice channels over CAN networks
Efficient implementation of voice channels over CAN networks F. Baronti, D. Lunardini, R. Roncella, R. Saletti, Department of Information Engineering, University of Pisa, Italy. Abstract-The Controller
More informationExact statistics of ARQ packet delivery delay over Markov channels with finite round-trip delay
Exact statistics of ARQ packet delivery delay over Markov channels with finite round-trip delay Michele Rossi, Leonardo Badia, Michele Zorzi Dipartimento di Ingegneria, Università di Ferrara via Saragat,
More informationAn Adaptive Distributed Channel Allocation Strategy for Mobile Cellular Networks
Journal of Parallel and Distributed Computing 60, 451473 (2000) doi:10.1006jpdc.1999.1614, available online at http:www.idealibrary.com on An Adaptive Distributed Channel Allocation Strategy for Mobile
More informationValidation Plan: Mitchell Hammock Road. Adaptive Traffic Signal Control System. Prepared by: City of Oviedo. Draft 1: June 2015
Plan: Mitchell Hammock Road Adaptive Traffic Signal Control System Red Bug Lake Road from Slavia Road to SR 426 Mitchell Hammock Road from SR 426 to Lockwood Boulevard Lockwood Boulevard from Mitchell
More informationTELECOMMUNICATION SYSTEMS
TELECOMMUNICATION SYSTEMS By Syed Bakhtawar Shah Abid Lecturer in Computer Science 1 MULTIPLEXING An efficient system maximizes the utilization of all resources. Bandwidth is one of the most precious resources
More informationCognitive Radio Spectrum Access with Prioritized Secondary Users
Appl. Math. Inf. Sci. Vol. 6 No. 2S pp. 595S-601S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. Cognitive Radio Spectrum Access
More informationChapter 2 Overview. Duplexing, Multiple Access - 1 -
Chapter 2 Overview Part 1 (2 weeks ago) Digital Transmission System Frequencies, Spectrum Allocation Radio Propagation and Radio Channels Part 2 (last week) Modulation, Coding, Error Correction Part 3
More informationLattice Throughput Optimal Scheduling: Learning Contention Patterns and Adapting to Load/Topology
Lattice Throughput Optimal Scheduling: Learning Contention Patterns and Adapting to Load/Topology Yung Yi, Gustavo de Veciana, and Sanjay Shakkottai Abstract Aggregate traffic loads and topology in multi-hop
More informationINF3430 Clock and Synchronization
INF3430 Clock and Synchronization P.P.Chu Using VHDL Chapter 16.1-6 INF 3430 - H12 : Chapter 16.1-6 1 Outline 1. Why synchronous? 2. Clock distribution network and skew 3. Multiple-clock system 4. Meta-stability
More informationScheduling on Overlapping Bonded Channels
Scheduling on Overlapping Bonded Channels Fair queuing strategies for single channels Assumptions: Each flow has its own queue from which packets are scheduled. Each queue has a limited capacity. Packets
More informationMedium Access Control
CMPE 477 Wireless and Mobile Networks Medium Access Control Motivation for Wireless MAC SDMA FDMA TDMA CDMA Comparisons CMPE 477 Motivation Can we apply media access methods from fixed networks? Example
More informationCognitive Cellular Systems in China Challenges, Solutions and Testbed
ITU-R SG 1/WP 1B WORKSHOP: SPECTRUM MANAGEMENT ISSUES ON THE USE OF WHITE SPACES BY COGNITIVE RADIO SYSTEMS (Geneva, 20 January 2014) Cognitive Cellular Systems in China Challenges, Solutions and Testbed
More informationExploiting Synchronous and Asynchronous DVS
Exploiting Synchronous and Asynchronous DVS for Feedback EDF Scheduling on an Embedded Platform YIFAN ZHU and FRANK MUELLER, North Carolina State University Contemporary processors support dynamic voltage
More informationIEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 17, NO. 3, MARCH
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 17, NO. 3, MARCH 2009 427 Power Management of Voltage/Frequency Island-Based Systems Using Hardware-Based Methods Puru Choudhary,
More informationTIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS
TIME- OPTIMAL CONVERGECAST IN SENSOR NETWORKS WITH MULTIPLE CHANNELS A Thesis by Masaaki Takahashi Bachelor of Science, Wichita State University, 28 Submitted to the Department of Electrical Engineering
More informationMultiuser Scheduling and Power Sharing for CDMA Packet Data Systems
Multiuser Scheduling and Power Sharing for CDMA Packet Data Systems Sandeep Vangipuram NVIDIA Graphics Pvt. Ltd. No. 10, M.G. Road, Bangalore 560001. sandeep84@gmail.com Srikrishna Bhashyam Department
More informationCapacity Analysis and Call Admission Control in Distributed Cognitive Radio Networks
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS (TO APPEAR) Capacity Analysis and Call Admission Control in Distributed Cognitive Radio Networks SubodhaGunawardena, Student Member, IEEE, and Weihua Zhuang,
More informationArda Gumusalan CS788Term Project 2
Arda Gumusalan CS788Term Project 2 1 2 Logical topology formation. Effective utilization of communication channels. Effective utilization of energy. 3 4 Exploits the tradeoff between CPU speed and time.
More informationHSPA & HSPA+ Introduction
HSPA & HSPA+ Introduction www.huawei.com Objectives Upon completion of this course, you will be able to: Understand the basic principle and features of HSPA and HSPA+ Page1 Contents 1. HSPA & HSPA+ Overview
More informationTime Iteration Protocol for TOD Clock Synchronization. Eric E. Johnson. January 23, 1992
Time Iteration Protocol for TOD Clock Synchronization Eric E. Johnson January 23, 1992 Introduction This report presents a protocol for bringing HF stations into closer synchronization than is normally
More informationMobile Computing. Chapter 3: Medium Access Control
Mobile Computing Chapter 3: Medium Access Control Prof. Sang-Jo Yoo Contents Motivation Access methods SDMA/FDMA/TDMA Aloha Other access methods Access method CDMA 2 1. Motivation Can we apply media access
More informationLecture 7: Centralized MAC protocols. Mythili Vutukuru CS 653 Spring 2014 Jan 27, Monday
Lecture 7: Centralized MAC protocols Mythili Vutukuru CS 653 Spring 2014 Jan 27, Monday Centralized MAC protocols Previous lecture contention based MAC protocols, users decide who transmits when in a decentralized
More informationMixed Criticality Scheduling Applied to JPEG2000 Video Streaming over Wireless Multimedia Sensor Networks
3 December, 2013 Mixed Criticality Scheduling Applied to JPEG2000 Video Streaming over Wireless Multimedia Sensor Networks Alemayehu Addisu, Laurent George, Vincent Sciandra and Max Agueh alex.addisu@gmail.com,
More informationCoding aware routing in wireless networks with bandwidth guarantees. IEEEVTS Vehicular Technology Conference Proceedings. Copyright IEEE.
Title Coding aware routing in wireless networks with bandwidth guarantees Author(s) Hou, R; Lui, KS; Li, J Citation The IEEE 73rd Vehicular Technology Conference (VTC Spring 2011), Budapest, Hungary, 15-18
More informationEfficient algorithms for constructing broadcast disks programs in asymmetric communication environments
Telecommun Syst (2009) 41: 185 209 DOI 10.1007/s11235-009-9158-9 Efficient algorithms for constructing broadcast disks programs in asymmetric communication environments Eleftherios Tiakas Stefanos Ougiaroglou
More informationInvestigation of Timescales for Channel, Rate, and Power Control in a Metropolitan Wireless Mesh Testbed1
Investigation of Timescales for Channel, Rate, and Power Control in a Metropolitan Wireless Mesh Testbed1 1. Introduction Vangelis Angelakis, Konstantinos Mathioudakis, Emmanouil Delakis, Apostolos Traganitis,
More informationOptimal Utility-Based Resource Allocation for OFDM Networks with Multiple Types of Traffic
Optimal Utility-Based Resource Allocation for OFDM Networks with Multiple Types of Traffic Mohammad Katoozian, Keivan Navaie Electrical and Computer Engineering Department Tarbiat Modares University, Tehran,
More informationChapter 1 Introduction
Chapter 1 Introduction 1.1Motivation The past five decades have seen surprising progress in computing and communication technologies that were stimulated by the presence of cheaper, faster, more reliable
More informationA Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks
A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks Elisabeth M. Royer, Chai-Keong Toh IEEE Personal Communications, April 1999 Presented by Hannu Vilpponen 1(15) Hannu_Vilpponen.PPT
More informationCROSS-LAYER DESIGN FOR QoS WIRELESS COMMUNICATIONS
CROSS-LAYER DESIGN FOR QoS WIRELESS COMMUNICATIONS Jie Chen, Tiejun Lv and Haitao Zheng Prepared by Cenker Demir The purpose of the authors To propose a Joint cross-layer design between MAC layer and Physical
More informationEfficiency of Dynamic Arbitration in TDMA Protocols
Efficiency of Dynamic Arbitration in TDMA Protocols April 22, 2005 Jens Chr. Lisner Introduction Arbitration methods in TDMA-based protocols Static arbitration C1 C1 C2 C2 fixed length of slots fixed schedule
More informationOutlines. Examples. Hardware Interface. What s Embedded Systems? Krerk Piromsopa, Ph.D. Department of Computer Engineering Chulalongkorn University
Outlines Hardware Interface Introduction to Embedded / Real Time Systems Polling, Interrupt Devices and Interfaces LED Krerk Piromsopa, Ph.D. Department of Computer Engineering Chulalongkorn University
More informationDependable Communication Synthesis for Distributed Embedded Systems *
Dependable Communication Synthesis for Distributed Embedded Systems * Nagarajan Kandasamy 1, John P. Hayes 2, and Brian T. Murray 3 1 Institute for Software Integrated Systems, Vanderbilt University, Nashville,
More informationWireless Networked Systems
Wireless Networked Systems CS 795/895 - Spring 2013 Lec #4: Medium Access Control Power/CarrierSense Control, Multi-Channel, Directional Antenna Tamer Nadeem Dept. of Computer Science Power & Carrier Sense
More informationUnderstanding PMC Interactions and Supported Features
CHAPTER3 Understanding PMC Interactions and This chapter provides information about the scenarios where you might use the PMC, information about the server and PMC interactions, PMC supported features,
More informationStudy of Location Management for Next Generation Personal Communication Networks
Study of Location Management for Next Generation Personal Communication Networks TEERAPAT SANGUANKOTCHAKORN and PANUVIT WIBULLANON Telecommunications Field of Study School of Advanced Technologies Asian
More information