Performance-sensitive Service Provision in Active Digital Libraries Georgousopoulos Christos Omer F. Rana

Slides:



Advertisements
Similar presentations
X platform A solution making PLM better. Outline Mobile trend and app market rising Looking for my data at any time Making a decision everywhere A easy.
Advertisements

Greening Backbone Networks Shutting Off Cables in Bundled Links Will Fisher, Martin Suchara, and Jennifer Rexford Princeton University.
1 Copyright © 2002 Pearson Education, Inc.. 2 Chapter 1 Introduction to Perl and CGI.
2 Introduction A central issue in supporting interoperability is achieving type compatibility. Type compatibility allows (a) entities developed by various.
L3S Research Center University of Hanover Germany
Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
The HILT Pilot Terminologies Server Dennis Nicholson: Centre for Digital Library Research, Strathclyde University.
OAI and Publishers metadata Using the static repositories approach to disclose small journals.
Alexey Miroshnikov InfoStroy Ltd. Locatioin: St.Petersburg, Russia Established: 1990 APL: since 1979 First APL conference: 1990, Copenhagen People: 42+
Auto-scaling Axis2 Web Services on Amazon EC2 By Afkham Azeez.
Copyright © 2011 by the Commonwealth of Pennsylvania. All Rights Reserved. Load Test Report.
IBM DEVELOP, NETWORK, PROMOTE & GROW Cloud Transformation: What are the risks, pitfalls and challenges to be addressed? Steve Strutt, CTO Cloud Computing,
The GATE-LAB system Sorina Camarasu-Pop, Pierre Gueth, Tristan Glatard, Rafael Silva, David Sarrut VIP Workshop December 2012.
Mobile Agents Mouse House Creative Technologies Mike OBrien.
Capacity Planning.
Capacity Planning For Products and Services
Zdravko Oklopčić (Končar-KET, Croatia),
Database System Concepts and Architecture
Reaching Agreements II. 2 What utility does a deal give an agent? Given encounter  T 1,T 2  in task domain  T,{1,2},c  We define the utility of a.
Cloud Storage in Czech Republic Czech national Cloud Storage and Data Repository project.
Ch 11 Distributed Scheduling –Resource management component of a system which moves jobs around the processors to balance load and maximize overall performance.
University of Minnesota Optimizing MapReduce Provisioning in the Cloud Michael Cardosa, Aameek Singh†, Himabindu Pucha†, Abhishek Chandra
CS 300 Client Side Web Development
Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
1 Eurostat Unit B1 – IT Systems for Statistical Production IT outsourcing in Eurostat – our experience Georges Pongas, Adam Wroński Meeting on the Management.
Message Queues COMP3017 Advanced Databases Dr Nicholas Gibbins –
Reference: Message Passing Fundamentals.
Web Server Hardware and Software
1 Pertemuan 13 Servers for E-Business Matakuliah: M0284/Teknologi & Infrastruktur E-Business Tahun: 2005 Versi: >
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
1 Introduction to Load Balancing: l Definition of Distributed systems. Collection of independent loosely coupled computing resources. l Load Balancing.
Managing Agent Platforms with the Simple Network Management Protocol Brian Remick Thesis Defense June 26, 2015.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. Chapter 17 Client-Server Processing, Parallel Database Processing,
Applications of agent technology in communications: a review S. S. Manvi &P. Venkataram Presented by Du-Shiau Tsai Computer Communications, Volume 27,
I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=
Data Conversion to a Data warehouse Presented By Sanjay Gunasekaran.
Agents Computer Programs of a certain type Effectively bodiless robots –Rise of internet enables Agents Lostness –As life becomes more complex, we cannot.
A.V. Bogdanov Private cloud vs personal supercomputer.
CS492: Special Topics on Distributed Algorithms and Systems Fall 2008 Lab 3: Final Term Project.
1 Choosing a Load Balancing Scheme for Agent-Based Digital Libraries Christos Georgousopoulos and Omer Rana Cardiff University.
SensIT PI Meeting, January 15-17, Self-Organizing Sensor Networks: Efficient Distributed Mechanisms Alvin S. Lim Computer Science and Software Engineering.
1 A User-Guided Cognitive Agent for Wireless Service Selection in Pervasive Computing George Lee May 5, 2004 G. Lee, P. Faratin, S. Bauer, and J. Wroclawski.
1 CS 501 Spring 2003 CS 501: Software Engineering Lecture 16 System Architecture and Design II.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
1 A Bidding Protocol for Deploying Mobile Sensors GuilingWang, Guohong Cao, and Tom LaPorta Department of Computer Science & Engineering The Pennsylvania.
October, 2000.A Self Organsing NN for Job Scheduling in Distributed Systems I.C. Legrand1 Iosif C. Legrand CALTECH.
UAB Dynamic Tuning of Master/Worker Applications Anna Morajko, Paola Caymes Scutari, Tomàs Margalef, Eduardo Cesar, Joan Sorribes and Emilio Luque Universitat.
Mobile Agents Babak Esfandiari. Types of Applications Dynamic load balancing. Dynamic service deployment. Intermittently connected systems.
George Tsouloupas University of Cyprus Task 2.3 GridBench ● 1 st Year Targets ● Background ● Prototype ● Problems and Issues ● What's Next.
Moby Web Services Iván Párraga García MSc on Bioinformatics for Health Sciences May 2006.
Supporting FIPA Interoperability for Legacy Multi-Agent Systems Christos Georgousopoulos 1 Omer F. Rana 1 ( ) 2.
Computing Simulation in Orders Based Transparent Parallelizing Pavlenko Vitaliy Danilovich, Odessa National Polytechnic University Burdeinyi Viktor Viktorovych,
Combining State and Model-based approaches for Mobile Agent Load Balancing Georgousopoulos Christos Omer F. Rana
Capacity Planning. Capacity Capacity (I): is the upper limit on the load that an operating unit can handle. Capacity (I): is the upper limit on the load.
Algorithmic, Game-theoretic and Logical Foundations
Agent Based Transaction System CS790: Dr. Bruce Land Sanish Mondkar Sandeep Chakravarty.
Copyright 2007, Information Builders. Slide 1 Machine Sizing and Scalability Mark Nesson, Vashti Ragoonath June 2008.
Topics. Introduce to students to kinds of topics: –Deeply research on an advanced topic that will be introduced in the next weeks –Explain how an existing.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Copyright © 2006 by The McGraw-Hill Companies,
Copyright 2007, Information Builders. Slide 1 iWay Web Services and WebFOCUS Consumption Michael Florkowski Information Builders.
Confluent vs. Splittable Flows
Affinity Depending on the application and client requirements of your Network Load Balancing cluster, you can be required to select an Affinity setting.
Introduction to Load Balancing:
Network Load Balancing
Parallel Algorithm Design
Cloud Computing By P.Mahesh
Ch > 28.4.
AGENT OS.
An Edge-Centric Ensemble Scheme for Queries Assignment
Presentation transcript:

Performance-sensitive Service Provision in Active Digital Libraries Georgousopoulos Christos Omer F. Rana

Load balance mobilestatic statemodel Market mechanism Specialized agents gather System state information Aim: improve the average utilization and performance of tasks on available servers Kinds of Load Balance (LB): Keren & Barak: mobile LB has a 30-40% improvement over the static placement scheme only a price sophistiated auction protocols a pricing mechanism without any negotiation roam through the network bid for resources L OAD B ALANCING O VERVIEW +

A RCHITECTURE O F S ARA D IGITAL L IBRARY

i) agents’ tasks ii) servers’ utilization (performance load) iii) availability of resources iv) network efficiency  LB decisions are supported through the MAs based on a model which accepts as: input: an agent’s requirements & System state information output: the appropriate server where an agent should migrate to  The model is a function of: Agent tasks may be either simplecomplex simple or complex

E XPERMIMENTAL T ESTS O N S ARA L B S CHEME ( U TILISATION O F I NFORMATION- S ERVERS ) Details of experiments conducted: agents launched - 5 information-servers & 1 web-server (Sun-Ultra 5 workstation running on Solaris 8 with Voyager 4.5 as the agent platform) - 100Mbits/s network connection - data-repository maintained by Oracle 9 DBMS on the execution of agents with mixed tasks (15% where complex task) on the execution of agents with simple tasks

For other systems utilising active-archives in which the lifetime of complex tasks cannot be estimated or tend to be erroneous E XPERMIMENTAL T ESTS O N S ARA L B S CHEME ( A DAPTABILITY O F M ODEL ) Three different LB schemes: Scheme No.1 - Scheme No.1 : represents the default LB scheme adopted in SARA MAS (lifetime of complex agent tasks is known) adaptability algorithm Scheme No.2 - Scheme No.2 : alternative version of No.1 (lifetime of complex agent tasks is unknown and therefore not used in calculations) Scheme No.3 - Scheme No.3 : alternative version of No.2 (adaptable algorithm is utilised for amending the server’s utilisation)

Optimization of LB scheme No.2, based on the utilisation of the adaptability algorithm Efficiency between LB scheme No.2 & No.3 Total task time required by agents to complete their task optimization in performance 1.63 – 10.8 % E XPERMIMENTAL T ESTS O N S ARA L B S CHEME ( C OMPARISON O N D IFFERENT L B S CHEMES )

T h e e n d Performance-sensitive Service Provision in Active Digital Libraries Georgousopoulos Christos Omer F. Rana