The idea of virtualizing a computer system’s resources, including processors, memory, and I/O devices, has been well established for decades, aiming at improving sharing and utilization of computer systems. Hardware virtualization allows running multiple operating systems and software stacks on a single physical platform. As depicted in Figure 1.2, a software layer, the virtual machine […]
In utility computing environments, users assign a “utility” value to their jobs, where utility is a fixed or time-varying valuation that captures various QoS constraints (deadline, importance, satisfaction). The valuation is the amount they are willing to pay a service provider to satisfy their demands. The service providers then attempt to maximize their own utility, […]
Grid computing enables aggregation of distributed resources and transparently access to them. Most production grids such as TeraGrid and EGEE seek to share compute and storage resources distributed across different administrative domains, with their main focus being speeding up a broad range of scientific applications, such as climate modeling, drug design, and protein analysis. [wp_ad_camp_1] […]
ALGORITHM Purpose : To find roots of a given quadratic equation. Input: Coefficients of quadratic equation a, b, c Output: Root1 and Root2 START STEP 1: [Input the values of a, b, c] read a, b, c STEP 2: [Calculate the determinant] determinant = b*b-4*a*c STEP 3: [Check for validity] If a is equal to […]
ALGORITHM: PURPOSE : To simulate a calculator using arithmetic expressions INPUT: Enter num1 and num2 OUTPUT: Print the result of addition or subtraction or multiplication or division or modulus. START Step 1: [Enter first number] read num1 Step 2: [Enter Second number] read num2 Step 3:[Enter Choice] read choice Step 4:[To perform addition] if choice […]
The process of working through details of a problem to reach a solution. There are three approaches to problem solving: 1. Algorithm 2. Flowchart 3. Pseudo Code Algorithm: The algorithm is a step-by-step procedure to be followed in solving a problem. It provides a scheme to solve a particular problem in finite number of unambiguous […]
It is a form of structured English that describes algorithms. It facilitates the designers to focus on the logic of the algorithm without getting bogged down by the details of language syntax. Pseudocode is a compact and informal high-level description of an algorithm that uses the structural conventions of a programming language. It is meant […]
Memory consists of a large array of words or bytes, each with its own address. The CPU fetches instructions from memory according to the value of the program counter. These instructions may cause additional loading from and storing to specific memory addresses. Memory unit sees only a stream of memory addresses. It does not know […]
When a detection algorithm determines that a deadlock exists, several alternatives exist. One possibility is to inform the operator that a deadlock has occurred, and to let the operator deal with the deadlock manually. The other possibility is to let the system recover from the deadlock automatically. There are two options for breaking a deadlock. […]
1. Let Work and Finish be vectors of length m and n, respectively. Initialize: Work = Available Finish [i] = false for i = 0, 1, …,n- 1. 2. Find and i such that both: (a) Finish [i] = false (b) Needi≤Work If no such i exists, go to step 4. 3. Work = Work […]
