IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING
|
|
- Colleen Franklin
- 5 years ago
- Views:
Transcription
1 International Jornal of Modern Engineering Research (IJMER) Vol.1, Isse1, pp ISSN: IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING CH SOMESWARA RAO 1, V MNSSVKR GUPTA 2, K.V.S. MURTHY 3, J RAJANIKANTH Department of CSE, S.R.K.R Engg. College, Affiliated to Andhra University, Bhimavaram, W.G.District, Pin , A.P. INDIA Abstract Now a day s Resorce management and tas schedling are very important and complex problems in grid compting environment. It is necessary to predict resorce state to get proper tas schedling. In this paper we propose obect oriented modified ANT algorithm is a new heristic algorithm. The inherent parallelism and scalability mae the modified ANT algorithm very sitable to be sed in grid compting tas schedling, whose strctre is changes dynamically almost all the time. The scalability of proposed algorithm is validating by proposing a simple Grid simlation architectre for resorce management and tas schedling. The algorithm when implemented in simlation environment prodced good reslts in terms of minimal response time; maximm resorce average tilization and tas flfill proportion. Index Terms Grid Compting, Tas Schedling, ANT Algorithm, Modified ANT Algorithm, Resorce Management. I. INTRODUCTION Grids enable the sharing, selection, and aggregation of a wide variety of resorces inclding sper compters, storage systems, data sorces, and specialized devices that are geographically distribted and owned by different organizations for solving large-scale comptational and data intensive problems in science, engineering, and commerce. Grid compting, most simply stated, is distribted compting taen to the next evoltionary level [1,2]. Resorce management and tas schedling are very important and complex problems in grid compting [3]. In grid environment, atonomy resorces are lined throgh internet to form a hge virtal seamless environment. The resorces in the grid are heterogeneos and the strctre of the grid is changing almost all the time. In a grid, some resorces may fail, some new resorces enroll the grid, and some resorces resme to wor. So, it is necessary to do resorce state prediction to get proper tas schedling. Since the static algorithms lie rond robin algorithm, fastest processor-largest tas first algorithm etc, are no longer sitable for the effective tilization of the grid, a good tas schedling method shold be sed which is distribtable, scalable and falt tolerant[4,5]. The aim of this paper is to simlate and analyze a tas schedling algorithm which is based on well nown ant-algorithm. The tas schedling algorithm shold wor better in the grid environment, in which the strctre of the grid changes dynamically almost all the time. It shold redce the total exection time of obs sbmitted to the grid, by effectively schedling the obs on to the appropriate resorces in the grid. It shold also redce the cost of sing the resorces to execte the obs. So, both the total exection time of the obs and the cost of execting the obs shold be taen into consideration in schedling the obs on to the resorces. If the cost of resorces is not a factor modified forms of ant-algorithm, which can frther redce the total exection of the obs. A. ANT ALGORITHM ANT algorithm is a new heristic, predictive schedling algorithm; it is based on the behavior of real ants. When the blind insects, sch as ants loo for food, every moving ant lays some pheromone on the path, then the pheromone on shorter path will be increased qicly, the qantity of pheromone on every path will affect the possibility of other ants to select path. At last all the ants will choose the shortest path. When a resorce enrolls the Grid, ( 0) m p c / s where m is the No. of PEs, p is the MIPS of one PE, c is the size of the parameters, s is the parameter transfer time from resorce to resorce monitor. The pheromone on path from schedle centre to the corresponding resorce will be changed as new old. is the change of pheromone on path from the schedle center to resorce ; ρ is the permanence of pheromone ( 0 < ρ <1 ) 1 - ρ is evaporation of pheromone when tas is assigned to resorce, Manscript received September 4 th, 2011 F. A. Athor is with the SRKR Engineering College, Andhra Pradesh, INDIA S. B. Athor is with the SRKR Engineering College, Andhra Pradesh, INDIA
2 International Jornal of Modern Engineering Research (IJMER) Vol.1, Isse1, pp ISSN: = -, is the compte and transfer qality of the tas. when tas sccessflly retrned from resorce, = Ce x, Ce is the encorage factor. when tas failed retrned from resorce, = Cp x, Cp is the pnish factor. The possibility of tas assignment to every resorce will be recompted as: (t) [ ( t)] [ ( t)] *[ ( t)] = 0 others is the pheromone intensity on the path from schedle center to resorce (t) is the innate performance of the resorce; is the importance of the pheromone; is the importance of resorce innate attribtes; B. Drawbacs of the ANT algorithm The schedler schedles a tas based on the possibilities of the resorces. The problem with this algorithm is, it may schedle a tas to a resorce with low possibility even if the resorces with high possibility are free. Bt this randomness is reqired becase if the tass are always schedled to the resorce with high possibility, then the load on the resorce may be increased and the obs may be ept waiting in the qee for the resorce to be free. It ses centralized schedling scheme. II. RELATED WORD The efficient schedling of independent comptational obs in a heterogeneos compting (HC) environment sch as a comptational grid is clearly important if good se is to be made of a valable resorce. Schedling algorithms can be sed in sch a system for several different reqirements [6]. The first, and most common, is for planning an efficient schedle for some set of obs that are to be rn at some time in the ftre, and to wor ot if sfficient time or comptational resorces are available to complete the rn a priori. Static schedling may also be sefl for analysis of heterogeneos compting systems, to wor ot the effect that losing (or gaining) a particlar piece of hardware, or some sb networ of a grid for example, will have. Static schedling techniqes can also be sed to evalate the performance of a dynamic schedling system after it has rn, to chec how effectively the system is sing the resorces available. The Ant Colony *[ ] Optimization (ACO) meta-heristic was first described in[7] as a techniqe to solve the traveling salesman problem, and was inspired by the ability of real ant colonies to efficiently organize the foraging behavior of the colony sing external chemical pheromone trails as a means of commnication. ACO algorithms have since been widely employed on many other combinatorial optimization problems inclding several domains related to the problem in hand, sch as bin pacing and ob shop schedling, bt ACO has not previosly been applied to finding good ob schedles in an HC environment. Althogh varios classification of tas schedling strategies exist, depending on the type of the grid, the schedler organization and tas schedling strategy has to be chosen sch that the resorces in the grid are effectively tilized. Along with the schedling organization, state estimation is also necessary for the dynamic grid. To achieve maximm resorce tilization and high ob throghpt, re-schedling of the obs on different resorces is also sometimes reqired. Since the static algorithms lie rond robin algorithm, fastest processor-largest tas first algorithm etc, are no longer sitable for the effective tilization of the grid, a good tas schedling method shold be sed which is distribtable, scalable and falt tolerant. In high throghpt compting, the Grid is sed to schedle large nmbers of loosely copled or independent obs, with the goal of ptting nsed processor (resorce) cycles to wor. Bild on the Internet and World Wide Web, the grid has emerged as a new class of infrastrctre. By discovering and obtaining access to remote resorces, the grid can provide scalable, secre, high performance calclating resorces to mae it possible for distribted scientific grops to wor together to share resorces in a large scale and to solve complex scientific problem that never practice in the previos time. In grid, resorces are distribted, heterogeneos, dynamic and instability. Dorigo et.al proposed [8], which is a new heristic algorithm and based on the behavior of real ants. When the blind insects, sch as ants loo for food, the moving ant lays some pheromone on the grond, ths maing the path it followed by a trail of this sbstance. While an isolated ant moves essentially at random, an ant encontering a previosly laid trail can detect it and decide with high probability to follow it, ths reinforcing the trail with its own pheromone. The collective behavior that emerges means where the more the ants are following a trail, the more that trail becomes attractive for being followed. The process is ths characterized by a feedbac loop, where the probability with which an ant chooses an optimm path
3 International Jornal of Modern Engineering Research (IJMER) Vol.1, Isse1, pp ISSN: increases with the nmber of ants that chose the path in the preceding steps. These observations inspired a new type of algorithm called ant algorithms or ant systems. The tas-schedling algorithm shold wor better in the grid environment, in which the strctre of the grid changes dynamically almost all the time. It shold redce the total exection time of obs sbmitted to the grid, by effectively schedling the obs on to the appropriate resorces in the grid. It shold also redce the cost of sing the resorces to execte the obs. So, both the total exection time of the obs and the cost of execting the obs shold be taen into consideration in schedling the obs on to the resorces. If the cost of resorces is not a factor (sitations lie, all the resorces of or interest belong to the same organization), modified forms of ant-algorithm, which can frther redce the total exection of the obs. III. SYSTEM ARCHITECTURE In Grid environment, the client nodes can enroll the Grid at any time, deliver reqests to the schedle center, and monitor the implementation of themselves tass. There are five important modles in the schedle center; the architectre of the schedler center can be expressed as shown in the Fig 1. Each node denotes a client or a Grid resorce, and each edge denotes a lin between nodes. When a grid client delivers a reqest, the grid wors as follows: The client delivers a reqest that contains an application description to the tas receiver. The description is abot the wor load of the application, commnication load, and time limit, etc. The tas receiver qees the tass in priority, and delivers the first tas in the qee to schedling manager. The receiver maintains an nschedled tas qee; record the client name and ser reqirements, application worload, commnication load, and time limit, etc. The schedling manager selects a most appropriate schedling scheme from all schemes according to the resorce graph and ser reqirement, then delivers the scheme to tas dispatcher and inform resorce monitor. This is the most important and complex schedling in the schedle center, there are many schedling strategies can be pt in the schedling manager. We design the ant algorithm based strategy, and will discss it in the following section. Tas dispatcher delivers the tas to the selected resorce, and gives transfer delay and actal tas assignment reslt to the resorce monitor. The dispatcher maintains a schedled tas qee; record the assigned resorce name, application wor load, commnication load, and time limit, etc. When some tas is finished or failed, the dispatcher delete the tas in the qee or pt the tas bac to nschedled tas qee, and notifies the resorce monitor. The resorce monitor maintains the p to date of every resorce and revises the resorce graph. Fig 1 Detailed System Design
4 We se a graphic to express the grid environment, each node denotes a client or a grid resorce (nmber of processors, speed of each processor, I/O bandwidth, RAM capability, and dis capacity, etc.), and each edge denotes a lin between nodes (bandwidth, delay, qantity of pheromone, etc.). A. Improvements to the above said ANT algorithm The algorithm can be modified by sing a threshold to minimize the total processing time. The processing costs of the tass also can be controlled. B. Modified Ant Algorithm When a resorce enrolls the Grid, ( 0) m p c / s where m is the No. of PEs p is the MIPS of one PE c is the size of the parameters s is the parameter transfer time from resorce to resorce monitor. The pheromone on path from schedle centre to the corresponding resorce will be changed as new old. is the change of pheromone on path from the schedle center to resorce ; ρ is the permanence of pheromone ( 0 < ρ <1 ) 1 - ρ is evaporation of pheromone. when tas is assigned to resorce, = -, is the compte and transfer qality of the tas. when tas sccessflly retrned from resorce, = Ce x, Ce is the encorage factor. when tas failed retrned from resorce, = Cp x, Cp is the pnish factor. The possibility of tas assignment to every resorce will be recompted as: (t) [ ( t)] [ ( t)] = 0 others *[ ( t)] (t) is the pheromone intensity on the path from schedle center to resorce (t) is the innate performance of the resorce; is the importance of the pheromone; is the importance of resorce innate attribtes; The schedler finds a resorce on which a new tas is to be schedled at time t with a *[ ] probability eqal to it s corresponding (t) ntil ( (t) h (t) ) T h. where h is the resorce with highest (t). T h is the threshold which will be taen as 1/ (no. of resorces). The schedler finds a resorce i taing one resorce at a time in the ascending order of C i / (MIPS i ) ntil (t) i (t) T i * l where C i is the cost of the resorce i per second MIPS i is the total MIPS of the resorce i T i = Th ( (t) h (t) ) and l is the cost redction factor which is selected by the grid ser who sbmits the tas. 0 l 1. The schedler schedles the new tas on to the resorce i. IV. IMPLEMENTATION In this paper we consider Grid Simlator(GridSim) toolit, which spports modeling and simlation of a wide range of heterogeneos resorces, sch as single or mltiprocessors, shared and distribted memory machines sch as PCs, worstations, SMPs, and clsters managed by time or space-shared schedlers. GridSim can be sed for modeling and simlation of application schedling on varios classes of parallel and distribted compting systems sch as clsters, Grids, and P2P networs. The resorces in clsters are located in a single administrative domain and managed by a single entity whereas, in Grid and P2P systems, resorces are geographically distribted across mltiple administrative domains with their own management policies and goals. The schedlers in clster systems focs on enhancing overall system performance and tility, as they are responsible for the whole system. The GridSim toolit provides a comprehensive facility for simlation of different classes of heterogeneos resorces, sers, applications, resorce broers, and schedlers. It can be sed to simlate application schedlers for single or mltiple administrative domain(s) distribted compting systems sch as clsters and Grids. Application schedlers in Grid environment, called resorce broers, perform resorce discovery, selection, and aggregation of a diverse set of distribted resorces for an individal ser. A. GridSim Entities GridSim spports entities for simlation of single processor and mltiprocessor, heterogeneos resorces that can be configred as time or space shared systems. It allows setting their cloc to
5 different time zones to simlate geographic distribtion of resorces. It spports entities that simlate networs sed for commnication among resorces. The design and implementation isses of GridSim entities are discssed below: i. User Each instance of the User entity represents a Grid ser. Each ser may differ from the rest of the sers with respect to the following characteristics: o Types of ob created e.g., ob exection time, nmber of parametric replications, etc., o Schedling optimization strategy e.g., minimization of cost, time, or both, o Activity rate e.g., how often it creates new ob, o Time zone, and o Absolte deadline and bdget. ii. Broer Each ser is connected to an instance of the Broer entity. Every ob of a ser is first sbmitted to its broer and the broer then schedles the parametric tass according to the ser s schedling policy. Before schedling the tass, the broer dynamically gets a list of available resorces from the global directory entity. Every broer tries to optimize the policy of its ser and therefore, broers are expected to face extreme competition while gaining access to resorces. iii. Resorce Each instance of the Resorce entity represents a Grid resorce. Each resorce may differ from the rest of resorces with respect to the following characteristics: o Nmber of processors; o Cost of processing; o Speed of processing; o Internal process schedling policy e.g., time shared or space shared; o Local load factor; and o Time zone. iv. Grid Information Service It provides resorce registration services and maintains a list of resorces available in the Grid. v. Inpt and Otpt The flow of information among the GridSim entities happen via their Inpt and Otpt entities. Every networed GridSim entity has I/O channels, which are sed for establishing a lin between the entity and its own Inpt and Otpt entities. Graphical ser Interface. We give appropriate data for sorce info, resorce info and ser info, based on the given inpt we have apply the ANT, Rond Rabin, and Modified ANT. Finally Fig 6 shows the Modified ANT algorithm is better in performance wise. Fig 2. Sorce info Fig 3 Resorce Information V. RESULTS Graphical User Interface (GUI) is sed for better sability of the system. In order to facilitate software (class) rese, the GUI is solely implemented in a separate class. Another class is sed for reading data (resorce information) from ser specified resorce file. Resorce information, ser information, and tas information shold be maintained in the
6 threshold vale in the modified ant-algorithm is very important. As a ftre wor, this schedling method can be pt into actal Grid environment for validation to mae QOS schedling. This algorithm can be made more sitable for wide se if pricing factor will also be inclded. The ant algorithm can also be applied to search for optimized path in compter networs. Fig 5 User information Fig 6. Comparison of different schedling algorithms reslts: VI. CONCLUSION AND FUTURE WORK Since the strctre of the grid dynamically changes, there is no particlar schedling algorithm, which can effectively tilize all the resorces in a grid. Bt, the algorithm shold be distribtable, scalable and falt tolerant. It shold also estimate the state of the resorces, which are crrently in the grid. And predictive state estimation is better than non-predictive state estimation becase it ses the crrent state as well as the historical stats of the resorces. So, the static algorithms lie rond robin schedling are no longer sitable. The Ant algorithm is a heristic predictive state estimating schedling algorithm, which is distribtable, scalable, and falt tolerant. The inherent parallelism and scalability mae the algorithm very sitable to be sed in grid compting tas schedling. The modified form of ant-algorithm can be sed if cost of sing the resorces is not a concern. The selection of References [1] Foster I, Kesselman C (eds.). The Grid: Bleprint for a Ftre Compting Infrastrctre. Morgan Kafmann: San Francisco, CA, 1999 [2] Chetty M, Byya R. Weaving comptational Grids: How analogos are they with electrical Grids? Jornal of Compting in Science and Engineering (CiSE) 2001; (Jly Agst). [3] Sinha PK. Distribted Operating Systems: Concepts and Design. IEEE Press: New Yor, NY, [4] Eemecic I, Tartala I, Miltinovic V. A srvey of heterogeneos compting: Concepts and systems. Proceedings of the IEEE 1996; 84(8): [5] Byya R, Abramson D, Giddy J. Nimrod/G: An architectre for a resorce management and schedling system in a global comptational Grid. The 4th International Conference on High Performance Compting in Asia-Pacific Region (HPC Asia 2000), Beiing, China, IEEE Compter Society Press: Los Alamitos, CA, [6] Bran TD, Siegel HJ, Bec N, Boloni LL, Maheswaran M, Rether AI, Robertson JP, Theys MD, Yao B. A taxonomy for describing matching and schedling heristics for mixed-machine heterogeneos compting systems. Proceedings IEEE Worshop on Advances in Parallel and Distribted Systems, October [7] M. Dorigo et L.M. Gambardella, Ant Colony System : A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evoltionary Comptation, volme 1, nméro 1, pages 53-66, 1997 [8] M. Dorigo, V. Maniezzo, et A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics--Part B, volme 26, nméro 1, pages 29-41, 1996.
Isilon InsightIQ. Version 2.5. User Guide
Isilon InsightIQ Version 2.5 User Gide Pblished March, 2014 Copyright 2010-2014 EMC Corporation. All rights reserved. EMC believes the information in this pblication is accrate as of its pblication date.
More informationEMC ViPR. User Guide. Version
EMC ViPR Version 1.1.0 User Gide 302-000-481 01 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is accrate
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationWhat s New in AppSense Management Suite Version 7.0?
What s New in AMS V7.0 What s New in AppSense Management Site Version 7.0? AppSense Management Site Version 7.0 is the latest version of the AppSense prodct range and comprises three prodct components,
More informationPipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,
More informationThe Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment
More informationTdb: A Source-level Debugger for Dynamically Translated Programs
Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Midterm Review Midterm in class on Friday (May 4) Covers material from arch spport to deadlock Based pon lectre material and modles of the book indicated on
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationAn Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna
More informationEMC AppSync. User Guide. Version REV 01
EMC AppSync Version 1.5.0 User Gide 300-999-948 REV 01 Copyright 2012-2013 EMC Corporation. All rights reserved. Pblished in USA. EMC believes the information in this pblication is accrate as of its pblication
More informationFactors Influencing Performance of Firefly and Particle Swarm Optimization Algorithms
Factors Inflencing Performance of Firefly and Particle Swarm Optimization Algorithms Damanjeet Kar, UIET, Panjab University, Chandigarh Abstract In this paper, two natre inspired meta heristic approaches
More informationPavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003
From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information
More informationMaster for Co-Simulation Using FMI
Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany
More informationEMC VNX Series. Problem Resolution Roadmap for VNX with ESRS for VNX and Connect Home. Version VNX1, VNX2 P/N REV. 03
EMC VNX Series Version VNX1, VNX2 Problem Resoltion Roadmap for VNX with ESRS for VNX and Connect Home P/N 300-014-335 REV. 03 Copyright 2012-2014 EMC Corporation. All rights reserved. Pblished in USA.
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationComparison of memory write policies for NoC based Multicore Cache Coherent Systems
Comparison of memory write policies for NoC based Mlticore Cache Coherent Systems Pierre Gironnet de Massas, Frederic Petrot System-Level Synthesis Grop TIMA Laboratory 46, Av Felix Viallet, 38031 Grenoble,
More informationA choice relation framework for supporting category-partition test case generation
Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593
More informationNETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS
ETWORK PRESERVATIO THROUGH A TOPOLOGY COTROL ALGORITHM FOR WIRELESS MESH ETWORKS F. O. Aron, T. O. Olwal, A. Krien, Y. Hamam Tshwane University of Technology, Pretoria, Soth Africa. Dept of the French
More informationSTABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION
STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWOR DYNAMICS FOR STATIC OPTIMIZATION Grsel Serpen and Yifeng X Electrical Engineering and Compter Science Department, The University of Toledo, Toledo, OH
More informationLocal Run Manager. Software Reference Guide for MiSeqDx
Local Rn Manager Software Reference Gide for MiSeqDx Local Rn Manager Overview 3 Dashboard Overview 4 Administrative Settings and Tasks 7 Workflow Overview 12 Technical Assistance 17 Docment # 1000000011880
More informationVirtuOS: an operating system with kernel virtualization
VirtOS: an operating system with kernel virtalization Rslan Nikolaev, Godmar Back SOSP '13 Proceedings of the Twenty-Forth ACM Symposim on Oper ating Systems Principles 이영석, 신현호, 박재완 Index Motivation Design
More informationToday s Lecture. Software Architecture. Lecture 27: Introduction to Software Architecture. Introduction and Background of
Today s Lectre Lectre 27: Introdction to Software Architectre Kenneth M. Anderson Fondations of Software Engineering CSCI 5828 - Spring Semester, 1999 Introdction and Backgrond of Software Architectre
More informationA Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks
Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationUnit Testing with VectorCAST and AUTOSAR
Unit Testing with VectorCAST and AUTOSAR Vector TechDay Software Testing with VectorCAST V1.0 2018-11-15 Agenda Introdction Unit Testing Demo Working with AUTOSAR Generated Code Unit Testing AUTOSAR SWCs
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 8: Threads Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Processes P1 P2 Recall that Bt OS A process
More informationQoS-driven Runtime Adaptation of Service Oriented Architectures
Qo-driven Rntime Adaptation of ervice Oriented Architectres Valeria ardellini 1 Emiliano asalicchio 1 Vincenzo Grassi 1 Francesco Lo Presti 1 Raffaela Mirandola 2 1 Dipartimento di Informatica, istemi
More informationSecure Biometric-Based Authentication for Cloud Computing
Secre Biometric-Based Athentication for Clod Compting Kok-Seng Wong * and Myng Ho Kim School of Compter Science and Engineering, Soongsil University, Sangdo-Dong Dongjak-G, 156-743 Seol Korea {kswong,kmh}@ss.ac.kr
More informationResolving Linkage Anomalies in Extracted Software System Models
Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program
More informationDesigning and Optimization of Heterogeneous OTN/DWDM Networks with Intermediate Grooming
Designing and Optimization of Heterogeneos OTN/DWDM Networks with Intermediate Grooming Afonso Oliveira IST (METI afonso.oliveira@ist.tl.pt ABSTRACT The coexistence of annels with different bitrates in
More informationComputer User s Guide 4.0
Compter User s Gide 4.0 2001 Glenn A. Miller, All rights reserved 2 The SASSI Compter User s Gide 4.0 Table of Contents Chapter 1 Introdction...3 Chapter 2 Installation and Start Up...5 System Reqirements
More informationEMPOWERING SCIENTIFIC DISCOVERY BY DISTRIBUTED DATA MINING ON A GRID INFRASTRUCTURE
EMPOWERING SCIENTIFIC DISCOVERY BY DISTRIBUTED DATA MINING ON A GRID INFRASTRUCTURE A PROPOSAL FOR DOCTORAL RESEARCH by Haimonti Dtta SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE
More informationIllumina LIMS. Software Guide. For Research Use Only. Not for use in diagnostic procedures. Document # June 2017 ILLUMINA PROPRIETARY
Illmina LIMS Software Gide Jne 2017 ILLUMINA PROPRIETARY This docment and its contents are proprietary to Illmina, Inc. and its affiliates ("Illmina"), and are intended solely for the contractal se of
More informationNeighbourhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO
Neighborhood Searches for the Bonded Diameter Minimm Spanning Tree Problem Embedded in a VNS, EA, and ACO Martin Grber Institte for Compter Graphics and Algorithms, Vienna University of Technology, Favoritenstraße
More informationRequirements Engineering. Objectives. System requirements. Types of requirements. FAQS about requirements. Requirements problems
Reqirements Engineering Objectives An introdction to reqirements Gerald Kotonya and Ian Sommerville To introdce the notion of system reqirements and the reqirements process. To explain how reqirements
More informationHistory Slicing: Assisting Code-Evolution Tasks
History Slicing: Assisting Code-Evoltion Tasks Francisco Servant Department of Informatics University of California, Irvine Irvine, CA, U.S.A. 92697-3440 fservant@ics.ci.ed James A. Jones Department of
More informationMillimeter-Wave Multi-Hop Wireless Backhauling for 5G Cellular Networks
2017 IEEE 85th Vehiclar Technology Conference (VTC-Spring) Millimeter-Wave Mlti-Hop Wireless Backhaling for 5G Celllar Networks B. P. S. Sahoo, Chn-Han Yao, and Hng-Y Wei Gradate Institte of Electrical
More informationImage Compression Compression Fundamentals
Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers
More informationCost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks
Cost Based Local Forwarding Transmission Schemes for Two-hop Celllar Networks Zhenggang Zhao, Xming Fang, Yan Long, Xiaopeng H, Ye Zhao Key Lab of Information Coding & Transmission Sothwest Jiaotong University,
More informationIoT-Cloud Service Optimization in Next Generation Smart Environments
1 IoT-Clod Service Optimization in Next Generation Smart Environments Marc Barcelo, Alejandro Correa, Jaime Llorca, Antonia M. Tlino, Jose Lopez Vicario, Antoni Morell Universidad Atonoma de Barcelona,
More informationREDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION
REDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION Jdith Redi, Paolo Gastaldo, Rodolfo Znino, and Ingrid Heyndericx (+) University of Genoa, DIBE, Via Opera Pia a - 645 Genova
More informationTHE Unit Commitment problem (UCP) is the problem of
IEEE TRANS IN POWER SYSTEMS 1 A new MILP-based approach for Unit Commitment in power prodction planning. Ana Viana and João Pedro Pedroso Abstract This paper presents a novel, iterative optimisation algorithm
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationAn Introduction to GPU Computing. Aaron Coutino MFCF
An Introdction to GPU Compting Aaron Cotino acotino@waterloo.ca MFCF What is a GPU? A GPU (Graphical Processing Unit) is a special type of processor that was designed to render and maniplate textres. They
More informationAn Optimization of Granular Network by Evolutionary Methods
An Optimization of Granlar Networ by Evoltionary Methods YUN-HEE HAN, KEUN-CHANG KWAK* Dept. of Control, Instrmentation, and Robot Engineering Chosn University 375 Seos-dong, Dong-g, Gwangj, 50-759 Soth
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationMeasurement Based Intelligent Prefetch and Cache Technique in Web
Measrement ased Intellient Prefetch and Cache Techniqe in Web Zhen Zhao, Jie Yan, Son Wan, Gan Zhan, Yantai Sh Department of Compter Science, Tianin University, Tianin 30007, P.R.China Tel.: +86--7404394,
More informationCAPL Scripting Quickstart
CAPL Scripting Qickstart CAPL (Commnication Access Programming Langage) For CANalyzer and CANoe V1.01 2015-12-03 Agenda Important information before getting started 3 Visal Seqencer (GUI based programming
More informationAccess Professional Edition 2.1
Engineered Soltions Access Professional Edition 2.1 Access Professional Edition 2.1 www.boschsecrity.com Compact access control based on Bosch s innovative AMC controller family Integrated Video Verification
More informationTAKING THE PULSE OF ICT IN HEALTHCARE
ICT TODAY THE OFFICIAL TRADE JOURNAL OF BICSI Janary/Febrary 2016 Volme 37, Nmber 1 TAKING THE PULSE OF ICT IN HEALTHCARE + PLUS + High-Power PoE + Using HDBaseT in AV Design for Schools + Focs on Wireless
More informationVessel Tracking for Retina Images Based on Fuzzy Ant Colony Algorithm
Vessel Tracking for Retina Images Based on Fzzy Ant Colony Algorithm Sina Hooshyar a, Rasol Khayati b and Reza Rezai c a,b,c Department of Biomedical Engineering, Engineering Faclty, Shahed University,
More informationBroadcasting XORs: On the Application of Network Coding in Access Point-to-Multipoint Networks
Broadcasting XORs: On the Application of Network Coding in Access Point-to-Mltipoint Networks The MIT Faclty has made this article openly available Please share how this access benefits yo Yor story matters
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationInteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN:
Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: 1137-3601 revista@aepia.org Asociación Española para la Inteligencia Artificial España Zaballos, Lis J.; Henning, Gabriela
More informationFLARE: Coordinated Rate Adaptation for HTTP Adaptive Streaming in Cellular Networks
FLARE: Coordinated Rate Adaptation for HTTP Adaptive Streaming in Celllar Networks Yongbin Im, Jinyong Han, Ji Hoon Lee, Yoon Kwon, Carlee Joe-Wong, Ted Taekyong Kwon, and Sangtae Ha University of Colorado
More informationTDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction
Review Friday the 2st of October Real world eamples of pipelining? How does pipelining pp inflence instrction latency? How does pipelining inflence instrction throghpt? What are the three types of hazard
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationOn the Existence of Subliminal Channel in Instant Messaging Systems
, pp. 353-362 http://dx.doi.org/10.14257/ijsia.2015.9.3.27 On the Existence of Sbliminal Channel in Instant Messaging Systems Lingyn Xiang 1, Yha Xie 2, Gang Lo 3 and Weizheng Wang 1 1 School of Compter
More informationFunctions of Combinational Logic
CHPTER 6 Fnctions of Combinational Logic CHPTER OUTLINE 6 6 6 6 6 5 6 6 6 7 6 8 6 9 6 6 Half and Fll dders Parallel inary dders Ripple Carry and Look-head Carry dders Comparators Decoders Encoders Code
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationAUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING
AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in
More informationCS 153 Design of Operating Systems
CS 153 Design of Operating Systems Spring 18 Lectre 3: OS model and Architectral Spport Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time/today
More informationInternet Network Management and Policy Recommendations
Internet Network Management and Policy Recommendations Asia-Pacific Telecommnity (APT) UNESCAP Sb-Regional Workshop on Internet Traffic Management for the Asia- Pacific Information Sperhighway, 7-8 December
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationWorkflow Scheduling Using Heuristics Based Ant Colony Optimization
Workflow Scheduling Using Heuristics Based Ant Colony Optimization 1 J.Elayaraja, 2 S.Dhanasekar 1 PG Scholar, Department of CSE, Info Institute of Engineering, Coimbatore, India 2 Assistant Professor,
More information5 Performance Evaluation
5 Performance Evalation his chapter evalates the performance of the compared to the MIP, and FMIP individal performances. We stdy the packet loss and the latency to restore the downstream and pstream of
More informationdss-ip Manual digitalstrom Server-IP Operation & Settings
dss-ip digitalstrom Server-IP Manal Operation & Settings Table of Contents digitalstrom Table of Contents 1 Fnction and Intended Use... 3 1.1 Setting p, Calling p and Operating... 3 1.2 Reqirements...
More informationMaking Full Use of Multi-Core ECUs with AUTOSAR Basic Software Distribution
Making Fll Use of Mlti-Core ECUs with AUTOSAR Basic Software Distribtion Webinar V0.1 2018-09-07 Agenda Motivation for Mlti-Core AUTOSAR Standard: SWC-Split MICROSAR Extension: BSW-Split BSW-Split: Technical
More informationCS 153 Design of Operating Systems Spring 18
CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit
More informationPARTITIONING AND MODULAR CODE SYNTHESIS FOR RECONFIGURABLE MECHATRONIC SOFTWARE COMPONENTS
ARTITIONING AND MODULAR CODE SYNTHESIS FOR RECONFIGURABLE MECHATRONIC SOFTWARE COMONENTS Sven Brmester and Holger Giese Software Engineering Grop University of aderborn Warbrger Str. 00, D-33098 aderborn,
More informationDIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES
DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES Binh-Son Ha 1 Imari Sato 2 Kok-Lim Low 1 1 National University of Singapore 2 National Institte of Informatics, Tokyo, Japan ABSTRACT Dal
More information(2, 4) Tree Example (2, 4) Tree: Insertion
Presentation for se with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 B-Trees and External Memory (2, 4) Trees Each internal node has 2 to 4 children:
More informationAbstract 1 Introduction
Combining Relevance Information in a Synchronos Collaborative Information Retrieval Environment Colm Foley, Alan F. Smeaton and Gareth J. F. Jones Centre for Digital Video Processing and Adaptive Information
More information4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1
.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage 35.e.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline
More informationReview Multicycle: What is Happening. Controlling The Multicycle Design
Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 15: Virtal Address Space Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian OS Abstractions Applications
More informationEMC M&R (Watch4net ) Installation and Configuration Guide. Version 6.4 P/N REV 02
EMC M&R (Watch4net ) Version 6.4 Installation and Configration Gide P/N 302-001-045 REV 02 Copyright 2012-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished September, 2014 EMC believes
More informationChapter 6 Enhancing Performance with. Pipelining. Pipelining. Pipelined vs. Single-Cycle Instruction Execution: the Plan. Pipelining: Keep in Mind
Pipelining hink of sing machines in landry services Chapter 6 nhancing Performance with Pipelining 6 P 7 8 9 A ime ask A B C ot pipelined Assme 3 min. each task wash, dry, fold, store and that separate
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 2: Historical Perspective Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time What is an OS?
More informationSZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization
SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng
More informationCANoe/CANalyzer New Features
CANoe/CANalyzer New Featres Version 11.0 V1.0 2018-04-10 Agenda Release Information General Diagnostics Testing (CANoe only) VT System AMD/XCP (CANoe only) Scope Sensor CAN / CAN FD Ethernet LIN Car2x
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationVerification of Data Location in Cloud Networking
2011 Forth IEEE International Conference on Utility and Clod Compting Verification of Data Location in Clod Networking Thorsten Ries, Volker Fsenig, Christian Vilbois and Thomas Engel Interdisciplinary
More informationCSE 141 Computer Architecture Summer Session I, Lectures 10 Advanced Topics, Memory Hierarchy and Cache. Pramod V. Argade
CSE 141 Compter Architectre Smmer Session I, 2004 Lectres 10 Advanced Topics, emory Hierarchy and Cache Pramod V. Argade CSE141: Introdction to Compter Architectre Instrctor: TA: Pramod V. Argade (p2argade@cs.csd.ed)
More informationDistributed Systems Security. Authentication Practice - 2. Prof. Steve Wilbur
Distribted Systems Secrity Athentication Practice - 2 Prof. Steve Wilbr s.wilbr@cs.cl.ac.k MSc in Data Commnications Networks and Distribted Systems, UCL Lectre Objectives Examine X.509 as a practical
More informationSwitched state-feedback controllers with multi-estimators for MIMO systems
Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November - 6 89 witched state-feedback controllers with mlti-estimators for MIMO sstems LIBOR
More informationLecture 4: Routing. CSE 222A: Computer Communication Networks Alex C. Snoeren. Thanks: Amin Vahdat
Lectre 4: Roting CSE 222A: Compter Commnication Networks Alex C. Snoeren Thanks: Amin Vahdat Lectre 4 Overview Pop qiz Paxon 95 discssion Brief intro to overlay and active networking 2 End-to-End Roting
More informationAccelerating Finite Difference Computations Using General Purpose GPU Computing
OKLAHOMA CITY AIR LOGISTICS COMPLEX TEAM TINKER Accelerating Finite Difference Comptations Using General Prpose GPU Compting Date: 7 Noember 2012 POC: James D. Steens 559 th SMXS/MXDECC Phone: 405-736-4051
More informationLecture 13: Traffic Engineering
Lectre 13: Traffic Engineering CSE 222A: Compter Commnication Networks Alex C. Snoeren Thanks: Mike Freedman, Nick Feamster, and Ming Zhang Lectre 13 Overview Dealing with mltiple paths Mltihoming Entact
More informationCautionary Aspects of Cross Layer Design: Context, Architecture and Interactions
Cationary Aspects of Cross Layer Design: Context, Architectre and Interactions Vikas Kawadia and P. R. Kmar Dept. of Electrical and Compter Engineering, and Coordinated Science Lab University of Illinois,
More informationA personalized search using a semantic distance measure in a graph-based ranking model
Article A personalized search sing a semantic distance measre in a graph-based ranking model Jornal of Information Science XX (X) pp. 1-23 The Athor(s) 2011 Reprints and Permissions: sagepb.co.k/jornalspermissions.nav
More information