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.
Define I/O and CPU Bursts Applications typically to through cycle of CPU bursts and Input/output bursts. Since the CPU sits idle during I/O operations, efficiency is improved
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
What are the different ways in which a thread can be cancelled? Cancellation of a target thread may happen in two different scenarios: Asynchronous cancellation: One thr
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
Q. Presume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p along with n distinct page numbers
What is a general graph? A tree structure where links can go from one branch to a node earlier in the similar branch or other branch, allowing cycles.
Describe the internal layout of the file system in windows 2000. The basic entity in NTFS is a volume and a volume is created by the Windows 2000 disk administrator utility and
General Graph Directory A serious trouble with using an acyclic graph structure is making sure that there are no cycles. When links are further added to an existing tree struc
Define Server Processing with Queues The efficient server processing of client request is essential for optimized client- server applications. This process is greatly enhanced
What are the various layers of a file system? The file system is composed of many dissimilar levels. Each level in the design uses the feature of the lower levels to make new f
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