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.
What is Multitasking? Multitasking provides power to users by offering them to run multiple applications at once. The applications are loaded into memory and appear to the user
Define dynamic loading. To obtain better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. All routines are ke
Problem 1. What is kernel? What are the main components of a kernel? Defining Kernel Explaining Main components of Kernel 2. What is mutual exclusion? What are i
Explain Busy Waiting Semaphores Weak, Busy-wait Semaphores a) The simplest way to implement semaphores. b) Useful while critical sections last for a short time, or we com
Let us consider the operation of the EPROM device in more detail. Consider the pining details below again Before we examine the interface means of the EPROM, it is worth
ADVANTAGES AND INCONVENIENCES OF KLT Advantages: the kernel be able to simultaneously schedule many threads of the same process on many processors blocking
explain the link between operations management and strategic planning of daily goods shop
Explain Chaining to Handle Collision Chaining: One easy scheme is to chain all collisions in lists attached to the suitable slot. This permits an unlimited number of collision
Which android version is available till now
Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are
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