Agent Teams in Grid Resource Brokering and Management (preliminary considerations)

Slides:



Advertisements
Similar presentations
DISTRIBUTED COMPUTING PARADIGMS
Advertisements

School of Computing FACULTY OF ENGINEERING Richard Kavanagh Research Group: Collaborative Systems and Performance, Supervisors: Karim Djemame and Natasha.
FIPA Interaction Protocol. Request Interaction Protocol Summary –Request Interaction Protocol allows one agent to request another to perform some action.
Exploiting Distributed Version Concurrency in a Transactional Memory Cluster Kaloian Manassiev, Madalin Mihailescu and Cristiana Amza University of Toronto,
SLA-Oriented Resource Provisioning for Cloud Computing
CERN LCG Overview & Scaling challenges David Smith For LCG Deployment Group CERN HEPiX 2003, Vancouver.
Overview UML Extensions for Agents UML UML Agent UML (AUML) Agent UML (AUML) Agent Interaction Protocols Agent Interaction Protocols Richer Role Specification.
0 General information Rate of acceptance 37% Papers from 15 Countries and 5 Geographical Areas –North America 5 –South America 2 –Europe 20 –Asia 2 –Australia.
Multi-Agent Coalition Formation for Long-Term Task or Mobile Network Hsiu-Hui Lee and Chung-Hsien Chen.
A Grid Resource Broker Supporting Advance Reservations and Benchmark- Based Resource Selection Erik Elmroth and Johan Tordsson Reporter : S.Y.Chen.
Rutgers PANIC Laboratory The State University of New Jersey Self-Managing Federated Services Francisco Matias Cuenca-Acuna and Thu D. Nguyen Department.
Agents in Grid. The Grid Grid – introduction Power grid – plug the appliance and use electric power pay for used “units of electricity” Computational.
21 21 Web Content Management Architectures Vagan Terziyan MIT Department, University of Jyvaskyla, AI Department, Kharkov National University of Radioelectronics.
A Free Market Architecture for Distributed Control of a Multirobot System The Robotics Institute Carnegie Mellon University M. Bernardine Dias Tony Stentz.
CS533 Concepts of Operating Systems Class 2 The Duality of Threads and Events.
The Architecture of Transaction Processing Systems
Hussain Ali Department of Computer Engineering KFUPM, Dhahran, Saudi Arabia Microsoft Networking.
Summary :- Distributed Process Scheduling Prepared BY:- JAYA KALIDINDI.
COLLABORATIVE EXECUTION ENVIRONMENT FOR HETEROGENEOUS PARALLEL SYSTEMS Aleksandar Ili´c, Leonel Sousa 2010 IEEE International Symposium on Parallel & Distributed.
AliEn uses bbFTP for the file transfers. Every FTD runs a server, and all the others FTD can connect and authenticate to it using certificates. bbFTP implements.
Database Replication Policies for Dynamic Content Applications Gokul Soundararajan, Cristiana Amza, Ashvin Goel University of Toronto EuroSys 2006: Leuven,
Application-Layer Anycasting By Samarat Bhattacharjee et al. Presented by Matt Miller September 30, 2002.
A Goal-Based Organizational Perspective on Multi-Agent Architectures Manuel Kolp † Paolo Giorgini ‡ John Mylopoulos † † Department of Computer Science.
Yongzhi Wang, Jinpeng Wei VIAF: Verification-based Integrity Assurance Framework for MapReduce.
EXPOSE GOOGLE APP ENGINE AS TASKTRACKER NODES AND DATA NODES.
Frascati, October 9th, Accounting in DataGrid Initial Architecture Albert Werbrouck Frascati, October 9, 2001.
Grid Computing I CONDOR.
Introduction  Client/Server technology is seen by many as the solution to the difficulty of linking together the various departments of corporation.
임규찬. 1. Abstract 2. Introduction 3. Design Goals 4. Sample-Based Scheduling for Parallel Jobs 5. Implements.
DISTRIBUTED COMPUTING PARADIGMS. Paradigm? A MODEL 2for notes
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Title : CPU Broker (DSRT Extension) Kihun Kim University of Illinois at Urbana-Champaign.
Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.
Negotiation Protocol for Agile Collaboration in e-Science Zeqian Meng, John M. Brooke School of Computer Science, University of Manchester October 29th,
A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.
Fault Tolerance CSCI 4780/6780. Distributed Commit Commit – Making an operation permanent Transactions in databases One phase commit does not work !!!
Dipartimento di Informatica Università di Pisa Alberto Baragatti, Roberto Bruni, Hernán Melgratti, Ugo Montanari and Giorgio Spagnolo Prototype Platforms.
More on Adaptivity in Grids Sathish S. Vadhiyar Source/Credits: Figures from the referenced papers.
Distributed DBMSs- Concept and Design Jing Luo CS 157B Dr. Lee Fall, 2003.
Process Architecture Process Architecture - A portion of a program that can run independently of and concurrently with other portions of the program. Some.
AN SLA-BASED RESOURCE VIRTUALIZATION APPROACH FOR ON-DEMAND SERVICE PROVISION Gabor Kecskemeti MTA SZTAKI International Workshop on Virtualization Technologies.
A Load Sharing Approach Based on Refactoring of Roles in Multi-Agent Systems Sebnem Bora, A. Murat Tiryaki and Oguz Dikenelli Ege University.
GSAF: A Grid-based Services Transfer Framework Chunyan Miao, Wang Wei, Zhiqi Shen, Tan Tin Wee.
Grid Computing Framework A Java framework for managed modular distributed parallel computing.
CHEP 2006, February 2006, Mumbai 1 LHCb use of batch systems A.Tsaregorodtsev, CPPM, Marseille HEPiX 2006, 4 April 2006, Rome.
Dzmitry Kliazovich University of Luxembourg, Luxembourg
 CMS data challenges. The nature of the problem.  What is GMA ?  And what is R-GMA ?  Performance test description  Performance test results  Conclusions.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
Scheduling MPI Workflow Applications on Computing Grids Juemin Zhang, Waleed Meleis, and David Kaeli Electrical and Computer Engineering Department, Northeastern.
The new FTS – proposal FTS status. EMI INFSO-RI /05/ FTS /05/ /05/ Bugs fixed – Support an SE publishing more than.
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
Em Spatiotemporal Database Laboratory Pusan National University File Processing : Database Management System Architecture 2004, Spring Pusan National University.
Enabling Grids for E-sciencE Agreement-based Workload and Resource Management Tiziana Ferrari, Elisabetta Ronchieri Mar 30-31, 2006.
House Finding Management Supervisor: Mr. Trần Đình Trí & Avengers Team 1.
Software Agents as Resource Managers in Grid Michał Drozdowicz, Maria Ganzha Marcin Paprzycki SRI PAS Warsaw, Poland
General Purpose Grid Computing LCA. Specification The system will provide a multi-threaded, shared memory environment that is distributed across a loosely.
Brief introduction about “Grid at LNS”
DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S
WORKFLOW PETRI NETS USED IN MODELING OF PARALLEL ARCHITECTURES
Introduction to client/server architecture
Chapter 16: Distributed System Structures
Ch > 28.4.
Comparison of LAN, MAN, WAN
Basic Grid Projects – Condor (Part I)
Hidden Power : Service Broker
Initial job submission and monitoring efforts with JClarens
The Design of a Grid Computing System for Drug Discovery and Design
Multithreaded Programming
Applying Data Warehousing and Big Data Techniques to Analyze Internet Performance Thiago Barbosa, Renan Souza, Sérgio Serra, Maria Luiza and Roger Cottrell.
Relax and Adapt: Computing Top-k Matches to XPath Queries
Presentation transcript:

Agent Teams in Grid Resource Brokering and Management (preliminary considerations)

Introduction The Grid  what?  why? Local Grid  in a laboratory / company Global Grid  the P2P nightmare  nodes appear and disappear  node load can change radically  no problem for  problem when you need QoS SLA

Agents in grids today B. Di Martino and O. Rana  static and mobile agents in the system (MAGDA)  agents visit sites to find resources (services) visits based on exchanges of messages with nodes executes a task or a part of it  AGLETS-based / no economic model S. Manvi et. al.  attempt at adding economic model  single agent moves, negotiates, executes  heavily based on mobility

Comments / reminders Mobility can be costly  there is no free lunch Single resource provider  difficult to assure QOS / SLA Economic model is “necessary” (Buyya, 2000) Proposed solution  agent teams  “one for all and all for one”

Assumptions Agents work in teams Each team has a team leader (local master – Lmaster) Incoming Workers can join any team based on their criteria of joining Teams can accept workers based on their own criteria of acceptance Each Worker can (if needed) play role of Lmaster Decisions about joining and accepting will utilize contract net protocol and multi-criterial analysis Yellow-page method for matchmaking (provided by the CIC agent)  other approaches possible

Use case diagram of the system

Structure of a work-team Each team has an Lmaster and a mirror Lmaster (LMirror)  if only one agent  Lmaster  next incoming agent becomes Lmirror  LMirror becomes Lmaster if Lmaster fails Lmaster keeps its role as long as it can handle the workload If LMirror “disappears” Lmaster appoints one of slaves to be a mirror Lmaster and LMirror check each other existence in regular intervals Each subsequent agent becomes a worker

Finding team to... Lagent checks with the CIC who  it can join  does the work it needs Lagent sends representatives to negotiate Lagent makes decision  which team to join  which team will do the job Lagent collects data to be used (in the future) in MCDM

CIC architecture:#1 task-per-thread paradigm CICAgent picks requests from the JADE-provided message queue and enqueues them into the request queue

CIC architecture #2 local CICDbAgents the CIC agent picks requests form the JADE message queue and enqueues them into the internal request queue each CICDbAgent completes one task (request) at a time upon completion, results are sent back to the CICAgent

CIC architecture #3 database agents are located on remote machines contributing additional computational power and allowing CICDbAgents to work without stealing resources from the CICAgent

About experiments 4 Querying Agents (QA), requesting the CIC to perform SPARQL resource queries Each QA was running concurrently on separate machine, and was sending 2,500 requests and receiving query-results All experimental runs were coordinated by the Test Coordinator Agent (TCA). Before each test, remote JADE agent containers were restarted to provide equal environment conditions 11 AMD Athlon 2500+, 512MB RAM machines running Gentoo Linux and JVM Computers were interconnected with a 100Mbit LAN

Experimental results – different CIC architectures multi-threaded (pull) multi-agent with local CICDbAgents (push) multi-agent with distributed CICDbAgents (push) 10,000 queries

Architecture with CIC Internal Agent (CICIA)

Final comparisons Left panel – remote agents with and without CICIA – throughput Right panel – remote agents vs. threads – processing time

Resource ontology :Computer :a owl:Class. :hasCPU :a owl:ObjectProperty; rdfs:range :CPU; rdfs:domain :Computer. :CPU :a owl:Class. :hasCPUFrequency :a owl:DataProperty; rdfs:comment "in GHz"; rdfs:range xsd:float; rdfs:domain :CPU. :hasCPUType :a owl:ObjectProperty; rdfs:range :CPUType; rdfs:domain :CPU. :CPUType :a owl:Class. Intel :a :CPUType. AMDAthlon :a :CPUType. :hasMemory :a owl:DatatypeProperty; rdfs:comment "in MB"; rdfs:range xsd:float; rdfs:domain :Computer. :hasUserDiskQuota :a owl:DatatypeProperty; rdfs:comment "in MB"; rdfs:range xsd:float; rdfs:domain :Computer. :LMaster :a owl:Class; :hasContactAID :a owl:ObjectProperty; rdfs:range xsd:string; rdfs:domain :LMaster. :hasUserDiskQuota :a owl:DatatypeProperty; rdfs:comment "in MB"; rdfs:range xsd:float; rdfs:domain :Computer.

Sample resource description :LMaster3 :hasContactAID :hasWorker :PC2929. :PC2929 :a :Computer; :hasCPU [ a :CPU; :hasCPUType :Intel; :hasCPUFrequency "3.7"; ] ; :hasUserDiskQuota "400"; :hasMemory "512".

SPARQL query PREFIX : SELECT ?contact WHERE { ?lmaster :hasContactAID ?contact; :a :LMaster; :hasWorker [ :a :Computer; :hasCPU [ a :CPU; :hasCPUType :Intel; :hasCPUFrequency ?freq; ]; :hasUserDiskQuota ?quota; :hasMemory ?mem; ]. FILTER (?freq >= 3.2) FILTER (?quota >= 350) FILTER (?mem >= 256) }

LMaster  CIC interactions

End of Agents in Grid Part QUESTIONS? Looking for collaborators  papers available at: