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.
a summary of what operating system do
Explain FIFO page replacement A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest p
What is a reference string? An algorithm is evaluated by running it on a particular string of memory references and computing the number of page faults. The string of memory re
Question: (a) Distinguish between local and active directory Group Policy in Windows Server 2008? (b) Describe the three areas of account Policies that can be managed thro
Describe the following allocation algorithms: a. First fit b. Best fit c. Worst fit a. First-fit: search the list of available memory and all
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4 Provide two programm
Q. Suppose an operating system maps user-level threads to the kernel utilizing the many-to-many model where the mapping is done through the use of LWPs. In addition the system allo
Q. More than one disk drive is able to be attached to a SCSI bus. Especially a fast wide SCSI-II bus can be connected to at most 15 disk drives. Remember that this bus has a bandw
Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current f
Q. In a disk jukebox what would be the result of having more open files than the number of drives in the jukebox? Answer: Two bad results could result. One likelihood is star
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