answersLogoWhite

0

distributed system doesn't have any global clock time. It uses some special schedule technique such as lampart's cycle and other algorithm.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is the Round Robin algorithm?

It's an algorithm that is used for CPU schedulers.


How many ways can seven books be distributed to Robin Lily and Alexandria such that two books are distributed to Robin and Lily and three books are distributed to Alexandria?

210 ways.


the performance of round robin algorithm depends on?

The size of the Time Quantum


Which CPU shchedule algorithm is used by Windows 8?

Round Robin


the performance of round robin algorithm depends heavily on?

The size of the Time Quantum


What do you mean by scheduling algorithm in OS?

its the algorithm that tells the os what to process next.goes according to :shortest job firstshortest remaining time firstround robin- first in first out system


Round robin scheduling program in java?

Round robin is the scheduling algorithm that is utilized by the CPU, or central processing unit, during the execution of the process. It is specifically designed for time sharing systems.


How many ways can 7 books be distributed to Robin Lily and Alexandria such that 2 books are distributed to Robin and Lily and 3 books to Alexandria?

There are 21 ways to distribute the 7 books among the 3 individuals such that 2 books go to Robin and Lily, and 3 books go to Alexandria. This can be calculated using the formula for combinations: C(7, 2) * C(5, 3) = 21.


How does an American Robin adapt to its environment?

The robin is found in woodlands, parks, suburban lawns, orchards.


What CPU scheduling algorithm is used Windows NT?

Windows XP uses a quantum-based, preemptive priority scheduling algorithm


Attackers can now use thousands of computers in an attack against a single computer or network?

Yes..It's called a Distributed attack. ***Robin the Dork***


Write an algorithm for round robin?

A round robin algorithm processes a number of tasks, steps or items one by one in a cyclic fashion like so:1. For N items, n=0, 2, 3, ..., N-1, let nbe 0.2. Process step (item, task) n3. Compute n = (n+1) % N, where % is the modulo operator (the remainder of integer division)4. Proceed to step 2.