Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Write a short note on peer-to-peer computing.
Peer-to-peer (P2P) system model is a kind of distributed OS. In this model, clients and servers aren't distinguished from one another. in its place, all nodes inside the system are considered peers, and each may proceed as either a client or a server, depending on whether it is providing or requesting a service. Peer-to-peer systems offer a benefit over traditional client server systems; several nodes distributed during the network can provide services.
To participate in a peer-to-peer system a node has to first join the network of peers. Formerly a node has joined the network, it able to begin providing the services to and requesting services from - other nodes in the network. Determining what services are available is proficient in one of two general ways:
* When a node connects a network it registers its service with a centralized lookup service on the network. Any node wants a specific service first contacts this centralized lookup service to determine which node provides the service. The remainder of the communication takes among the client and the service provider.
** A peer acting like a client must first discover what node provides a desired service by broadcasting a request for the service to all other nodes in the network. The node (or nodes) offers that service responds to the peer making the request. To favor this approach, a discovery protocol should be provided that allows peers to discover services provided by other peers in the network.
NEXT FIT ALGORITHM Here scanning starts from the first fit position and then it finds the next position which is large sufficient to hold the process. Thus the name next fit.
Explain the Sleep (ms) Function This call places the current thread in a suspended state for the number of milliseconds passed as the parameter (ms). After that Windows NT wil
Step by step displays the content, and the final result of the list ("buffer") of 6 elements as the initial values ??and the following elements which are produced (NEXTP) or consum
what is multilevel page table and its applications?
Priority Scheduling leads to the risk of starvation: a process is ready, but never is given the processor. Some preemptive priority schedulers therefore reserve a fraction of the p
What is the main difficulty that a programmer must overcome in writing an operating system for a real-time environment? The main difficulty is keeping the operating system with
Single level directory: This is the easiest directory structure. All the files are controlled in the same directory, which is simple to support and understand. Few of the li
Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne
What is the use of boot block? For a computer to begin running when powered up or rebooted it requires having an initial program to run. This bootstrap program tends to be easy
Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd