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.
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
Relocation bits employed by relocating loader are specified by Relocation bits employed by relocating loader are specified by Assembler or Translator
Modern networks are not implemented as a single piece of software; that would render the task of dealing with multiple technologies and manufacturers virtually impossible. The solu
Q. Explain about Input - Output System Management? I/O System Management The module which keeps track of the status of devices is known as I/O traffic controller. Every
Explain the basic method of paging method. Physical memory is divided into the fixed-sized blocks called frames. Logical memory is as well divided into blocks of the same size
What are the various disk-scheduling algorithms? The several disk-scheduling algorithms are a. First Come First Served Scheduling b. Shortest Seek Time First Scheduling
Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are
What is linked allocation, as detailed in text? Directory has pointers to first and last blocks of file. Every block of file (except last) has pointer to the next block.
Processes and Programs Process is a dynamic entity which is a program in execution. A process is a sequence of information executions. Process exists in a limited span of t
We are use to using variables within C without thinking about where they are stored. Most variables are dynamic i.e. can change, therefore they are stored in Ram, unlike a program
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