Optimized Time Quantum For Dynamic Round Robin Algorithm

In order for IT System to become active first Computer Programs and Programming must be put in place. Computer Programs and Programming are simple terms an executable set of commands for the computer to perform. A process is an actively running program which may or may not is running in the background. A program running in the background is one that the computer user may not be aware of, but it may be providing useful services such as an ability to connect to other computers. It reads and executes program instructions, performs calculations, and makes decisions (slideshare.net).

Processor: A computer processer, otherwise known as the CPU (Central Processing Unit) is a part of the computer that receives input and decides that the output will be. Many modern CPUs are capable of processing trillions of calculations per second. The speed of a processor measured by how many operations a CPU can do in one second; this is done in MHz or GHz (Megahertz or Gigahertz). A processer with the speed of 1 MHz does 1,000,000 operations per second, and a 1GHz processer does 1,000,000,000 operations per second. This is known as the clock speed.

It has a thread ID, a program counter, a register set, and a stack. Thread is smaller than a process so thread creation needs only some resources when with a process creation. In creating a process, it requires to allocate the process control block (PCB).The PCB includes a memory map and list of open files. A process creation makes memory being allocated for program instructions and data.

The program by its self is just instructions writing in code where a process is an active program which has been executed. The CPU executes one instruction at a time until the process completes.

The processor (otherwise known as CPU) is the very soul and performance core of the computer system; it is what allows the operating system and other software applications to-run. Every program demands dedication from the processor to decode commands that are then actionedinside the CPU to make them work.When a program is running, the CPU has to make every command work consistently one after the other. However, modern processors have the power to process commands side by side. This means that the quicker the commands are executed, the quicker the program responds to the user. Central Processing Units (CPUs) play an important role when it comes to maintaining

In simulated network the source node designated as1 initiates the routing procedure by sending RREQ or Route Request message to its surrounding nodes. The RREQ message sent by the source node is denoted in the color green. The other RREQ messages are shown in cyan, yellow, black etc. The source node 1 is sending the RREQ message to its neighbour nodes 5, 6, 9, 11 and 13 and the links are formed shown by the green line. Every time node 5,6,9,11,13 is sending the RREQ message to its neighbour and the links are formed.

here we have to find time required to send first packet from source to first packet switch.

In order to evaluate the performance of the proposed DCHS algorithm, we compare MILP with the energy consumption and delay constrained routing protocol.

In order to avoid this problem, a technique called probability distribution algorithm is introduced. In probability distribution algorithm, the random traffic between the primary network users are analyzed. The nearby nodes behaviors are learnt by the secondary node. The probability of the traffic in the neighboring nodes are studied by the node that tries to transmit data. When the traffic is free then the secondary node establishes the connection. If there is traffic then the secondary node searches for other nodes. Thus the data transmission occurs in this CR

In order to test the effectiveness of IGA and GA when solving the timetabling problem, a comparison with the PSO algorithm was performed to investigate trends of performance. All coding was written in MATLAB code and the test case focused on the three above algorithms. All tests were executed on a 3.30 Ghz Intel core i5 processor with 16 GB of ram. The convergence graphs for IGA, GA, and PSO below shows progress until a valid solution for each of the algorithms were discovered. Each of the algorithms simulated 1,000 generations. The graph in Figure 10 - 14 provides a comparison of the proposed algorithm with the conventional population operator based algorithm.

To ensure QoS in our proposed algorithm we calculate the utility of a node e.g. $node_i$ as the summation of remaining CPU cycle ($R_{CPU_i}$), remaining memory in that node ($R_{mem_i}$), remaining bandwidth available for that node ($R_{bw_i}$), remaining data reside in the buffer to transmit ($R_{data_i}$), data rate ($Data_{rate_i}$) and priority of data to be transmitted $Pri_{data_i}$.

Yes. The Interval Scheduling problem can be solved in time O(nlogn) without calling a function to solve the Vertex Cover problem. Therefore, the problem can be solved in a number of computations and a number of calls to the function (both polynomial) that returns the result for Vertex Cover problem. Hence, we can conclude that Interval Scheduling ≤p Vertex Cover.

(b) What is the scheduling algorithm that results when
<  < 0? Explain.

Assume that one applicant comes every 6 minutes; compute the throughput rate and utilization of each worker.

4. Performance Comparison of Dual Core Processors Using Multiprogrammed and Multithreaded Benchmarks ............................................................................................... 31 4.1 Overview ........................................................................................................... 31 4.2 Methodology ..................................................................................................... 31 Multiprogrammed Workload Measurements .................................................... 33 4.3 4.4 Multithreaded Program Behavior ..................................................................... 36 5. 6. Related Work ............................................................................................................ 39 Conclusion ................................................................................................................ 41