Distributed Process Scheduling Summery . BY:-Yonatan Negash. Title…. 1 . Definition 2. Objectives 3. Static Process Scheduling 4. Dynamic Load Sharing and Balancing 5.Distributed Process Implementation 6.Future work 7.Reference. Definition.
1.Distribute process scheduling
2.Some important term on this chapter
*** such as:- 1.processcompletion time and
2. processor utilization.
Before processes can execute, they need to be:-
1.To enhance overall system performance metrics like:
2. To achieve location and performance transparencies by distributed process scheduling.
The existence of multiple processing nodes in distributed systems present a challenging problem for scheduling processes onto processors and vice versa.
If processes are not constrained by precedence relations and are free to be redistributed or moved around among processors in the system, performance can be further improved by sharing the workload
– Scheduling need to be dynamic
– Assignment decision made locally
Depending on how the request messages are interpreted,
there are three main application scenarios:
A. The problem of process distribution in a computer network can be formulated as a distributed search process.
B***Distributed Immune Systems for Wireless Networks
2.Formal and Statistical Models for Detection and Security Problems
***Synopsis: We are interested in detecting and signaling anomalies in the network by the use of sequential probability ratio tests. Some examples we are looking at are detecting distributed attacks in fixed networks and routing attacks for ad hoc wireless networks.
3.Communication-Friendly Encryption of Multimedia
4 and Other area
. Randy Chow, Theodore Johnson, “Distributed Operating Systems & Algorithms”, Addison Wesley.(all diagrams)
. http://www.isr.umd.edu/Labs/SEIL/Research_Projects/CurrentProjects/wireless_security.html#Continous monitoring