Optimization of Priority based CPU Scheduling Algorithms to Minimize Starvation of Processes using an Efficiency Factor
|
|
- Joleen Robbins
- 6 years ago
- Views:
Transcription
1 Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December21 Optimizatio of based CPU Schedulig Algorithms to Miimize Starvatio of Processes usig a Efficiecy Factor Muhammad A. Mustapha Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria, Nigeria Saleh E. Abdullahi Departmet of Computer Sciece, Nigeria Turkish Nile Uiversity, Abuja, Nigeria Sahalu B. Juaidu Iya Abubakar Computer Ceter, Ahmadu Bello Uiversity, Zaria, Nigeria ABSTRACT The priority based CPU schedulig algorithm (i.e. Shortest Job First () or Schedulig (PS)) is a kid of schedulig algorithm that assigs the CPU to processes based o the priority of each process. The shortcomig of both of these algorithms is starvatio (i.e. starvatio of processes with loger burst times i the case of ad starvatio of processes with lower priorities i the case of PS). This paper proposes a ew algorithm that itroduces the cocept of EFFICIENCY FACTOR to all processes. This proposed algorithm was implemeted ad bechmarked agaist, PS ad the Optimum Service Time Cocept for Roud Robi Algorithm () by [9] usig to geerate the burst times, Expoetial distributio to geerate the priorities ad Poisso distributio to geerate the arrival times of processes. It is observed that i the category, the traditioal produced better Average Waitig Time (AWT), Average Turaroud Time (ATAT), Average Respose Time (ART) ad Waitig Time Variace Deviatio (WTVD) compared with the proposed. But they both produced the same Number of Cotext Switches (NCS). The proposed produced better results compared with with respect to AWT, ATAT, ART, NCS ad WTVD. While i the PS category, the proposed priority produced better AWT, ATAT, ART ad WTVD compared to the traditioal schedulig algorithm. But they both produced the same NCS. The proposed algorithm produced better results compared with with respect to NCS ad WTVD also produced almost the same result i terms of AWT ad ATAT i all categories of the statistical distributios used. Based o these results, the proposed priority algorithm should be preferred over the traditioal priority algorithm. Keywords CPU schedulig algorithms, Efficiecy factor, Shortest Job First Schedulig, Starvatio, Schedulig, Waitig Time Variace Deviatio 1. INTRODUCTION The Cetral Processig Uit (CPU) is a importat compoet of the computer system; hece it must be utilized efficietly. This ca be achieved through what is called CPU schedulig [7]. CPU Schedulig refers to a set of policies ad mechaisms to cotrol the order of work to be performed by a computer system. The CPU schedulig is oe of the most importat tasks of the operatig system []. The eed for a schedulig algorithm to achieve the efficiecy of the CPU arises from the requiremet for most moder systems to perform multitaskig (execute more tha oe process at a time) ad multiplexig (trasmit multiple flows simultaeously). CPU Schedulig is the act of selectig the ext process for the CPU to service, oce the curret process leaves the CPU idle. Some basic CPU schedulig algorithms are listed below: 1. First-Come First-Serve (FCFS) By far the simplest CPU-schedulig algorithm is the firstcome, first-served (FCFS) schedulig algorithm. The implemetatio of the FCFS policy is easily maaged with a FIFO queue. Whe a process eters the ready queue, its PCB is liked oto the tail of the queue. The average waitig time uder the FCFS policy, however, is ofte quite log [2]. 2. Shortest-Job-First () This is a priority based algorithm which associates with each process the legth of the process's ext CPU burst [4]. Whe the CPU is available, it is assiged to the process that has the smallest ext CPU burst. If the ext CPU bursts of two processes are the same, FCFS schedulig is used. The schedulig algorithm gives the miimum average waitig time for a give set of processes. The real difficulty with the algorithm is kowig the legth of the ext CPU request. The algorithm a optimal algorithm because it produces miimum average waitig time, average turaroud time ad umber of cotext switches. 3. Schedulig (PS) A priority umber is associated with each process. The CPU is allocated to the process with the highest priority. If there are multiple processes with same priority, the FCFS is used to allocate the CPU. A variatio of this scheme allows preemptio of the curret process wheever a higher priority process arrives. Aother variatio of the policy adds a agig scheme, where the priority of a process icreases as it remais i the ready queue. 4. Roud-Robi Schedulig (RR) This algorithm is especially desiged for time-sharig systems; each process gets a small uit of CPU time. This algorithm allows the first process i the queue to ru util it expires its time, ad the rus the ext process i the queue. I a situatio where a process eeds more time, the process rus for the full legth of the time quatum ad the it is preempted ad the added to the tail of the queue. 1.1 Performace Criteria The various CPU schedulig algorithms have differet properties, ad the choice of a particular algorithm may favor oe class of processes over aother. For selectio of a 24
2 Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December21 algorithm for a particular situatio, properties of various algorithms must be cosidered. The schedulig criteria iclude the followig [1]: 1. Cotext Switch: A cotext switch is process of storig ad restorig cotext (state) of a preempted process, so that executio ca be resumed from same poit at a later time. 2. Throughput: Throughput is defied as umber of processes completed per uit time. Cotext switchig ad throughput are iversely proportioal to each other. 3. CPU Utilizatio: This is a measure of how much busy the CPU is. Usually, the goal is to maximize the CPU utilizatio. 4. Turaroud Time: Turaroud time refers to the total time which is spet to complete the process.. Waitig Time: Waitig time is the total time a process has bee waitig i ready queue. 6. Respose Time: respose time is the time from the submissio of a request util the first respose is produced So, a good schedulig algorithm for real time ad time sharig systems must possess the followig characteristics: 1. Miimum cotext switches. 2. Maximum CPU utilizatio. 3. Maximum throughput. 4. Miimum turaroud time.. Miimum waitig time. 6. Miimum respose time. 1.2 Waitig Time Variace Variace is a statistical word, which is the measuremet of the spread betwee umbers i a data set. It measures how far each umber i the set is from the mea. σ 2 = (i μ)2 N (1) were σ 2 is te variace, N is te umber of processes, i te i t process ad μ is te mea of te processes A variace value of zero idicates that all values withi a set of umbers are idetical; all variaces that are o-zero are assiged positive umbers. A large variace idicates that umbers i the set are far from the mea ad each other, while a small variace idicates the opposite [3]. The waitig time variace is the measure of how far the waitig time of processes are from the mea of the processes waitig times. This implies that waitig time variace of processes should be miimized [6]. based CPU Schedulig Algorithms such as Shortest Job First Algorithm which assigs CPU to processes accordig to their burst times ad CPU Schedulig Algorithm which assigs CPU to processes accordig to their priorities suffer from the problem of starvatio. They are ot fair as they are biased to processes of high priorities [9]. Cosequetly the goal of this work is to miimize starvatio i the priority based CPU schedulig algorithms that is shortest job first ad priority schedulig algorithms thereby reducig the average waitig time, average turaroud time, average respose time, umber of cotext switches ad waitig time variace deviatio. 2. RELATED WORK Brich [1] proposed a algorithm amed Highest Respose Ratio Next (HRRN) CPU schedulig algorithm to address the shortcomigs of the Shortest Job First () ad Shortest Job Next (SJN) CPU Schedulig algorithms which are starvatio ad lack of fairess to loger burst time processes. It does this by usig equatio (2) to calculate the Respose Ratio of processes Respose Ratio = Waitig Time + Service Time Service Time (2) It allocates the CPU to the process with the Highest Respose Ratio ad it also takes care of the problem of determiig the ext burst time of processes i. Its disadvatage is that it is computatioally itesive ad its limitatio is that it does ot address user priority. Rakesh et al [8] proposed a ew variat of Roud Robi Schedulig algorithm by executig the processes accordig to a ew calculated fit factor f ad usig the cocept of dyamic time quatum. Geerally with every process three factors are associated. These factors are user priority, burst time ad arrival time. Above factors play a importat role to decide i which sequece the processes will be executed. Sortig accordig to the importace of these factors, user priority comes first, the the burst time ad at last the arrival time of the processes. If all the 3 factors are mixed up to calculate a ew factor i.e. Fit Factor f which will decide the order of executio the average waitig time, average turaroud time ad umber of cotext switches will be decreased. So to icrease the resposiveess of the system, RR algorithm should be used. Geerally i RR algorithm, processes are take from the ready queue i FCFS maer for executio. But i the proposed algorithm, f is calculated for each process. The process havig the lowest f value will be scheduled first. The two importat criteria that decide the early executio of processes are higher user priority ad shorter burst time. As user priority has higher importace tha other factors, so it is give a weight age of 6% ad burst time is give 4%, assumig that all the processes have same arrival time i.e. arrival time =. Let the User = UP, User Weight = UW, Shorter Burst time = SP, Burst time Weight = BW. The Fit Factor f ca be calculated as f = UP UW + SP BW (3) Dyamic time quatum is used i order to overcome the limitatios of static RR. To get the optimal time quatum, media of the remaiig burst time is take as the time quatum. Saxea ad Agarwal [9] desiged a algorithm kow as Desig ad Performace Evaluatio of Optimum Service Time Cocept for Roud Robi Algorithm (). Geerally, with every process, three factors are associated. These factors are user priority, burst time ad arrival time. These factors play a importat role to decide i which sequece the processes will be executed. Sice the algorithm is a priority based system, the cocept of Optimum was employed, which combies user defied priority, effect of shorter burst time ad effect of arrival time i a way so as to achieve better turaroud time ad average waitig time. A weight of. is assiged to user or system defied priority, a weight of.3 to burst time ad.2 to arrival time. This esures that user defied priority; burst time; ad arrival time get cosideratio while decidig order of executio of processes. A higher priority process gets a higher umber; a 2
3 Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December21 shorter process also gets a higher umber; ad a process that arrived earlier also gets a higher umber i the umberig scheme. A Optimum OP is give as: OP =. P +.3 BT +.2 AT (4) Where P is user or system defied priority; BT is priority umber assiged accordig to shorter burst time; ad AT is priority umber assiged accordig to early arrival of the process. A time quatum was selected while takig ito accout the same cosideratios that is take while selectig time quatum for RR algorithm. The Optimum service time OST for each process is give by equatio (): OST i = OP i q () Where OST i is the service time of process with Optimum OP i, q is the decided time quatum. All the processes are placed i a priority queue. After calculatig the service time of each process, CPU is assiged to the process with highest optimum service time. I case of coflict, the process with shorter burst time is give preferece. If coflict still persists the process that arrived earlier is give preferece. The process decided executes for a period that is equal to optimum service time of the process OST i or its burst time whichever is smallest. I case a process or the set of processes with same value of OP, which so ever is applicable, fiish executio after a sigle roud, the value of OST is redistributed removig the value of OST of fiished process ad redistributig the value of OST accordigly. 3. THE PROPOSED ALGORITHMS The proposed CPU schedulig algorithms use Efficiecy factor values to assig priority to processes which will be used for CPU allocatio. The Efficiecy factor value for the proposed uses equatio (6): E = BTW + WW (6) Where BTW is Burst time Weight ad WW is Waitig time Weight. The first process to arrive the arrival queue is scheduled first sice it is the oly process i the system the ad it is allocated the CPU to execute for the period of its burst time. By the time it has fiished executig, some processes will have arrived the arrival queue their efficiecy values is calculated by fidig the Burst Tme Weight (BTW) for all the processes that arrived withi this period so that the process with the least burst time is give a BTW of 1. All other processes are give BTW i ascedig order of their burst times. Also each process is give Waitig Time Weight (WW), accordig to their arrival times so that the first process to arrive is give a WW of 1. All other processes uder cosideratio are give WW of 2, 3 util all processes uder cosideratio are give WW. The the E- value of each process will be computed usig equatio (6) ad the process with the lowest E-value is scheduled first followed by the process with ext lower E-value util all processes that arrived the system have fiished executig. This process of determiatio of E-values ad schedulig of processes is performed util there is o process remaiig i the arrival ad ready queues. The Efficiecy factor value for the proposed schedulig algorithm uses equatio (7): E = PW + BTW + WW (7) where, PW is Weight, BTW is Burst time Weight ad WW is Waitig time Weight. Similarly, for the priority (PS) category, the same method as i the case of is employed but with the iclusio the Weight (PW), which is calculated based o the priority values of the processes i which the process with the highest priority is give a priority weight of 1 ad all other processes are give PW of 2, 3 util all processes uder cosideratio are give PW. The the E-value of each process will be computed usig equatio (7) ad the process with the lowest E-value is scheduled first followed by the process with ext lower E-value util all processes that arrived the system have fiished executig. This process of determiatio of E-values ad schedulig of processes is performed util there is o process remaiig i the arrival ad ready queues. 3.1 The pseudo code of the Proposed Based CPU Schedulig Algorithms This pseudo code illustrates how the priority based CPU schedulig algorithms work i.e. the priority ad shortest job first CPU schedulig algorithms. Step 1: Start INPUT: (N), Burst Time (BT) of processes, Arrival Time (AT) of processes, (PRIO) of processes, Queue READY, Queue ARRIVAL OUTPUT: Number of Cotext Switches (NCS), Average Waitig Time (AWT), Average Turaroud Time (ATAT), Waitig Time Variace Deviatio (WTVD) ad Average Respose Time (ART) Step 2: NCS = ; AWT = ; ATAT = ; ART = ; WTVD = ; BT = uiform a, b ; AT = Poisso (rate); PRIO = Expoetial rate ; Last Poit = ; = N; Step 3: For i = 1 to efficiecy factor i = ; // efficiecy factor Step 4: WHILE (ARRIVAL! = NULL) Step : WHILE (READY! = NULL) Step 6: For i = 1 to REQUEST Process i // Fill the ready queue //accordig to Arrival Time Assig priority weight, burst time weight ad arrival weight usig the geerated values based o the proposed algorithm Step 7: For i = 1 to if algoritm == efficiecy factor i = BTW + WW else if algoritm == priority 26
4 END if efficiecy factor i = PW + BTW + WW Mi = efficiecy factor[1] Step 8: For (i = 1 to 1 ) If efficiecy factor i < Mi //sort processes accordig // to lowest efficiecy factor END if Mi = efficiecy factor i efficiecy factor i = efficiecy factor i+1 efficiecy factor i+1 = Mi Step 9: For (i = 1 to ) Last Poit = Last Poit + BT i TAT i = Last Poit AT i WT i = TAT i BT i RT = TAT i BT i BT i = NCS i = NCS i + 1 END WHILE END WHILE Step 1: uiform (a, b) { // geerate radom values usig // uiform distributio } a + rad,1 (b a) Step 11: Poisso (rate) { // geerate radom values usig // Poisso distributio k = p = 1 l = e rate do { k = k + 1 p = p rad,1 }wile p l Shortest Job First () Schedulig (PS) Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December21 } k = k 1 retur k Step 12: Expoetial (rate) { // geerate radom values // usig expoetial distributio retur log(1 rad(,1)) rate } } Step 13: Calculate OUTPUT parameters i=1 WT i AWT = i=1 TAT i ATAT = i=1 RT i ART = i=1(wt i AWT) 2 WTV = For (i = 1 to k ) //k stads for the algorithm uder cosideratio ad opt is the algorithm with the least waitig time variace. END Figure 1: Gatt chart represetatio of WTVD k = WTV k WTV opt WTV opt 1% 3.2 Illustrative Examples To demostrate the previous cosideratios, this example is cosidered, i which each process with its burst ad arrival time as show i Table 4.1, where the time quatum used i is 1ms. The values were chose radomly. Table 1: Process Table PR_ID AT BT PRIO P1 3 1 P P P4 4 3 P P P P P P1 1 2 P P P P1 P2 P3 P P4 P8 P1 P9 P6 P11 P7 P P13 P1 P3 P4 P2 P P7 P9 P11 P1 P8 P6 P13 P Figure 2: Gatt chart represetatio of CPU Schedulig Algorithm 27
5 Average Waitig Time Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December Proposed Shortest Job First P1 P2 P3 P P4 P6 P1 P9 P8 P7 P11 P12 P Proposed Schedulig Figure 3: Gatt chart represetatio of Proposed Shortest Job First Figure 4: Gatt chart represetatio of Proposed Schedulig Figure : Gatt chart represetatio of Algorith ms P1 P3 P2 P4 P P6 P9 P1 P11 P7 P8 P12 P1 P2 P3 P4 P6 P P7 P8 P9 P1 P11 P12 Table 2: Comparative Table AW T ATA T AR T NC S WTV D (%) WTV D (%) Pro Pro Table 2 shows the comparative results of the algorithms uder study. I the category, the proposed algorithm produced the best result followed by the traditioal algorithm ad the. I the priority category the proposed algorithm produced the best result followed by the traditioal priority algorithm followed by. 4 SIMULATION I this paper, the followig five performace criteria are studied: AWT, ATAT, ART, NCS ad WTVD. The evaluatio is doe usig a simulatio by geeratig processes radomly with Uiform statistical distributio to geerate burst times of the processes. The simulatio is doe i two differet categories; i the first category (i.e. the Shortest Job First ()) cosistig of:, the ew ad Optimum Service Time Roud Robi CPU Schedulig algorithms ad i the secod category (i.e. the Schedulig (PS)) cosistig of: PS, the ew PS ad Optimum Service Time Roud Robi CPU Schedulig algorithms to observe these criteria. The simulatio eviromet where all the experimets were performed was a sigle processor eviromet ad all the processes are idepedet ad CPU boud, o process was I/O boud ad the system was also assumed to have o cotext switch cost. A process geerator routie to geerate the process sets was built. Each process i the process set is a tuple: <(process_id, arrival_time, CPU_time, priority)>. The process arrival was modeled as a Poisso radom process. Hece, the iter-arrival times are Poisso distributed. A process arrival geerator was developed to take care of the radom arrival of differet processes to the system. The geerator produces the iter-arrival times utilizig some specific mea (arrival itesity) of the distributio fuctio. Burst time (i.e. the CPU_time) was geerated usig uiform distributio. Process priority (i.e. priority) was geerated usig expoetial distributio. A process burst time geerator was developed to take care of the radom burst time of differet processes i the system ad also a process priority geerator was developed to take care of the radom priority of differet processes i the system. 4.1 Results obtaied usig uiform distributio to geerate burst time The followig shows the relatioships betwee the CPU schedulig algorithms uder study usig processes geerated by uiform distributio with burst times ragig betwee 1 ad 1ms ad time quatum of 1ms used by First category Figure 6: Graph of Average Waitig Time usig Figure 6 shows the overall graphical result of the Average Waitig Time for all cases of values take. It was observed from the graph that the traditioal algorithm is better tha the proposed algorithm while the proposed algorithm is better tha i terms of miimizig AWT. P13 P13 28
6 Averagr Respose Time Waitig Time Variace Deviatio Average Turaroud Time Number of Cotext Switches Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December Figure 7: Graph of Average Turaroud Time usig Figure 7 shows the overall graphical result of the Average Turaroud Time for all cases of values take. It was observed from the graph that the traditioal algorithm is better tha the proposed algorithm while the proposed algorithm is better tha i terms of miimizig ATAT. Figure 8shows the overall graphical result of the Average Respose Time for all cases of values take. It was observed from the graph that the traditioal algorithm is better tha the proposed algorithm while the proposed algorithm is better tha i some cases i terms of miimizig ART Figure 8: Graph of Average Respose Time usig Figure 9: Graph of Number of Cotext Switches usig Figure 9 shows the overall graphical result of the Number of Cotext Switches for the same processes. It was observed from the graph that the traditioal algorithm ad the proposed algorithm produce the same umber of cotext switches which is better tha that of Figure 1: Graph of Waitig Time Variace Deviatio usig Figure 1 shows the overall graphical result of the Waitig Time Variace Deviatio for the same processes. It was observed from the graph that the traditioal algorithm is better tha the proposed algorithm while the proposed algorithm is better tha i terms of miimizig WTVD. From the results of the two schedulig algorithms ( ad ) compared with the proposed algorithm (the ew ), it has show that the traditioal produced best Average Waitig Time (AWT), Average Turaroud Time (ATAT), Average Respose Time (ART) ad Waitig Time Variace Deviatio (WTVD) compared with the proposed ew. But they both produced the same 29
7 Average Turaroud Time Number of Cotext Swithes Average Waitig Time Averagr Respose Time Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December21 Number of Cotext Switches (NCS). The ew proposed produced better results compared with with respect to Average Waitig Time (AWT), Average Turaroud Time (ATAT), Average Respose Time (ART), Number of Cotext Switches (NCS) ad Waitig Time Variace Deviatio (WTVD) Secod category 1 8 observed from the graph that gives the best average respose time followed by the proposed algorithm ad lastly the traditioal algorithm New_Proir ity 4 2 New_Proirit y Figure 11: Graph of Average Waitig Time usig Figure 11shows the overall graphical result of the Average Waitig Time for all cases of values take. It was observed from the graph that gives the least average waitig time while the proposed algorithm gives a better average waitig time tha the traditioal algorithm New_Proiri ty Figure 12: Graph of Average Turaroud Time usig Figure 12 shows the overall graphical result of the Average Turaroud Time for all cases of values take. It was observed from the graph that gives the least average turaroud time while the proposed algorithm gives a better average turaroud time tha the traditioal algorithm. Figure 13 shows the overall graphical result of the Average Respose Time for all cases of values take. It was Figure 13: Graph of Average Respose Time usig New_Proirit y Figure 14: Graph of Number of Cotext Switches usig Figure 14 shows the overall graphical result of the Number of Cotext Switches for the same processes. It was observed from the graph that the traditioal algorithm ad the proposed algorithm produce the same umber of cotext switches which is better tha that of. Figure 1 shows the overall graphical result of the Waitig Time Variace Deviatio for the same processes. It was observed from the graph that the proposed algorithm is the best algorithm i terms of miimizig waitig time variace deviatio followed by ad the the traditioal algorithm. This shows that processes with low priorities will ot starve i the proposed algorithm. 3
8 Waitig Time Variace Deviatio Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December Figure 1: Graph of Waitig Time Variace Deviatio usig From the results of the two schedulig algorithms ( ad ) compared with the proposed algorithm (the ew ), it has show that the ew proposed priority produced best Average Waitig Time (AWT), Average Turaroud Time (ATAT), Average Respose Time (ART) ad Waitig Time Variace Deviatio (WTVD) compared to the traditioal schedulig algorithm. But they both produced the same Number of Cotext Switches (NCS). The ew proposed algorithm produced better results compared with with respect to Number of Cotext Switches (NCS) ad Waitig Time Variace Deviatio (WTVD). Table 3: Performace of Algorithms Based o Metrics Used i Comparig Them for First Category Performace Metric Traditioal (%) New_Proir ity (%) AWT ATAT ART NCS 2.8 WTVD Table 4: Performace of Algorithms Based o Metrics Used i Comparig Them for Secod Category Performace Traditioal (%) Metric (%) AWT ATAT ART NCS 2.8 WTVD CONCLUSION This paper presets a algorithm that miimized starvatio i priority based CPU schedulig algorithms. This has bee doe by modifyig the optimum priority i Saxea ad Agarwal (212) by itroducig the cocept of EFFICIENCY FACTOR ad applyig it to the priority based CPU schedulig algorithms i order to reduce average waitig time, average turaroud time, average respose time ad waitig time variace deviatio. The priority based CPU schedulig algorithms were grouped ito two groups i.e. the shortest job first ad the priority groups. I each group, the proposed algorithm with the traditioal algorithm i that with were implemeted i Java ad their results were compared based o Average Waitig Time (AWT), Average Turaroud Time (ATAT), Average Respose Time (ART), Number of Cotext Switches (NCS) ad Waitig Time Variace Deviatio (WTVD) for differet categories of processes that were geerated radomly usig either Expoetial, Uiform or Normal distributios to geerate the burst time; Uiform or Expoetial distributios to geerate priority ad Poisso distributio to geerate arrival time of processes. The simulatio results show that with processes geerated usig ragig betwee 1 ad 1, priority usig Expoetial distributio time at a rate of.2, arrival time usig Poisso distributio arrivig at the rate of 3 millisecods per process ad time quatum of 1ms used by. I the category, ad compared with the proposed algorithm (the ew ), it has show that the traditioal produced better AWT, ATAT, ART ad WTVD compared with the proposed ew. But they both produced the same NCS. The ew proposed produced better results compared with with respect to AWT, ATAT, ART, NCS ad WTVD. Ad i the PS category, ad compared with the proposed algorithm (the ew ), it has show that the ew proposed priority produced better AWT, ATAT, ART ad WTVD compared to the traditioal schedulig algorithm. But they both produced the same NCS. The ew proposed algorithm produced better results compared with with respect to NCS ad WTVD. The recommedatio i this work is to implemet the proposed priority algorithm istead of the traditioal priority algorithm, so as to miimize starvatio of processes. I the future, a more efficiet algorithm should be developed to miimize starvatio i Shortest Job First () algorithm. 6 REFERENCES [1] Brich, H. P. (1977). The Architecture of Cocurret Programs. Eglewood Cli s, NJ: Pretice Hall. [2] 8/ode122.html. (.d.). Retrieved May 2, 214, from [3] (.d.). Retrieved Jue 28, 214, from [4] hms/hadout.pdf. (.d.). Retrieved May 2, 214, fromhttps:// gorithms/hadout.pdf. [] Mehdi, N., Mehdi, S., Adel, N., Ad Ali, A. (212). The New Method Of Adaptive Cpu Schedulig Usig Foseca Ad Flemig s Geetic Algorithm. Joural 31
9 Iteratioal Joural of Computer Applicatios ( ) Volume 132 No.11, December21 Of Theoretical Ad Applied Iformatio Techology, [6] Nog, Y., Xuepig, L., Toi, F., ad Xiaoyu, X. (27). Job schedulig methods for reducig waitig time variace. Computers ad Operatios Research, [7] Oyetuji E.O ad Oluleye A. E. (29). Performace Assessmet of Some CPU Schedulig Algorithms. Research Joural of Iformatio Techology, 1 (1), [8] Rakesh, M, Maas, D, Lakshmi, M. P ad Sudhashree. (211). Desig ad Performace Evaluatio of A New Proposed Fittest Job First Dyamic Roud Robi (FJFDRR) Schedulig Algorithm. Iteratioal Joural of Computer Iformatio Systems, 2 (2), [9] Saxea, H. F., ad Agarwal, P. S. (212). Desig ad Performace Evaluatio of Optimum Service Time Cocept for Roud Robi Algorithm. Iteratioal Joural of Machie Learig ad Computig, 2 (2), [1] Silberschatz, P. B. Galvi ad G. Gage. (26). Operatig System Cocepts. (7th, Ed.) Joh Wiley ad Sos Ic. 111 River Street, Hoboke NJ, 73, IJCA TM : 32
Enhancing Cloud Computing Scheduling based on Queuing Models
Ehacig Cloud Computig Schedulig based o Queuig Models Mohamed Eisa Computer Sciece Departmet, Port Said Uiversity, 42526 Port Said, Egypt E. I. Esedimy Computer Sciece Departmet, Masoura Uiversity, Masoura,
More informationTraditional queuing behaviour in routers. Scheduling and queue management. Questions. Scheduling mechanisms. Scheduling [1] Scheduling [2]
Traditioal queuig behaviour i routers Schedulig ad queue maagemet Data trasfer: datagrams: idividual packets o recogitio of flows coectioless: o sigallig Forwardig: based o per-datagram, forwardig table
More informationOperating System Concepts. Operating System Concepts
Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationLecture 28: Data Link Layer
Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig
More informationMulti-Threading. Hyper-, Multi-, and Simultaneous Thread Execution
Multi-Threadig Hyper-, Multi-, ad Simultaeous Thread Executio 1 Performace To Date Icreasig processor performace Pipeliig. Brach predictio. Super-scalar executio. Out-of-order executio. Caches. Hyper-Threadig
More informationChapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings
Operatig Systems: Iterals ad Desig Priciples Chapter 4 Threads Nith Editio By William Stalligs Processes ad Threads Resource Owership Process icludes a virtual address space to hold the process image The
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationAnalysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve
Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationAdministrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today
Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised
More informationA Hierarchical Load Balanced Fault tolerant Grid Scheduling Algorithm with User Satisfaction
A Hierarchical Load Balaced Fault tolerat Grid Schedulig Algorithm with User Satisfactio 1 KEERTHIKA P, 2 SURESH P Assistat Professor (Seior Grade), Departmet o Computer Sciece ad Egieerig Assistat Professor
More informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationSecurity of Bluetooth: An overview of Bluetooth Security
Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Single-Cycle Disadvantages & Advantages
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 4 The Processor Pipeliig Sigle-Cycle Disadvatages & Advatages Clk Uses the clock cycle iefficietly the clock cycle must
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationHeaps. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 201 Heaps 201 Goodrich ad Tamassia xkcd. http://xkcd.com/83/. Tree. Used with permissio uder
More informationSwitching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1
Switchig Hardware Sprig 208 CS 438 Staff, Uiversity of Illiois Where are we? Uderstad Differet ways to move through a etwork (forwardig) Read sigs at each switch (datagram) Follow a kow path (virtual circuit)
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationOutline. CSCI 4730 Operating Systems. Questions. What is an Operating System? Computer System Layers. Computer System Layers
Outlie CSCI 4730 s! What is a s?!! System Compoet Architecture s Overview Questios What is a?! What are the major operatig system compoets?! What are basic computer system orgaizatios?! How do you commuicate
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationAdaptive Graph Partitioning Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, and W. J. Dewar 1 1
Adaptive Graph Partitioig Wireless Protocol S. L. Ng 1, P. M. Geethakumari 1, S. Zhou 2, ad W. J. Dewar 1 1 School of Electrical Egieerig Uiversity of New South Wales, Australia 2 Divisio of Radiophysics
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationAnnouncements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components
Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5
Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More informationChapter 2: Processes & Threads. Chapter 2
: Processes & Threads Processes ad threads Processes Threads Schedulig Iterprocess commuicatio Classical IPC problems (origialy modified by Etha 2 What is a process? Code, data, ad stack Usually (but ot
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationFuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms
Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp
More informationLecture 10 Collision resolution. Collision resolution
Lecture 10 Collisio resolutio Collisio resolutio May applicatios ivolve a iquiry over a shared chael, which ca be ivoked for: discovery of eighborig devices i ad hoc etworks, coutig the umber of RFID tags
More informationChapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS
28 Chapter 3 MATHEMATICAL MODELING OF TOLERANCE ALLOCATION AND OVERVIEW OF EVOLUTIONARY ALGORITHMS Tolerace sythesis deals with the allocatio of tolerace values to various dimesios of idividual compoets
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More informationA MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS
Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationEnhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System
Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September 2014 173 Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System Hoda Baki Departmet of Electrical ad
More informationBAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini
Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationOntology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection
2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,
More informationHADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING
Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is
More informationCMSC Computer Architecture Lecture 10: Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 10: Caches Prof. Yajig Li Uiversity of Chicago Midterm Recap Overview ad fudametal cocepts ISA Uarch Datapath, cotrol Sigle cycle, multi cycle Pipeliig Basic idea,
More informationDeadline Guaranteed Service for Multi-Tenant Cloud Storage
This article has bee accepted for publicatio i a future issue of this joural, but haot bee fully edited. Cotet may chage prior to fial publicatio. Citatio iformatio: DOI.9/TPDS.25.25354, IEEE Deadlie Guarateed
More informationOn Computing the Fuzzy Weighted Average Using the KM Algorithms
O Computig the Fuzzy Weighted Average Usig the KM Algorithms Feilog iu ad Jerry M Medel Sigal ad Image Processig Istitute, Departmet of Electrical Egieerig Uiversity of Souther Califoria, 3740 McClitock
More informationPerformance Analysis of Multiclass FIFO: Motivation, Difficulty and a Network Calculus Approach
Performace Aalysis of Multiclass FIFO: Motivatio, Difficulty ad a Network alculus Approach Yumig Jiag Norwegia Uiversity of Sciece ad Techology (NTNU) 1 19 March 2014, 2d Workshop o Network alculus, Bamberg,
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
More informationNormal Distributions
Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead
More informationEFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS
Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &
More informationCMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 11: More Caches Prof. Yajig Li Uiversity of Chicago Lecture Outlie Caches 2 Review Memory hierarchy Cache basics Locality priciples Spatial ad temporal How to access
More information1&1 Next Level Hosting
1&1 Next Level Hostig Performace Level: Performace that grows with your requiremets Copyright 1&1 Iteret SE 2017 1ad1.com 2 1&1 NEXT LEVEL HOSTING 3 Fast page loadig ad short respose times play importat
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationIntroduction to SWARM Software and Algorithms for Running on Multicore Processors
Itroductio to SWARM Software ad Algorithms for Ruig o Multicore Processors David A. Bader Georgia Istitute of Techology http://www.cc.gatech.edu/~bader Tutorial compiled by Rucheek H. Sagai M.S. Studet,
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationLecture 1: Introduction and Fundamental Concepts 1
Uderstadig Performace Lecture : Fudametal Cocepts ad Performace Aalysis CENG 332 Algorithm Determies umber of operatios executed Programmig laguage, compiler, architecture Determie umber of machie istructios
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationAN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS
Iteratioal Joural of Computer Networks & Commuicatios (IJCNC) Vol.4, No.4, July 01 AN EFFICIENT GROUP KEY MANAGEMENT USING CODE FOR KEY CALCULATION FOR SIMULTANEOUS JOIN/LEAVE: CKCS Melisa Hajyvahabzadeh
More informationGuaranteeing Hard Real Time End-to-End Communications Deadlines
Guarateeig Hard Real Time Ed-to-Ed Commuicatios Deadlies K. W. Tidell A. Burs A. J. Welligs Real Time Systems Research Group Departmet of Computer Sciece Uiversity of York e-mail: ke@mister.york.ac.uk
More informationMaster Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1
Advaced Architectures Master Iformatics Eg. 2017/18 A.J.Proeça Memory Hierarchy (most slides are borrowed) AJProeça, Advaced Architectures, MiEI, UMiho, 2017/18 1 Itroductio Programmers wat ulimited amouts
More information