Applications and. Developments in Grid, Cloud, and High. Performance Computing REFERENCE. Emmanuel Udoh Sullivan University, USA. Information Science

Size: px
Start display at page:

Download "Applications and. Developments in Grid, Cloud, and High. Performance Computing REFERENCE. Emmanuel Udoh Sullivan University, USA. Information Science"

Transcription

1 Applications and Developments in Grid, Cloud, and High Performance Computing Emmanuel Udoh Sullivan University, USA Information Science REFERENCE

2 Detailed Table of Contents Preface xvii Section 1 Introduction Chapter 1 Risk Assessment for CloudBased IT Systems 1 Yuyu Chou, Berlin Institute of Technology, Germany Jan Oetting, Consileon Business Consultancy GmbH, Germany The use of Cloud Computing services is an attractive option to improve IT systems to achieve rapidly and elastically provisioned capability, and also to offer economic benefits. However, companies see security as a major concern in migrating to the Cloud. To bring clarity in Cloud security, this paper presents a systematic approach to manage the risks and analyzes the full range of risk in Cloud Computing solu tions. Furthermore, as a study case, Google App Engine Platform is assessed based on ISO/IEC and OWASPTop 10 Risk List in this paper. Knowing the risks of Cloud solutions, companies can execute wellinformed decisions on going into the Cloud and build their Cloud solutions in a secure way, relying on a robust etrust relationship. Section 2 Scheduling Chapter 2 A Computational Grid Scheduling Model to Maximize Reliability Using Modified GA 16 ZahidRaza, Jawaharlal Nehru University, India Deo Prakash Vidyarthi, Jawaharlal Nehru University, India This paper presents a grid scheduling model to schedule a job on the grid with the objective of ensuring maximum reliability to the job under the current grid state. The model schedules a modular job to those resources that suit the job requirements in terms of resources while offering the most reliable environ ment. The reliability estimates depict true grid picture and considers the contribution of the computational resources, network links and the application awaiting allocation. The scheduling executes the interac tive jobs while considering the looping structure. As scheduling on the grid is an NP hard problem, soft computing tools are often applied. This paper applies Modified Genetic Algorithm (MGA), which is an elitist selection method based on the two threshold values, to improve the solution. The MGA works on

3 the basis of partitioning the current population in three categories: the fittest chromosomes, average fit chromosomes and the ones with worst fitness. The worst are dropped, while the fittest chromosomes of the current generation are mated with the average fit chromosomes of the previous generation to produce offspring. The simulation results are compared with other similar grid scheduling models to study the performance of the proposed model under various grid conditions. Chapter 3 A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids 36 Ahmed I. Saleh, Mansoura University, Egypt Scheduling is an important issue that must be handled carefully to realize the "Just login to compute" principle introduced by computational grids. Current grid schedulers sufferfrom the haste problem, which is the inability to schedule all tasks successfully. Accordingly, some tasks fail to complete execution as they are allocated to unsuitable workers. Others may not start execution as suitable workers are previ ously allocated to other tasks. This paper introduces the scheduling haste problem and presents a novel high throughput grid scheduler. The proposed scheduler selects the most suitable worker to execute an input grid task. Hence, it minimizes the turnaround time for a set of grid tasks. Moreover, the scheduler is system oriented and avoids the scheduling haste problem. Experimental results show that the proposed scheduler outperforms traditional grid schedulers as it introduces better scheduling efficiency. Chapter 4 Dynamic Dependent Tasks Assignment for Grid Computing 58 Meriem Meddeber, University ofmascara, Algeria Belahbas Yagoubi, University of Oran, Algeria Acomputational grid is a widespread computingenvironmentthatprovides huge computational powerfor largescale distributed applications. One ofthe most important issues in such an environment is resource management. Task assignment as a part of resource management has a considerable effect on the grid middleware performance. In grid computing, task execution time is dependent on the machine to which it is assigned, and task precedence constraints are represented by a directed acyclic graph. This paper proposes a hybrid assignment strategy of dependent tasks in Grids which integrate static and dynamic assignment technologies. Grid computing is considered a set of clusters formed by a set of computing elements and a cluster manager. The main objective is to arrive at a method of task assignment that could achieve minimum response time and reduce the transfer cost, inducing by the tasks transfer respecting the dependency constraints. Section 3 Algorithms and Optimization Chapter 5 An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication 75 Amrit Agrawal, Jaypee University ofinformation Technology, India Pranay Chaudhuri, Jaypee University ofinformation Technology, India Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directedacyclic graphs (DAGs). Scheduling refers to the assignment ofthese parallel tasks on a set of bounded heterogeneous processors

4 connected by high speed networks. Since task assignment is an NPcomplete problem, instead of find ing an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical PathOnaProcessor (CPOP) algorithm. Chapter 6 ACO Based Dynamic Scheduling Algorithm for RealTime Multiprocessor Systems 85 Apurva Shah, GHPatel College ofengg & Tech, India Ketan Kotecha, Nirma University, India The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor realtime systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the results of Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is very efficient in underloaded conditions and it performs very well dur ing overloaded conditions also. Moreover, the proposed algorithm can schedule some typical instances successfully which are not possible to schedule using EDF algorithm. Chapter 7 Performance Analysis of Sequential and Parallel Neural Network Algorithm for Stock Price Forecasting 97 Rashedur M. Rahman, North South University, Bangladesh Ruppa K. Thulasiram, University ofmanitoba, Canada Parimala Thulasiraman, University ofmanitoba, Canada The neural network is popular and used in many areas within the financial field, such as credit authoriza tion screenings, regularities in security price movements, simulations of market behaviour, and so forth. In this research, the authors use a neural network technique for stock price forecasting of Great West Life, an insurance company based in Winnipeg, Canada. The Backpropagation algorithm is a popular algorithm to train a neural network. However, one drawback of traditional Backpropagation algorithm is that it takes a substantial amount of training time. To expedite the training process, the authors design and develop different parallel and multithreaded neural network algorithms. The authors implement parallel neural network algorithms on both shared memory architecture using OpenMP and distributed memory architecture using MPI and analyze the performance of those algorithms. They also compare the results with traditional autoregression model to establish accuracy. Chapter 8 Dynamic Rightsizing with QualityControlled Algorithms in Virtualization Environments 122 MingJeng Yang, Mackay Medical College, Taiwan ChinLin Kao, National Taiwan Normal University, Taiwan YaoMing Yeh, National Taiwan Normal University, Taiwan Virtual ization and partitioning are the means by which multiple application instances can share and run multiple virtual machines supported by a platform. In a Green Cloud environment, the goal is consolidate multiple applications onto virtual machines associated by fewer servers, and reduce cost to

5 Mahabad, Saghez, and complexity, increase agility, and lower power and cooling costs. To make Cloud center greener, it is beneficial to limit the amount of active servers to minimize energy consumption. This paper presents a precise model to formulate the rightsizing and energysaving mechanism, which not only minimizes energy consumption of the server but also maintains a service quality through the Mt/M/Vt strategy of queuing theory. The authors map the complicated formula of the energysaving mechanism to an ap proximation equation and design the fast decidable algorithms for calculating the right size of virtual machines in constant time complexity for power management systems. Chapter 9 Location Update Improvement Using Fuzzy Logic Optimization in Location Based Routing Protocols in MANET Amjad Osmani, Islamic Azad University Iran Abolfazl Toroghi Haghighat, Islamic Azad University Qazvin, Iran Shirin Khezri, Islamic Azad University Iran Several positionbased routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides the network. This paper introduces a new schema in management of mobile nodes location in mobile ad hoc networks. Fuzzy logic optimization is applied to a better management of location update operation in hierarchical location services. Update management overhead is decreased without significant loss of query success probability. Onehopchaintechnique is used for Auto compensation. A new composed method can update mobile nodes location when the nodes cross a grid boundary. The proposed method 138 location information on the nodes in uses a dynamic grid area that solves the pingpong problem between grids. Simulation results show that these methods are effective. The algorithms are distributed and can keep scalability in the scenario of increasing nodes density. The described solutions are not limited to a special network grid ordering, and can be used in every hierarchical ordering like GLS if the ordering can be mappable on these methods. Chapter 10 Performance Evaluation of Reactive Routing in Mobile Grid Environment 159 L. Shrivastava, Madhav Institute of Technology and Science, Gwalior, India G. S. Tomar, Machine Intelligence Research Labs, India S. S. Bhadanria, Madhav Institute oftechnology and Science, India Grid computing came into existence as a manner of sharing heavy computational loads among multiple computers to be able to compute highly complex mathematical problems. The grid topology is highly flexible and easily scalable, allowing users to join and leave the grid without the hassle of time and resourcehungry identification procedures, having to adjust their devices or install additional software. The goal of grid computing is described as "to provide flexible, secure and coordinated resource sharing among dynamic collections of individuals, institutions and resources". AODV is an ondemand (reac tive) algorithm capable of both unicast and multicast routing. In this paper, AODV has been modified by varying some of the configuration parameters used in this algorithm to improve its performance. This modified protocol i.e. AAODV (advanced ad hoc on demand distance vector) has been compared with AODV in grid environment. The simulations have shown that AAODV is able to achieve high throughput and packet delivery ratio and average endtoend delay is reduced.

6 Universite Universite Saghez, Chapter 11 An Intelligent Sensor Placement Method to Reach a High Coverage in Wireless Sensor Networks 168 Shirin Khezri, Islamic Azad University Mahabad, Iran Karim Faez, Amirkabir University of Technology, Iran Amjad Osmani, Islamic Azad University Iran Adequate coverage is one of the main problems for Sensor Networks. The effectiveness of distributed wireless sensor networks highly depends on the sensor deployment scheme. Optimizing the sensor deployment provides sufficient sensor coverage and saves cost of sensors for locating in grid points. This article applies the modified binary particle swarm optimization algorithm for solving the sensor placement in distributed sensor networks. PSO is an inherent continuous algorithm, and the discrete PSO is proposed to be adapted to discrete binary space. In the distributed sensor networks, the sensor placement is an NPcomplete problem for arbitrary sensor fields. One of the most important issues in the research fields, the proposed algorithms will solve this problem by considering two factors: the complete coverage and the minimum costs. The proposed method on sensors surrounding is examined in different area. The results not only confirm the successes of using the new method in sensor place ment, also they show that the new method is more efficiently compared to other methods like Simulated Annealing(SA), PBIL and LAEDA. Section 4 High Performance Computing Chapter 12 High Performance Computing Design by Code Migration for Distributed Desktop Computing Grids 185 Makoto Yoshida, Okayama University ofscience, Japan Kazumine Kojima, Okayama University ofscience, Japan Large scale loosely coupled PCs can organize clusters and form desktop computing grids on sharing each processing power; power of PCs, transaction distributions, network scales, network delays, and code migration algorithms characterize the performance of the computing grids. This article describes the design methodologies ofworkload management in distributed desktop computing grids. Based on the code migration experiments, transfer policy for computation was determined and several simulations for location policies were examined, and the design methodologies for distributed desktop computing grids are derived from the simulation results. The language for distributed desktop computing is designed to accomplish the design methodologies. Chapter 13 Parallelization of LittlewoodRichardson Coefficients Computation and its Integration into the BonjourGrid MetaDesktop Grid Middleware 204 Heithem Abbes, University of Tunis, Franck Butelle, LIPN/UMR 7030 Christophe Cerin, LIPN/UMR 7030 Tunisia Paris 13, France Paris 13, France This paper shows how to parallelize a compute intensive application in mathematics (Group Theory) for an institutional Desktop Grid platform coordinated by a metagrid middleware named BonjourGrid. The paper is twofold: it shows how to parallelize a sequential program for a multicore CPU which partici

7 pates in the computation; and it demonstrates the effort for launching multiple instances of the solutions for the mathematical problem with the BonjourGrid middleware. BonjourGrid is a fully decentralized Desktop Grid middleware. The main results of the paper are: a) an efficient multithreaded version of a sequential program to compute LittlewoodRichardson coefficients, namely the MultiLR program and b) a proofof concept, centered around the user needs, for the BonjourGrid middleware dedicated to coordinate multiple instances ofprogramsfor Desktop Grids and with the help of MultiLR. In this paper, the scientific work consists in starting from a model for the solution of a compute intensive problem in mathematics, to incorporate the concrete model into a middleware and running it on commodity PCs platform managed by an innovative meta Desktop Grid middleware. Chapter 14 Structural Outlooks for the OTISArrangement Network 221 AhmadAwwad, Fahad Bin Sultan University, Saudi Arabia JehadAiSadi, Arab Open University, Jordan Bassam Haddad, University ofpetra, Jordan Ahmad Kayed, Fahad Bin Sultan University, Saudi Arabia Recent studies have revealed that the Optical Transpose Interconnection Systems (OTIS) are promising candidates for future highperformance parallel computers. This paper presents and evaluates a general method for algorithm development on the OTISArrangement network (OTISAN) as an exampleofotis network. The proposed method can be used and customized for any other OTIS network. Furthermore, it allows efficient mapping of a wide class of algorithms into the OTISAN. This method is based on grids and pipelines as popular structures that support a vast body of parallel applications including linear algebra, divideandconquer types of algorithms, sorting, and FFT computation. This study confirms the viability of the OTISAN as an attractive alternative for largescale parallel architectures. Chapter 15 Energy Efficient Packet Data Service in Wireless Sensor Network in Presence of Rayleigh Fading 232 Amah Nandi, National Institute of Technology Durgapur, India Sumit Kimdu, National Institute of Technology Durgapur, India Energy level performances of three packet delivery schemes in Wireless Sensor Networks (WSN) are evaluated in presence of Rayleigh fading. Three different information delivery mechanisms are investigated using regenerative relays with or without error correction capability. Energy consumption for successful delivery of a data packet for each mechanism is evaluated and compared under several conditions of node density, bit rate, transmit power, and channel fading. Energy efficiencies of different retransmission schemes are also evaluated. Further, an optimal packet length based on energy efficiency is derived. Impact of optimal packet size on average number of retransmission and total energy expen diture is analyzed for each delivery scheme. Chapter 16 Cost Efficient Implementation of Multistage Symmetric Repackable Networks 246 Amitabha Chababarly, Dublin City University, Ireland Martin Collier, Dublin City University, Ireland Symmetric rearrangeable networks (SRN)(Chakrabarty, Collier, & Mukhopadhyay, 2009) make efficient use of hardware, but they have the disadvantage of momentarily disrupting the existing communications during reconfiguration. Path continuity is a major issue in some application of rearrangeable networks.

8 Using repackable networks (Yanga, Su, & Pin, 2008) is a solution to the path continuity problem in SRN. These networks provide functionality comparable to that of strict sense no blocking networks (SNB) but with minimum increase in the hardware than SRN. This paper proposes an efficient implementa tion of multistage symmetric repackable networks requiring optimum hardware cost than the method proposed in the literature. Cost optimization is achieved through the use of minimum number of bypass link(s). Investigated method works for networks built with more than three switching stages and shows promise of scalability. Chapter 17 Using Machine Learning Techniques for Performance Prediction on MultiCores 259 Jitendra Kumar Rai, ANURAG, Hyderabad, India Atul Negi, University of Hyderabad, India Rajeev Wankar, University ofhyderabad, India Sharing of resources by the cores of multicore processors brings performance issues for the system. Majority of the shared resources belong to memory hierarchy subsystem of the processors such as last level caches, prefetches and memory buses. Programs corunning on the cores of a multicore processor may interfere with each other due to usage of such shared resources. Such interference causes corunn ing programs to suffer with performance degradation. Previous research works include efforts to character ize and classify the memory behaviors of programs to predict the performance. Such knowledge could be useful to create workloads to perform performance studies on multicore processors. It could also be utilized to form policies at system level to mitigate the interference between corunning programs due to use of shared resources. In this work, machine learning techniques are used to predict the performance on multicore processors. The main contribution of the study is enumeration of solorun program attributes, which can be used to predict concurrentrun performance despite change in the number of corunning programs sharing the resources. The concurrentrun involves the interference between corunning pro grams due to use of shared resources. Chapter 18 Performance Evaluation of Full Diversity QOSTBC MIMO Systems with Multiple Receive Antenna Hardip K. Shah, Dharmsinh Desai University, India Tejal N. Parmar, Dharmsinh Desai University, India Nikhil Kothari, Dharmsinh Desai University, India 274 K. S. Dasgupta, Indian Institute of Space Science and Technology, India Multipath fading is inherent in wireless communication systems. Diversity is the technique which takes advantage of multipath to mitigate the effect of fading and increase signal strength. Space Time Block codes (STBC) are used in MIMO systems to improve the performance by maximizing transmit and/or receive diversity. Among different schemes based on STBC, Quasi Orthogonal Space Time Block Code (QOSTBC) is able to achieve full rate transmission for more than two transmit antennas. Constellation Rotation QOSTBC (CRQOSTBC) achieves full diversity and improves performance further along with full rate, to overcome the limitation of QOSTBC, which is unable to maintain orthogonality amongst the codes transmitted by different antennas. Higher diversity can be achieved by increasing uncorrelated paths between transmitter and receivers using higher number of receive antennas. This paper examines improvement in BER with reference to a number ofreceive antennas. Simulations were carried out under ideal as well as realistic environments, using least square technique with four antennas at transmitter side and variable receive antennas. Results of simulations presented in this paper indicate performance improvement of CRQOSTBC over QOSTBC in flat fading channel environment. Simulation results also show performance degradation in BER when channel is estimated at the receiver.

9 Section 5 Applications Chapter 19 On Construction of Cluster and Grid Computing Platforms for Parallel Bioinformatics Applications 286 ChaoTiing Yang, Timghai University, WenChung Shih, Asia University, Taiwan Taiwan Biology databases are diverse and massive. As a result, researchers must compare each sequence with vast numbers of other sequences. Comparison, whether of structural features or protein sequences, is vital in bioinformatics. These activities require highspeed, highperformance computing powerto search through and analyze large amounts of data and industrialstrength databases to perform a range of dataintensive computing functions. Grid computing and Cluster computing meet these requirements. Biological data exist in various web services that help biologists search for and extract useful information. The data formats produced are heterogeneous and powerful tools are needed to handle the complex and difficult task of integrating the data. This paper presents a review of the technologies and an approach to solve this problem using cluster and grid computing technologies. The authors implement an experimental distributed computing application for bioinformatics, consisting of basic highperformance computing environments (Grid and PC Cluster systems), multiple interfaces at user portals that provide useful graphical interfaces to enable biologists to benefit directly from the use of highperformance technology, and a translation tool for converting biology data into XML format. Chapter 20 Migrating Android Applications to the Cloud 307 ShihHao Hung, National Taiwan University, Taiwan JengPeng Shieh, National Taiwan University, Taiwan ChenPang Lee, National Taiwan University, Taiwan Recently, smartphone technologies have evolved quickly and offered end users the computing power and networking capabilities required to perform useful network and multimedia applications. However, due to limited physical sizes and battery capacities, the current generation of smartphones cannot yet fulfill the requirements of sophisticated applications ofwhich personal computers are capable. One way to solve this problem is to minimize the workload on a smartphone as much as possible by offloading portions of an application to a server. The solution is particularly attractive today as cloud computing provides the needed server resources at relatively low costs. This paper proposes a novel, lightweight application migration mechanism for the users of smartphones to suspend the execution of applications and offload them to the cloud. The authors also developed a framework to perform Android applications efficiently with virtual phones in the cloud with a virtual storage. This paper discusses the migration mechanism and evaluates its effectiveness on the Android smartphone. This approach may effectively offload workload for Android applications even with lowspeed mobile network.

10 Chapter 21 A Grid and Cloud Based System for Data Grouping Computation and Online Service 323 WingNingLi, University ofarkansas, USA Donald Hayes, University ofarkansas, USA, Jonathan Bar an, University ofarkansas, USA Cameron Porter, Acxiom Corporation, USA Tom Schweiger, Acxiom Corporation, USA Record linkage deals with finding records that identify the same real world entity, such as an individual or a business, from a given file or set of files. Record linkage problem is also referred to as the entity resolution or record recognition problem. To locate those records identifying the same real world entity, in principle, pairwise record analyses have to be performed among all records. Analytical operations between two records vary from comparing correspondingfields to enhancing records through large knowl edge bases and querying large databases. Hence, these operations are complex and take time. To reduce the number of pairwise record comparisons, blocking techniques are introduced to partition the records into blocks. After that records in each block are analyzed against one and another. One of the effective blocking methods is the closure approach, where a "related" equivalence relation is used to partition the records into equivalence classes. This paper introduces the closure problem and describes the design and implementation ofa parallel and distributed closure prototype system running in an enterprise grid. Compilation of References 337 About the Contributors 362 Index 368

Comparison of WCA with AODV and WCA with ACO using clustering algorithm

Comparison of WCA with AODV and WCA with ACO using clustering algorithm Comparison of WCA with AODV and WCA with ACO using clustering algorithm Deepthi Hudedagaddi, Pallavi Ravishankar, Rakesh T M, Shashikanth Dengi ABSTRACT The rapidly changing topology of Mobile Ad hoc networks

More information

White Paper. Requirements of Network Virtualization

White Paper. Requirements of Network Virtualization White Paper on Requirements of Network Virtualization INDEX 1. Introduction 2. Architecture of Network Virtualization 3. Requirements for Network virtualization 3.1. Isolation 3.2. Network abstraction

More information

Advanced Core Operating System (ACOS): Experience the Performance

Advanced Core Operating System (ACOS): Experience the Performance WHITE PAPER Advanced Core Operating System (ACOS): Experience the Performance Table of Contents Trends Affecting Application Networking...3 The Era of Multicore...3 Multicore System Design Challenges...3

More information

A Survey on Load Balancing Techniques Using ACO Algorithm

A Survey on Load Balancing Techniques Using ACO Algorithm A Survey on Load Balancing Techniques Using ACO Algorithm Preeti Kushwah Department of Computer Science & Engineering, Acropolis Institute of Technology and Research Indore bypass road Mangliya square

More information

CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS

CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of

More information

CHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs

CHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs CHAPTER 6 VOICE COMMUNICATION OVER HYBRID MANETs Multimedia real-time session services such as voice and videoconferencing with Quality of Service support is challenging task on Mobile Ad hoc Network (MANETs).

More information

CHAPTER 1 INTRODUCTION

CHAPTER 1 INTRODUCTION 21 CHAPTER 1 INTRODUCTION 1.1 PREAMBLE Wireless ad-hoc network is an autonomous system of wireless nodes connected by wireless links. Wireless ad-hoc network provides a communication over the shared wireless

More information

Architecture of distributed network processors: specifics of application in information security systems

Architecture of distributed network processors: specifics of application in information security systems Architecture of distributed network processors: specifics of application in information security systems V.Zaborovsky, Politechnical University, Sait-Petersburg, Russia vlad@neva.ru 1. Introduction Modern

More information

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility

More information

CHAPTER 1 INTRODUCTION

CHAPTER 1 INTRODUCTION 1 CHAPTER 1 INTRODUCTION 1.1 MOTIVATION OF RESEARCH Multicore processors have two or more execution cores (processors) implemented on a single chip having their own set of execution and architectural recourses.

More information

International Journal of Advancements in Research & Technology, Volume 3, Issue 4, April-2014 55 ISSN 2278-7763

International Journal of Advancements in Research & Technology, Volume 3, Issue 4, April-2014 55 ISSN 2278-7763 International Journal of Advancements in Research & Technology, Volume 3, Issue 4, April-2014 55 Management of Wireless sensor networks using cloud technology Dipankar Mishra, Department of Electronics,

More information

CHAPTER Motivation

CHAPTER Motivation CHAPTER 2 PROBLEM STATEMENT AND OBJECTIVES 2.1 Motivation There is an ever-growing need for data transfer on move.this drives an urgent need to resolve heavy overhead consumption in routing issues. The

More information

Cluster, Grid, Cloud Concepts

Cluster, Grid, Cloud Concepts Cluster, Grid, Cloud Concepts Kalaiselvan.K Contents Section 1: Cluster Section 2: Grid Section 3: Cloud Cluster An Overview Need for a Cluster Cluster categorizations A computer cluster is a group of

More information

Fair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing

Fair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing Research Inventy: International Journal Of Engineering And Science Vol.2, Issue 10 (April 2013), Pp 53-57 Issn(e): 2278-4721, Issn(p):2319-6483, Www.Researchinventy.Com Fair Scheduling Algorithm with Dynamic

More information

Testing & Assuring Mobile End User Experience Before Production. Neotys

Testing & Assuring Mobile End User Experience Before Production. Neotys Testing & Assuring Mobile End User Experience Before Production Neotys Agenda Introduction The challenges Best practices NeoLoad mobile capabilities Mobile devices are used more and more At Home In 2014,

More information

MEng, BSc Applied Computer Science

MEng, BSc Applied Computer Science School of Computing FACULTY OF ENGINEERING MEng, BSc Applied Computer Science Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give a machine instructions

More information

CHAPTER 4: SOFTWARE PART OF RTOS, THE SCHEDULER

CHAPTER 4: SOFTWARE PART OF RTOS, THE SCHEDULER CHAPTER 4: SOFTWARE PART OF RTOS, THE SCHEDULER To provide the transparency of the system the user space is implemented in software as Scheduler. Given the sketch of the architecture, a low overhead scheduler

More information

Reconfigurable Architecture Requirements for Co-Designed Virtual Machines

Reconfigurable Architecture Requirements for Co-Designed Virtual Machines Reconfigurable Architecture Requirements for Co-Designed Virtual Machines Kenneth B. Kent University of New Brunswick Faculty of Computer Science Fredericton, New Brunswick, Canada ken@unb.ca Micaela Serra

More information

COMPUTATIONIMPROVEMENTOFSTOCKMARKETDECISIONMAKING MODELTHROUGHTHEAPPLICATIONOFGRID. Jovita Nenortaitė

COMPUTATIONIMPROVEMENTOFSTOCKMARKETDECISIONMAKING MODELTHROUGHTHEAPPLICATIONOFGRID. Jovita Nenortaitė ISSN 1392 124X INFORMATION TECHNOLOGY AND CONTROL, 2005, Vol.34, No.3 COMPUTATIONIMPROVEMENTOFSTOCKMARKETDECISIONMAKING MODELTHROUGHTHEAPPLICATIONOFGRID Jovita Nenortaitė InformaticsDepartment,VilniusUniversityKaunasFacultyofHumanities

More information

CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM

CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,

More information

Scalability and Classifications

Scalability and Classifications Scalability and Classifications 1 Types of Parallel Computers MIMD and SIMD classifications shared and distributed memory multicomputers distributed shared memory computers 2 Network Topologies static

More information

Energy Constrained Resource Scheduling for Cloud Environment

Energy Constrained Resource Scheduling for Cloud Environment Energy Constrained Resource Scheduling for Cloud Environment 1 R.Selvi, 2 S.Russia, 3 V.K.Anitha 1 2 nd Year M.E.(Software Engineering), 2 Assistant Professor Department of IT KSR Institute for Engineering

More information

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS

PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS Reza Azizi Engineering Department, Bojnourd Branch, Islamic Azad University, Bojnourd, Iran reza.azizi@bojnourdiau.ac.ir

More information

can you effectively plan for the migration and management of systems and applications on Vblock Platforms?

can you effectively plan for the migration and management of systems and applications on Vblock Platforms? SOLUTION BRIEF CA Capacity Management and Reporting Suite for Vblock Platforms can you effectively plan for the migration and management of systems and applications on Vblock Platforms? agility made possible

More information

A Novel Switch Mechanism for Load Balancing in Public Cloud

A Novel Switch Mechanism for Load Balancing in Public Cloud International OPEN ACCESS Journal Of Modern Engineering Research (IJMER) A Novel Switch Mechanism for Load Balancing in Public Cloud Kalathoti Rambabu 1, M. Chandra Sekhar 2 1 M. Tech (CSE), MVR College

More information

Journal of Theoretical and Applied Information Technology 20 th July 2015. Vol.77. No.2 2005-2015 JATIT & LLS. All rights reserved.

Journal of Theoretical and Applied Information Technology 20 th July 2015. Vol.77. No.2 2005-2015 JATIT & LLS. All rights reserved. EFFICIENT LOAD BALANCING USING ANT COLONY OPTIMIZATION MOHAMMAD H. NADIMI-SHAHRAKI, ELNAZ SHAFIGH FARD, FARAMARZ SAFI Department of Computer Engineering, Najafabad branch, Islamic Azad University, Najafabad,

More information

Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications

Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications Performance Prediction, Sizing and Capacity Planning for Distributed E-Commerce Applications by Samuel D. Kounev (skounev@ito.tu-darmstadt.de) Information Technology Transfer Office Abstract Modern e-commerce

More information

Introducing the Singlechip Cloud Computer

Introducing the Singlechip Cloud Computer Introducing the Singlechip Cloud Computer Exploring the Future of Many-core Processors White Paper Intel Labs Jim Held Intel Fellow, Intel Labs Director, Tera-scale Computing Research Sean Koehl Technology

More information

14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)

14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,

More information

Study of Various Load Balancing Techniques in Cloud Environment- A Review

Study of Various Load Balancing Techniques in Cloud Environment- A Review International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-04 E-ISSN: 2347-2693 Study of Various Load Balancing Techniques in Cloud Environment- A Review Rajdeep

More information

Research on the Performance Optimization of Hadoop in Big Data Environment

Research on the Performance Optimization of Hadoop in Big Data Environment Vol.8, No.5 (015), pp.93-304 http://dx.doi.org/10.1457/idta.015.8.5.6 Research on the Performance Optimization of Hadoop in Big Data Environment Jia Min-Zheng Department of Information Engineering, Beiing

More information

LOAD BALANCING IN CLOUD COMPUTING

LOAD BALANCING IN CLOUD COMPUTING LOAD BALANCING IN CLOUD COMPUTING Neethu M.S 1 PG Student, Dept. of Computer Science and Engineering, LBSITW (India) ABSTRACT Cloud computing is emerging as a new paradigm for manipulating, configuring,

More information

Log-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network

Log-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network Recent Advances in Electrical Engineering and Electronic Devices Log-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network Ahmed El-Mahdy and Ahmed Walid Faculty of Information Engineering

More information

Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization

Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization Study And Comparison Of Mobile Ad-Hoc Networks Using Ant Colony Optimization 1 Neha Ujala Tirkey, 2 Navendu Nitin, 3 Neelesh Agrawal, 4 Arvind Kumar Jaiswal 1 M. Tech student, 2&3 Assistant Professor,

More information

OPNET Network Simulator

OPNET Network Simulator Simulations and Tools for Telecommunications 521365S: OPNET Network Simulator Jarmo Prokkola Research team leader, M. Sc. (Tech.) VTT Technical Research Centre of Finland Kaitoväylä 1, Oulu P.O. Box 1100,

More information

Advanced Computer Networks

Advanced Computer Networks Introduction to Mobile Ad hoc Networks (MANETs) Advanced Computer Networks Outline Ad hoc networks Differences to other networks Applications Research areas Routing Other research areas Enabling Technologies

More information

International Journal of Emerging Technology & Research

International Journal of Emerging Technology & Research International Journal of Emerging Technology & Research A Study Based on the Survey of Optimized Dynamic Resource Allocation Techniques in Cloud Computing Sharvari J N 1, Jyothi S 2, Neetha Natesh 3 1,

More information

Mobile Cloud Computing Challenges

Mobile Cloud Computing Challenges Mobile Cloud Computing Challenges by Kyung Mun - Tuesday, September 21, 2010 http://www2.alcatel-lucent.com/techzine/mobile-cloud-computing-challenges/ Application usage on mobile devices has exploded

More information

A Bi-Objective Approach for Cloud Computing Systems

A Bi-Objective Approach for Cloud Computing Systems A Bi-Objective Approach for Cloud Computing Systems N.Geethanjali 1, M.Ramya 2 Assistant Professor, Department of Computer Science, Christ The King Engineering College 1, 2 ABSTRACT: There are Various

More information

GEDAE TM - A Graphical Programming and Autocode Generation Tool for Signal Processor Applications

GEDAE TM - A Graphical Programming and Autocode Generation Tool for Signal Processor Applications GEDAE TM - A Graphical Programming and Autocode Generation Tool for Signal Processor Applications Harris Z. Zebrowitz Lockheed Martin Advanced Technology Laboratories 1 Federal Street Camden, NJ 08102

More information

SCHEDULING IN CLOUD COMPUTING

SCHEDULING IN CLOUD COMPUTING SCHEDULING IN CLOUD COMPUTING Lipsa Tripathy, Rasmi Ranjan Patra CSA,CPGS,OUAT,Bhubaneswar,Odisha Abstract Cloud computing is an emerging technology. It process huge amount of data so scheduling mechanism

More information

Grid Computing Vs. Cloud Computing

Grid Computing Vs. Cloud Computing International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 6 (2013), pp. 577-582 International Research Publications House http://www. irphouse.com /ijict.htm Grid

More information

solution brief September 2011 Can You Effectively Plan For The Migration And Management of Systems And Applications on Vblock Platforms?

solution brief September 2011 Can You Effectively Plan For The Migration And Management of Systems And Applications on Vblock Platforms? solution brief September 2011 Can You Effectively Plan For The Migration And Management of Systems And Applications on Vblock Platforms? CA Capacity Management and Reporting Suite for Vblock Platforms

More information

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc (International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com

More information

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) 305 REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) (See also General Regulations) Any publication based on work approved for a higher degree should contain a reference

More information

Relational Databases in the Cloud

Relational Databases in the Cloud Contact Information: February 2011 zimory scale White Paper Relational Databases in the Cloud Target audience CIO/CTOs/Architects with medium to large IT installations looking to reduce IT costs by creating

More information

A NOVEL RESOURCE EFFICIENT DMMS APPROACH

A NOVEL RESOURCE EFFICIENT DMMS APPROACH A NOVEL RESOURCE EFFICIENT DMMS APPROACH FOR NETWORK MONITORING AND CONTROLLING FUNCTIONS Golam R. Khan 1, Sharmistha Khan 2, Dhadesugoor R. Vaman 3, and Suxia Cui 4 Department of Electrical and Computer

More information

A Novel Approach for Efficient Load Balancing in Cloud Computing Environment by Using Partitioning

A Novel Approach for Efficient Load Balancing in Cloud Computing Environment by Using Partitioning A Novel Approach for Efficient Load Balancing in Cloud Computing Environment by Using Partitioning 1 P. Vijay Kumar, 2 R. Suresh 1 M.Tech 2 nd Year, Department of CSE, CREC Tirupati, AP, India 2 Professor

More information

Technology White Paper Capacity Constrained Smart Grid Design

Technology White Paper Capacity Constrained Smart Grid Design Capacity Constrained Smart Grid Design Smart Devices Smart Networks Smart Planning EDX Wireless Tel: +1-541-345-0019 I Fax: +1-541-345-8145 I info@edx.com I www.edx.com Mark Chapman and Greg Leon EDX Wireless

More information

Propsim enabled Mobile Ad-hoc Network Testing

Propsim enabled Mobile Ad-hoc Network Testing www.anite.com Propsim enabled Mobile Ad-hoc Network Testing Anite is now part of Keysight Technologies Lab-based, end-to-end performance testing of systems using Propsim MANET channel emulation A Mobile

More information

LOAD BALANCING TECHNIQUES

LOAD BALANCING TECHNIQUES LOAD BALANCING TECHNIQUES Two imporatnt characteristics of distributed systems are resource multiplicity and system transparency. In a distributed system we have a number of resources interconnected by

More information

MEng, BSc Computer Science with Artificial Intelligence

MEng, BSc Computer Science with Artificial Intelligence School of Computing FACULTY OF ENGINEERING MEng, BSc Computer Science with Artificial Intelligence Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give

More information

Implementing Web-Based Computing Services To Improve Performance And Assist Telemedicine Database Management System

Implementing Web-Based Computing Services To Improve Performance And Assist Telemedicine Database Management System Implementing Web-Based Computing Services To Improve Performance And Assist Telemedicine Database Management System D. A. Vidhate 1, Ige Pranita 2, Kothari Pooja 3, Kshatriya Pooja 4 (Information Technology,

More information

A Comparative Study of cloud and mcloud Computing

A Comparative Study of cloud and mcloud Computing A Comparative Study of cloud and mcloud Computing Ms.S.Gowri* Ms.S.Latha* Ms.A.Nirmala Devi* * Department of Computer Science, K.S.Rangasamy College of Arts and Science, Tiruchengode. s.gowri@ksrcas.edu

More information

COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK

COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 5 May, 2013 Page No. 1680-1684 COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK ABSTRACT: Mr.Upendra

More information

IMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES

IMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 6 June, 2013 Page No. 1914-1919 IMPROVED PROXIMITY AWARE LOAD BALANCING FOR HETEROGENEOUS NODES Ms.

More information

- An Essential Building Block for Stable and Reliable Compute Clusters

- An Essential Building Block for Stable and Reliable Compute Clusters Ferdinand Geier ParTec Cluster Competence Center GmbH, V. 1.4, March 2005 Cluster Middleware - An Essential Building Block for Stable and Reliable Compute Clusters Contents: Compute Clusters a Real Alternative

More information

A SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION

A SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 2, February 2014,

More information

Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network

Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network Chandrakant N Bangalore, India nadhachandra@gmail.com Abstract Energy efficient load balancing in a Wireless Sensor

More information

Christian Bettstetter. Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks

Christian Bettstetter. Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks Christian Bettstetter Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks Contents 1 Introduction 1 2 Ad Hoc Networking: Principles, Applications, and Research Issues 5 2.1 Fundamental

More information

Content Distribution over IP: Developments and Challenges

Content Distribution over IP: Developments and Challenges Content Distribution over IP: Developments and Challenges Adrian Popescu, Blekinge Inst of Technology, Sweden Markus Fiedler, Blekinge Inst of Technology, Sweden Demetres D. Kouvatsos, University of Bradford,

More information

Praktikum Wissenschaftliches Rechnen (Performance-optimized optimized Programming)

Praktikum Wissenschaftliches Rechnen (Performance-optimized optimized Programming) Praktikum Wissenschaftliches Rechnen (Performance-optimized optimized Programming) Dynamic Load Balancing Dr. Ralf-Peter Mundani Center for Simulation Technology in Engineering Technische Universität München

More information

The Shortcut Guide to Balancing Storage Costs and Performance with Hybrid Storage

The Shortcut Guide to Balancing Storage Costs and Performance with Hybrid Storage The Shortcut Guide to Balancing Storage Costs and Performance with Hybrid Storage sponsored by Dan Sullivan Chapter 1: Advantages of Hybrid Storage... 1 Overview of Flash Deployment in Hybrid Storage Systems...

More information

AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK

AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK Abstract AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK Mrs. Amandeep Kaur, Assistant Professor, Department of Computer Application, Apeejay Institute of Management, Ramamandi, Jalandhar-144001, Punjab,

More information

Keywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.

Keywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age. Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement

More information

Chapter 18: Database System Architectures. Centralized Systems

Chapter 18: Database System Architectures. Centralized Systems Chapter 18: Database System Architectures! Centralized Systems! Client--Server Systems! Parallel Systems! Distributed Systems! Network Types 18.1 Centralized Systems! Run on a single computer system and

More information

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc])

REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) 299 REGULATIONS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER SCIENCE (MSc[CompSc]) (See also General Regulations) Any publication based on work approved for a higher degree should contain a reference

More information

IMCM: A Flexible Fine-Grained Adaptive Framework for Parallel Mobile Hybrid Cloud Applications

IMCM: A Flexible Fine-Grained Adaptive Framework for Parallel Mobile Hybrid Cloud Applications Open System Laboratory of University of Illinois at Urbana Champaign presents: Outline: IMCM: A Flexible Fine-Grained Adaptive Framework for Parallel Mobile Hybrid Cloud Applications A Fine-Grained Adaptive

More information

Doctor of Philosophy in Computer Science

Doctor of Philosophy in Computer Science Doctor of Philosophy in Computer Science Background/Rationale The program aims to develop computer scientists who are armed with methods, tools and techniques from both theoretical and systems aspects

More information

Load Balancing in the Cloud Computing Using Virtual Machine Migration: A Review

Load Balancing in the Cloud Computing Using Virtual Machine Migration: A Review Load Balancing in the Cloud Computing Using Virtual Machine Migration: A Review 1 Rukman Palta, 2 Rubal Jeet 1,2 Indo Global College Of Engineering, Abhipur, Punjab Technical University, jalandhar,india

More information

So#ware Tools and Techniques for HPC, Clouds, and Server- Class SoCs Ron Brightwell

So#ware Tools and Techniques for HPC, Clouds, and Server- Class SoCs Ron Brightwell So#ware Tools and Techniques for HPC, Clouds, and Server- Class SoCs Ron Brightwell R&D Manager, Scalable System So#ware Department Sandia National Laboratories is a multi-program laboratory managed and

More information

Reverse Auction-based Resource Allocation Policy for Service Broker in Hybrid Cloud Environment

Reverse Auction-based Resource Allocation Policy for Service Broker in Hybrid Cloud Environment Reverse Auction-based Resource Allocation Policy for Service Broker in Hybrid Cloud Environment Sunghwan Moon, Jaekwon Kim, Taeyoung Kim, Jongsik Lee Department of Computer and Information Engineering,

More information

Sanjeev Kumar. contribute

Sanjeev Kumar. contribute RESEARCH ISSUES IN DATAA MINING Sanjeev Kumar I.A.S.R.I., Library Avenue, Pusa, New Delhi-110012 sanjeevk@iasri.res.in 1. Introduction The field of data mining and knowledgee discovery is emerging as a

More information

A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network

A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-2 E-ISSN: 2347-2693 A Survey on Reduction in Energy Consumption by Improved AODV on Mobile Ad Hoc Network

More information

Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration

Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration 1 Harish H G, 2 Dr. R Girisha 1 PG Student, 2 Professor, Department of CSE, PESCE Mandya (An Autonomous Institution under

More information

A Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems

A Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems A Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems Anton Beloglazov, Rajkumar Buyya, Young Choon Lee, and Albert Zomaya Present by Leping Wang 1/25/2012 Outline Background

More information

International Journal of Advance Research in Computer Science and Management Studies

International Journal of Advance Research in Computer Science and Management Studies Volume 3, Issue 6, June 2015 ISSN: 2321 7782 (Online) International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online

More information

An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks

An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks An Efficient Hybrid Data Gathering Scheme in Wireless Sensor Networks Ayon Chakraborty 1, Swarup Kumar Mitra 2, and M.K. Naskar 3 1 Department of CSE, Jadavpur University, Kolkata, India 2 Department of

More information

An Implementation of Secure Wireless Network for Avoiding Black hole Attack

An Implementation of Secure Wireless Network for Avoiding Black hole Attack An Implementation of Secure Wireless Network for Avoiding Black hole Attack Neelima Gupta Research Scholar, Department of Computer Science and Engineering Jagadguru Dattaray College of Technology Indore,

More information

Participatory Cloud Computing and the Privacy and Security of Medical Information Applied to A Wireless Smart Board Network

Participatory Cloud Computing and the Privacy and Security of Medical Information Applied to A Wireless Smart Board Network Participatory Cloud Computing and the Privacy and Security of Medical Information Applied to A Wireless Smart Board Network Lutando Ngqakaza ngqlut003@myuct.ac.za UCT Department of Computer Science Abstract:

More information

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS

DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS DESIGN AND DEVELOPMENT OF LOAD SHARING MULTIPATH ROUTING PROTCOL FOR MOBILE AD HOC NETWORKS K.V. Narayanaswamy 1, C.H. Subbarao 2 1 Professor, Head Division of TLL, MSRUAS, Bangalore, INDIA, 2 Associate

More information

A STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti 2, Nidhi Rajak 3

A STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti 2, Nidhi Rajak 3 A STUDY OF TASK SCHEDULING IN MULTIPROCESSOR ENVIROMENT Ranjit Rajak 1, C.P.Katti, Nidhi Rajak 1 Department of Computer Science & Applications, Dr.H.S.Gour Central University, Sagar, India, ranjit.jnu@gmail.com

More information

Scheduling. from CPUs to Clusters to Grids. MCSN N. Tonellotto Complements of Distributed Enabling Platforms

Scheduling. from CPUs to Clusters to Grids. MCSN N. Tonellotto Complements of Distributed Enabling Platforms Scheduling from CPUs to Clusters to Grids 1 Outline Terminology CPU Scheduling Real-time Scheduling Cluster Scheduling Grid Scheduling Cloud Scheduling 2 General Scheduling refers to allocate limited resources

More information

ITU-T Future Networks and Its Framework of Virtualization

ITU-T Future Networks and Its Framework of Virtualization ITU-T Future Networks and Its Framework of Virtualization Ziaul Ain Usmani 1, Dr. Gulabchand K. Gupta 2 1 Research Scholar, JJT University, Jhunjhunu, Rajasthan, India 2 Western College of Commerce and

More information

IBM Deep Computing Visualization Offering

IBM Deep Computing Visualization Offering P - 271 IBM Deep Computing Visualization Offering Parijat Sharma, Infrastructure Solution Architect, IBM India Pvt Ltd. email: parijatsharma@in.ibm.com Summary Deep Computing Visualization in Oil & Gas

More information

159.735. Final Report. Cluster Scheduling. Submitted by: Priti Lohani 04244354

159.735. Final Report. Cluster Scheduling. Submitted by: Priti Lohani 04244354 159.735 Final Report Cluster Scheduling Submitted by: Priti Lohani 04244354 1 Table of contents: 159.735... 1 Final Report... 1 Cluster Scheduling... 1 Table of contents:... 2 1. Introduction:... 3 1.1

More information

Radware ADC-VX Solution. The Agility of Virtual; The Predictability of Physical

Radware ADC-VX Solution. The Agility of Virtual; The Predictability of Physical Radware ADC-VX Solution The Agility of Virtual; The Predictability of Physical Table of Contents General... 3 Virtualization and consolidation trends in the data centers... 3 How virtualization and consolidation

More information

A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV and IERF Ad-hoc Routing Protocols

A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV and IERF Ad-hoc Routing Protocols International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Issue-2 E-ISSN: 2347-2693 A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV

More information

LIST OF FIGURES. Figure No. Caption Page No.

LIST OF FIGURES. Figure No. Caption Page No. LIST OF FIGURES Figure No. Caption Page No. Figure 1.1 A Cellular Network.. 2 Figure 1.2 A Mobile Ad hoc Network... 2 Figure 1.3 Classifications of Threats. 10 Figure 1.4 Classification of Different QoS

More information

Congestion Control in WSN using Cluster and Adaptive Load Balanced Routing Protocol

Congestion Control in WSN using Cluster and Adaptive Load Balanced Routing Protocol Congestion Control in WSN using Cluster and Adaptive Load Balanced Routing Protocol Monu Rani 1, Kiran Gupta 2, Arvind Sharma 3 1 M.Tech (Student), 2 Assistant Professor, 3 Assistant Professor Department

More information

An Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system

An Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system An Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system Priyanka Gonnade 1, Sonali Bodkhe 2 Mtech Student Dept. of CSE, Priyadarshini Instiute of Engineering and

More information

Traffic Prediction in Wireless Mesh Networks Using Process Mining Algorithms

Traffic Prediction in Wireless Mesh Networks Using Process Mining Algorithms Traffic Prediction in Wireless Mesh Networks Using Process Mining Algorithms Kirill Krinkin Open Source and Linux lab Saint Petersburg, Russia kirill.krinkin@fruct.org Eugene Kalishenko Saint Petersburg

More information

Analysis and Research of Cloud Computing System to Comparison of Several Cloud Computing Platforms

Analysis and Research of Cloud Computing System to Comparison of Several Cloud Computing Platforms Volume 1, Issue 1 ISSN: 2320-5288 International Journal of Engineering Technology & Management Research Journal homepage: www.ijetmr.org Analysis and Research of Cloud Computing System to Comparison of

More information

A Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing

A Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing A Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing Liang-Teh Lee, Kang-Yuan Liu, Hui-Yang Huang and Chia-Ying Tseng Department of Computer Science and Engineering,

More information

Performance Evaluation of Mobile Agent-based Dynamic Load Balancing Algorithm

Performance Evaluation of Mobile Agent-based Dynamic Load Balancing Algorithm Performance Evaluation of Mobile -based Dynamic Load Balancing Algorithm MAGDY SAEB, CHERINE FATHY Computer Engineering Department Arab Academy for Science, Technology & Maritime Transport Alexandria,

More information

OPNET - Network Simulator

OPNET - Network Simulator Simulations and Tools for Telecommunications 521365S: OPNET - Network Simulator Jarmo Prokkola Project Manager, M. Sc. (Tech.) VTT Technical Research Centre of Finland Kaitoväylä 1, Oulu P.O. Box 1100,

More information

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.

More information

DDS-Enabled Cloud Management Support for Fast Task Offloading

DDS-Enabled Cloud Management Support for Fast Task Offloading DDS-Enabled Cloud Management Support for Fast Task Offloading IEEE ISCC 2012, Cappadocia Turkey Antonio Corradi 1 Luca Foschini 1 Javier Povedano-Molina 2 Juan M. Lopez-Soler 2 1 Dipartimento di Elettronica,

More information