Integrating New Cost Model into HMA-Based Grid Resource Scheduling
|
|
- Imogen Henderson
- 6 years ago
- Views:
Transcription
1 Integrating New Cost Model into HMA-Based Grid Resource Scheduling Jun-yan Zhang, Fan Min, and Guo-wei Yang College of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu , China {jyzhang, minfan, Abstract. Grid systems can provide a virtual framework for management and scheduling of resources across different domains. This paper proposes an HMA-base grid resource scheduling system to implement resource finding and scheduling. A new cost model is also given, considering resource finding cost and resource deciding cost beyond traditional model. In succession, the new cost model is integrated into the HMA-base grid resource scheduling system. Our experiment shows that optimal solution under traditional cost model is no longer optimal under our model. Keywords. Grid, resource scheduling, Agent, cost model 1 Introduction In traditional distributed computing environments (DCEs), resource management systems (RMSs) were primarily responsible for allocating resources for tasks [3]. They also performed functions such as resource discovery and monitoring to support their primary roles. With large amount of distributed resources and users, grid systems can provide a virtual framework for management and scheduling of resources across different domains, and they have been the focus of much research activities in recent years. A computational grid is an emerging computing infrastructure that enables effective access to high performance computing resources [5]. Resource management and scheduling are key grid services, where issues of utilizing grid resources reasonably by minimizing total cost represent a common concern for most grid infrastructure and scheduling algorithm developers. Resource management and scheduling in grid systems [1] [2] is challenging due to: (a) geographical distribution of resources; (b) resource heterogeneity; (c) autonomously administered grid domains having their own resource policies and practices; and (d) grid domains using different access and cost models. In this paper, we adopt Hierarchical Multi-Agent-based (HMA-based) methodology to grid resource scheduling, achieved by integrating cost into the HMA-base grid resource scheduling system to implement minimal cost resource scheduling. M. Li et al. (Eds.): GCC 2003, LNCS 3033, pp , Springer-Verlag Berlin Heidelberg 2004
2 Integrating New Cost Model into HMA-Based Grid Resource Scheduling 653 The paper is organized as follows: Section 2 introduces the traditional cost model. In section 3, the HMA-based grid resource scheduling system is described. In section 4, we integrate new cost model into our HMA-based grid resource scheduling systems. Comparing experimental results are included in section 5 and the paper concludes in section 6. 2 Traditional Cost Model The traditional cost model of the Internet forms the basis of most call admission, routing and reservation algorithms today. The model combines the cost classifying, switching, queuing and scheduling at a node with the cost of transmission over the next link in one abstract figure associated with each node-link pair (See Figure 1)[6]. Based on this model, the total cost of a system can be defined as: C = Cs + Cq + Cl (1) Where, C denotes the total cost of system; Cs denotes the cost of switching and scheduling; Cq denotes the cost of queuing; Cl denotes the cost of link. Fig. 1. Traditional Cost Model Although simple, this model has proven effective and robust in designing many popular network protocols. Shortest Path Routing, for example, uses this cost model to find the route between a pair of origin-destination nodes by minimizing the sum of per-hop costs.
3 654 J.-y. Zhang, F. Min, and G.-w. Yang 3 HMA-Based Grid Resource Scheduling System In our resource scheduling system, we consider the whole grid system as a Global grid, which is made up of n Grid Domains. Let GD i (i = 1, 2,, n) denote the ith Grid Domain (See Figure 2). The GD i is an autonomous, administrative and interactive entity consisting of a set of resources, services and users managed by a single Management Agent (MAgent i ). In our system, we divide each GD into two subdomains: (a) a resource domain (RD) which signifies the resources within the GD; and (b) a user domain (UD) which signifies the users within the GD. Fig. 2. HMA-Based Grid Resource Scheduling System First of all, we define γ = (γi, j) n k as system resource matrix, where γi, j specifies how many type j resources GD i possesses. We also define ξ = (ξi, j) n k as system processing power matrix, where ξi, j specifies processing power of GD i for the jth type of resource, clearly ξij 0 for any legal i, j. In this system, Resource Deciding Agent (RDAgent) maintains an n n table D which records the distance between GDs, where D ij denotes the distance between GD i and GD j. It also holds a quadruple Θ (θ, γθ, ξ, μ) to describe each GD in detail provides by each MAgent. Where, (a) θ denotes serial number of current GD, θ = 1, 2,, n; (b) γθ = [γθ1, γθ2,, γθk] specifies local resources; (c) ξθ = [ξθ1, ξθ2,, ξθk] denotes the processing power of current GD; (d) μ = [μ1, μ1,, μl] denotes the users of UDθ, μ i (i 0)signifies the ith user within UDθ. At the beginning, RDAgent initializes the distance table D and quadruple Θ (θ, γ, ξ, μ) according to the information submitted by all existed MAgents. When RDAgent polls MAgents on its own initiative, MAgents would refresh the table and the quadru-
4 Integrating New Cost Model into HMA-Based Grid Resource Scheduling 655 Fig. 3. A New Cost Model ple if the update happens within current GD. Otherwise, MAgents needn t submit the update and only keep the update information locally. Let TR denote a task requirement originated from a GD, it includes the explicit user IP address, and its original GD. It also includes the information of resource requirement. The requirement amount of each type of resource is denoted as x 1, x 2,, x K respectively. After a TR is recognized and analyzed by Resource Scheduling Agent (RSAgent), RSAgent orders Resource Finding Agent (RFAgent) to find the location of resources which can meet the requirement TR. At first, RFAgent queries RDAgent for resource information. Because RDAgent has a distance table D and a quadruple Θ, after RFAgent finishes the finding processing, it can get a resource deployment matrix RDP n k. The columns specify RS and the rows specify Grid Domains. If RS m locates at GR θ and γ θm x m, we let RDP θm =(γ θm, D iθ ), else we let RDP θm = (0, ). Now RFAgent examines this matrix RDP n k, if RFAgent finds a column whose elements are all (0, ), it will ask the RDAgent to update table D and quadruple Θ. After update table D and quadruple Θ, if matrix RDP n k still does not satisfy the TR, the next time update will start after a period of time (which we set to 5 minutes). If appropriate resource combination cannot be found after some times (which we set to 3 times), RFAgent concludes that the TR cannot be met and the task cannot be implemented, and sends this message to RSAgent. RSAgent will cancel this task and notify the user. If appropriate resource combination can be found, RFAgent sends this resource combination information to RSAgent. RSAgent will schedule resources according to this information and return result to the user, which procedure will be given in the next section. 4 Integrating New Cost Model into HMA-Based Grid Resource Scheduling System Generally speaking, resource schedulers and resource managers tend to choose the nearest resource because they make decisions depending upon traditional cost model [4]. Now we present a new cost model based on grid systems; therefore, the cost of resource finding and cost of resource deciding will affect the total cost significantly.
5 656 J.-y. Zhang, F. Min, and G.-w. Yang Thus, the system total cost C consists of three parts: cost of resource finding C F, cost of resource deciding C D, and cost of resource scheduling Cs. Its architecture is illustrated with Figure 3. On the view of Figure 3, C S can be further divided into processing cost C P and transmission cost C T. The total cost of resource scheduling C can be defined as: C = C F + C D + C P + C T (2) Now we can integrate the new cost model into HMA-based grid resource scheduling systems to implement reasonable scheduling with minimal cost. On receiving a TR, RSAgent will forward resources and processing power requirement to RFAgent. RFAgent examines this matrix RDP n k, if it finds a column whose elements are all (0, ), it will ask the RDAgent to update table D and quadruple Θ. We use integer variable count to record the update times. After refreshing table D and quadruple Θ, if matrix RDP n k still does not satisfy the TR, the next time update will start after a period of time (about 5 minutes). Therefore, the cost of finding resources can be measured by count and denoted as C F. That is to say, C F = count. If count > M (M is a constant and M >0. In our paper, we set M = 3), then let C F =, RFAgent consider the TR cannot be met and tell this message to RSAgent. RSAgent will cancel this task and notify the user. If only one element is not (0, ) in each column, this means only one kind combination of resources and Grid Domains can satisfy TR. So RSAgent has no choice but select this combination as the only solution regardless of cost C. If there is more than one resource combinations can satisfy TR, RDAgent will list all possible resource combinations and make decisions which combination to be chosen. The combinations can be signified as follows: CB (TR) = [RA, RA,, RA ] (3) 1 2 K where RAi represents the GD which offers the ith resource, 0 for no requirement of respective resource. The requirement of each type of resource can be met by some GD. Each type of resources is selected independently, so we need choose among at most n values each time. Accordingly, the time complexity is O(n k) instead of O(n k ). If some CB α which satisfies TR and includes λ GD, which means there are λ kinds resources can be provided locally, and (k λ) kinds resources locate at other GDs. We can define C D as: C D = (k λ)/k (4) Resource scheduling cost C S is made up of processing cost C P and transmission cost C T. The stronger the processing power of GD, the smaller the C P of GD. For ξ i, j represents computation power of GDi for resource j, then k ξ = i= 1 is the total computational power when choosing respective combination. ξ i, j (5)
6 Integrating New Cost Model into HMA-Based Grid Resource Scheduling 657 Accordingly, we use processing power s reciprocal to signify C P, i.e. C P = 1/ξ. Because we assume the task to be processed cannot be divided further, the GD is unique. The father the distance between two GDs, the larger the C T. Accordingly, we use logarithm of the distance between GDs and GD i to signify C T, so we have: k C T = log Dij j= 1 (6) Table 1. Distance between GD i (unit: hop) GD 1 GD 2 GD 3 GD 4 GD 5 GD 6 GD 7 GD 8 GD 9 GD 10 GD GD GD GD GD GD GD GD GD GD 10 0 Table 2. Initial Information about all GDs Table 3. Task Requirements Information γθ ξθ μθ Task1 γ13= 5 γ21 = 3 γ 53 = μ51 Task2 γ34 = 1 γ71 = μ92 Task3 γ12 = 9 γ31 = 7 γ81 = 1 γ10,1 = μ13 Task4 γ11 = 2 γ44 = μ74 Task5 γ61 = 4 γ92 = 5 γ10,3 = μ61 Task6 γ33 = 6 γ73 = 3 γ81 = 1 γ94 = μ45 Task7 γ24 = 2 γ62 = μ10,1 Task8 γ41 = 3 γ83 = 3 γ93 = μ33
7 658 J.-y. Zhang, F. Min, and G.-w. Yang traditional cost model average cost new cost model sum of resource requirement Fig. 4. Performance comparison Based on equation (2), the system total resource scheduling cost is: C = count + (k λ)/k + 1/ξ + log k Dij j= 1 (7) RDAgent will choose the CB with minimal C and recommend to RSAgent. RSAgent would perform scheduling according this CB and return results to corresponding user. In this paper, we don t compare costs of two tasks, so how many resources (such as communication traffic, computing overhead and so on) are needed is not our concern when we calculate total cost C. That is to say, the requirement we compute is relative but not absolute. 5 Comparing Experiment We simulate a system containing 10 GDs. 4 types of resource are provided. Distance between these GDs are listed in Table 1, initial information about all GDs are listed in Table 2, and task requirements information are listed in Table 3. Figure 4 shows average cost of tasks under two conditions: 1, optimal solution with traditional cost model and 2, optimal solution with new cost model. Here we can see that optimal solution under traditional cost model may not be optimal under new cost model. 6 Conclusion With the growing popularity of middleware dedicated at making so-called grids of processing and storage resources, network based computing will soon offer to users a
8 Integrating New Cost Model into HMA-Based Grid Resource Scheduling 659 dramatic increase in the available aggregate processing power. We propose an HMAbased grid resource scheduling system and a new cost model is given. Especially, we formalize resource information and task requirement in detail. Comparing experiment shows that optimal solution under traditional cost model is no longer optimal under our model. References [1] I. Foster, C. Kesselman, and S. Tuecke, The anatomy of the Grid: Enabling scalable virtual organizations, Int l Journal on Supercomputer Applications, [2] K. Krauter, R. Buyya, and M. Maheswaran, A taxonomy and survey of Grid resource management systems, Software Practice and Experiance, Vol. 32, No. 2, Feb 2002, pp [3] F. Berman, R. Wolski, S. Figueira, J. Schopf, and G. Shao, Application-level scheduling on distributed heterogeneous networks, in Proc Supercomputing, Pittsburgh, PA, USA, [4] B. Davie, S. Casner, C. Iturradle, D. Oran, J. Wroelawski, Integrated Services in the presence of Compressible Flows, Internet Draft, February [5] I. Foster and C. Kesselman, The GRID: Blueprint for a New Computing Infrastructure, Morgan-Kaufmann, [6] Kazem Najafi and Alberto Leon-Garcia, A Novel Cost Model for Active Networks, Communication Technology Proceedings 2000, vol.2, pp
Trust Based Grid Scheduling Algorithm for Commercial Grids
International Conference on Computational Intelligence and Multimedia Applications 2007 Trust Based Grid Scheduling Algorithm for Commercial Grids S.ThamaraiSelvi, P.Balakrishnan, R.Kumar, K.Rajendar Department
More informationResearch on Architecture and Key Technology for Service-Oriented Workflow Performance Analysis
Research on Architecture and Key Technology for Service-Oriented Workflow Performance Analysis Bo Liu and Yushun Fan Department of Automation, Tsinghua University, Beijing 100084, China liubo03@mails.tsinghua.edu.cn,
More informationIncentive-Based P2P Scheduling in Grid Computing
Incentive-Based P2P Scheduling in Grid Computing Yanmin Zhu 1, Lijuan Xiao 2, Lionel M. Ni 1, and Zhiwei Xu 2 1 Department of Computer Science Hong Kong University of Science and Technology Clearwater
More informationEnhancing Resource Reservation by Applying Defer Time in FCFS Scheme for Grid Computing Environments
2017 IJSRST Volume 3 Issue 3 Print ISSN: 2395-6011 Online ISSN: 2395-602X Themed Section: Science and Technology Enhancing Reservation by Applying Defer Time in FCFS Scheme for Grid Computing Environments
More informationAvailability Modeling of Grid Computing Environments Using SANs
Availability Modeling of Grid Computing Environments Using SANs Reza Entezari-Maleki Department of Computer Engineering, Sharif University of Technology, Tehran, Iran E-mail: entezari@ce.sharif.edu Ali
More informationPerformance Evaluation of Scheduling Policies for Volunteer Computing
Performance Evaluation of Scheduling Policies for Volunteer Computing Derrick Kondo David P. Anderson 2 John McLeod VII 3 INRIA, France 2 University of California at Berkeley, U.S.A. 3 Sybase Inc., U.S.A.
More informationRISK MANAGEMENT OF RESOURCE ALLOCATION IN GRID COMPUTING
RISK MANAGEMENT OF RESOURCE ALLOCATION IN GRID COMPUTING K.R Palanisamy, Assistant Professor, Department of Computer Science, Mahendra Arts and Science College, Kallipatti, Namakkal, Tamilnadu. A.Murugan,
More informationResource Scheduling in Hybrid Grid Environment
Resource Scheduling in Hybrid Grid Environment Dr. N. Malarvizhi Professor & Head, Department of Information Technology Jawahar Engineering College Chennai, India nmv_94@yahoo.com Dr. N. Sankar Ram Professor
More informationTrust and Reputation Based Association Among Grid Entities
Trust and Reputation Based Association Among Grid Entities MAJOR SINGH GORAYA Department of Computer Science and Engineering Sant Longowal Institute of Engineering and Technology Longowal, Punjab India
More informationAn Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications
An Evaluation of Economy-based Resource Trading and Scheduling on Computational Power Grids for Parameter Sweep Applications Rajkumar Buyya, Jonathan Giddy, and David Abramson School of Computer Science
More informationQoS-based Scheduling for Task Management in Grid Computing
QoS-based Scheduling for Task Management in Grid Computing Xiaohong Huang 1, Maode Ma 2, Yan Ma 1 Abstract--Due to the heterogeneity, complexity, and autonomy of wide spread Grid resources, the dynamic
More informationApplication-adaptive resource scheduling in a computational grid *
1634 Luan et al. / J Zhejiang Univ SCIENCE A 26 7(1):1634-1641 Journal of Zhejiang University SCIENCE A ISSN 19-395 (Print); ISSN 1862-1775 (Online) www.zju.edu.cn/jzus; www.springerlink.com E-mail: jzus@zju.edu.cn
More informationEconomic Scheduling in Grid Computing
Economic Scheduling in Grid Computing Carsten Ernemann, Volker Hamscher, and Ramin Yahyapour Computer Engineering Institute, University of Dortmund, 44221 Dortmund, Germany, (email: {carsten.ernemann,volker.hamscher,ramin.yahyapour}@udo.edu)
More informationGRID META BROKER SELECTION STRATEGIES FOR JOB RESERVATION AND BIDDING
GRID META BROKER SELECTION STRATEGIES FOR JOB RESERVATION AND BIDDING D. Ramyachitra #1, S. Poongodi #2 #1 Asst.Prof, Department of Computer Science, Bharathiar University, Coimbatore- 46. #1 jaichitra1@yahoo.co.in
More informationAmerican Journal of Engineering Research (AJER) Implementing Short Term Scheduler and Preemptive Algorithm in Grid Computing Scheduling
American Journal of Engineering Research (AJER) e-issn : 2320-0847 p-issn : 2320-0936 Volume-02, Issue-05, pp-78-83 www.ajer.us Research Paper Open Access Implementing Short Term Scheduler and Preemptive
More informationPath Optimization for Inter-Switch Handoff in Wireless ATM Networks
Path Optimization for Inter-Switch Handoff in Wireless ATM Networks W. S. Vincent Wong, Henry C. B. Chan, and Victor C. M. Leung Department of Electrical and Computer Engineering University of British
More informationCROWNBench: A Grid Performance Testing System Using Customizable Synthetic Workload
CROWNBench: A Grid Performance Testing System Using Customizable Synthetic Workload Xing Yang, Xiang Li, Yipeng Ji, and Mo Sha School of Computer Science, Beihang University, Beijing, China {yangxing,
More informationWEB SERVICES COMPOSING BY MULTIAGENT NEGOTIATION
Jrl Syst Sci & Complexity (2008) 21: 597 608 WEB SERVICES COMPOSING BY MULTIAGENT NEGOTIATION Jian TANG Liwei ZHENG Zhi JIN Received: 25 January 2008 / Revised: 10 September 2008 c 2008 Springer Science
More informationInferring Social Ties across Heterogeneous Networks
Inferring Social Ties across Heterogeneous Networks CS 6001 Complex Network Structures HARISH ANANDAN Introduction Social Ties Information carrying connections between people It can be: Strong, weak or
More informationAGORA: An Architecture for Strategyproof Computing in Grids
AGORA: An Architecture for Strategyproof Computing in Grids Daniel Grosu Department of Computer Science Wayne State University Detroit, Michigan 48202, USA Email: dgrosu@cs.wayne.edu Abstract Grids enable
More informationWeb Customer Modeling for Automated Session Prioritization on High Traffic Sites
Web Customer Modeling for Automated Session Prioritization on High Traffic Sites Nicolas Poggi 1, Toni Moreno 2,3, Josep Lluis Berral 1, Ricard Gavaldà 4, and Jordi Torres 1,2 1 Computer Architecture Department,
More informationPacket Scheduling in Cloud by Employing Genetic Algorithm
Packet Scheduling in Cloud by Employing Genetic Algorithm S.Prabhu Assistant professor Department of Computer Science and Engineering Nandha Engineeirng College, Erode, Tamil Nadu, India Dr.N.Sengottaiyan
More informationEnhanced Algorithms for Multi-Site Scheduling
Enhanced Algorithms for Multi-Site Scheduling Carsten Ernemann 1, Volker Hamscher 1, Ramin Yahyapour 1, and Achim Streit 2 1 Computer Engineering Institute, University of Dortmund, 44221 Dortmund, Germany,
More informationA Proactive Fault Tolerant Strategy for Desktop Grid
A Tolerant Strategy for Desktop Grid Geeta Arora 1,Dr. Shaveta Rani 2,Dr. Paramjit Singh 3 1 Research Scholar, Dept. of Computer Applications, I.K.Gujral Punjab Technical University, Kapurthala,India 2,
More informationOur MCMC algorithm is based on approach adopted by Rutz and Trusov (2011) and Rutz et al. (2012).
1 ONLINE APPENDIX A MCMC Algorithm Our MCMC algorithm is based on approach adopted by Rutz and Trusov (2011) and Rutz et al. (2012). The model can be written in the hierarchical form: β X,ω,Δ,V,ε ε β,x,ω
More informationModeling of Parameters in Supercomputer Workloads
Modeling of Parameters in Supercomputer Workloads Baiyi Song, Carsten Ernemann, Ramin Yahyapour Computer Engineering Institute, University Dortmund, Germany (email: {song.baiyi, carsten.ernemann, ramin.yahyapour}@udo.edu)
More informationResource Allocation Strategies in a 2-level Hierarchical Grid System
st Annual Simulation Symposium Resource Allocation Strategies in a -level Hierarchical Grid System Stylianos Zikos and Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 5
More informationA logistic regression model for Semantic Web service matchmaking
. BRIEF REPORT. SCIENCE CHINA Information Sciences July 2012 Vol. 55 No. 7: 1715 1720 doi: 10.1007/s11432-012-4591-x A logistic regression model for Semantic Web service matchmaking WEI DengPing 1*, WANG
More informationCascading Behavior in Networks. Anand Swaminathan, Liangzhe Chen CS /23/2013
Cascading Behavior in Networks Anand Swaminathan, Liangzhe Chen CS 6604 10/23/2013 Outline l Diffusion in networks l Modeling diffusion through a network l Diffusion, Thresholds and role of Weak Ties l
More informationMixed Constraint Fuzzy Transshipment Problem
Applied Mathematical Sciences, Vol. 6, 2012, no. 48, 2385-2394 Mixed Constraint Fuzzy Transshipment Problem A. Nagoor Gani PG & Research Department of Mathematics Jamal Mohamed College (Autonomous) Tiruchirappalli-620020,
More informationJOB AND APPLICATION-LEVEL SCHEDULING IN DISTRIBUTED COMPUTING
JOB AND APPLICATION-LEVEL SCHEDULING IN DISTRIBUTED COMPUTING Victor V. Toporkov Computer Science Department, Moscow Power Engineering Institute, ul. Krasnokazarmennaya 14, Moscow, 111250 Russia ToporkovVV@mpei.ru
More informationRailroad Yard Location Optimization Using A Genetic Algorithm
Railroad Yard Location Optimization Using A Genetic Algorithm AVIJIT MAJI Office of Traffic and Safety Maryland State Highway Administration 7491 Connelley Drive, Hanover, MD 2176 USA avit.maji@gmail.com
More informationModeling of Parameters in Supercomputer Workloads
Modeling of Parameters in Supercomputer Workloads Baiyi Song, Carsten Ernemann, Ramin Yahyapour Computer Engineering Institute, University Dortmund, Germany (email: {song.baiyi, carsten.ernemann, ramin.yahyapour}@udo.edu)
More informationTowards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems
Towards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems Mehdi Sliem 1(B), Nabila Salmi 1,2, and Malika Ioualalen 1 1 MOVEP Laboratory, USTHB, Algiers, Algeria {msliem,nsalmi,mioualalen}@usthb.dz
More informationOn the Impact of Reservations from the Grid on Planning-Based Resource Management
On the Impact of Reservations from the Grid on Planning-Based Resource Management Felix Heine 1, Matthias Hovestadt 1, Odej Kao 1, and Achim Streit 2 1 Paderborn Center for Parallel Computing (PC 2 ),
More informationThe Job Assignment Problem: A Study in Parallel and Distributed Machine Learning
The Job Assignment Problem: A Study in Parallel and Distributed Machine Learning Gerhard Weiß Institut für Informatik, Technische Universität München D-80290 München, Germany weissg@informatik.tu-muenchen.de
More informationA RESOURCE LEASING POLICY FOR ON-DEMAND COMPUTING
FOR ON-DEMAND COMPUTING Darin England Jon Weissman DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIVERSITY OF MINNESOTA, TWIN CITIES, USA (JON@CS.UMN.EDU) Abstract Leasing computational resources for
More informationAN ADVANCED IWD BASED HYPER-HEURISTIC WORKFLOW SCHEDULING IN COMPUTATIONAL GRID
AN ADVANCED IWD BASED HYPER-HEURISTIC WORKFLOW SCHEDULING IN COMPUTATIONAL GRID S. Gokuldev 1, C. Sowntharya 2 and S. Manishankar 1 1 Department of Computer Science, Amrita VishwaVidyapeetham, Mysore Campus,
More informationAn Autonomic Service Oriented Architecture in Computational Engineering Framework
Journal of Computer Engineering 1 (2009) 3-11 An Autonomic Service Oriented Architecture in Computational Engineering Framework M. Agni Catur Bhakti and Azween B. Abdullah Department of Computer and Information
More informationA self-configuration model for execution management in Grid computing
www.ijcsi.org 396 A self-configuration model for execution management in Grid computing Mohamad Fadaeian 1 and Mehdi N.Fesharaki 2 1 Computer Department, Science and Research Branch, Islamic Azad University,
More informationNear-Balanced Incomplete Block Designs with An Application to Poster Competitions
Near-Balanced Incomplete Block Designs with An Application to Poster Competitions arxiv:1806.00034v1 [stat.ap] 31 May 2018 Xiaoyue Niu and James L. Rosenberger Department of Statistics, The Pennsylvania
More informationPRIORITISATION OF ROAD CORRIDORS BY DEVELOPING COMPOSITE INDEX
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology An ISO 3297: 2007 Certified Organization, Volume 2, Special Issue
More informationChapter 2 Research on Logistics Center Layout Based on SLP
Chapter 2 Research on Logistics Center Layout Based on SLP Yannan Liu and Qilan Zhao Abstract Systematic layout planning (SLP) has been widely applied to the production system, but not to the service system.
More informationSupporting Peer-To-Peer Collaboration Through Trust
Supporting Peer-To-Peer Collaboration Through Trust Nathan Griffiths and Shanghua Sun Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK nathan@dcs.warwick.ac.uk Abstract Distributed
More informationDecision Resource Management and Scheduling on the Grid
Decision Resource Management and Scheduling on the Grid Mingsheng Hu 1 2,Xueguang Chen 1,Zhijuan Jia 2 (Institute of Systems Engineering, Huazhong University of Science and Technology, 430074, P.R.China)1
More informationAutomatic Neighboring BS List Generation Scheme for Femtocell Network
Automatic Neighboring BS List Generation Scheme for Femtocell Network Kwanghun Han, Seungmin Woo, Duho Kang, and Sunghyun Choi School of Electrical Engineering and INMC, Seoul National University, Seoul,
More informationExpert System Applied to High-Speed Railway Track Circuit Coding and Its Simulation
Expert System Applied to High-Speed Railway Track Circuit Coding and Its Simulation Yan Li, Dewang Chen, and Xuan Yang State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University,
More informationApplication of Data-Mining and Knowledge Discovery in Automotive Data Engineering
Application of Data-Mining and Knowledge Discovery in Automotive Data Engineering Jörg Keller 1, Valerij Bauer 1, and Wojciech Kwedlo 2 1 DaimlerChrysler AG, Machine Learning, FT3/KL, P.O.-Box 2360, D-89013
More informationDesign and Development of Enhanced Optimization Techniques based on Ant Colony Systems
IJIRST International Journal for Innovative Research in Science & Technology Volume 3 Issue 04 September 2016 ISSN (online): 2349-6010 Design and Development of Enhanced Optimization Techniques based on
More informationMapping of Self-Organization Properties and Non-Functional Requirements in Smart Grids
Copyright and Reference Information: This material (preprint, accepted manuscript, or other author-distributable version) is provided to ensure timely dissemination of scholarly work. Copyright and all
More informationDecentralized Scheduling of Bursty Workload on Computing Grids
Decentralized Scheduling of Bursty Workload on Computing Grids Juemin Zhang, Ningfang Mi, Jianzhe Tai and Waleed Meleis Department of Electrical and Computer Engineering Northeastern University, Boston,
More informationA Method for Determining Inventory Policy Parameters for a Single Product under Limited Space
A Method for Determining Inventory Policy Parameters for a Single Product under Limited Space Doan Trinh Nguyen #1, Jirachai Buddhakulsomsiri #2, Kanokwan Singha #3 # School of Manufacturing Systems and
More informationCMS Conference Report
Available on CMS information server CMS CR 2001/006 CMS Conference Report HEPGRID2001: A Model of a Virtual Data Grid Application Koen Holtman Published in Proc. of HPCN Europe 2001, Amsterdam, p. 711-720,
More informationThe Design and Implementation of Railway Freight Applications on China's Railway Freight Data Grid Platform
The Design and Implementation of Railway Freight Applications on China's Railway Freight Data Grid Platform 1 Honghui Li, 2 Yan Zhang, 3 Feng Liu, 4 Gang Dai 1, First Author School of Computer and Information
More informationJob Type Approach for Deciding Job Scheduling in Grid Computing Systems
Journal of Computer Science 5 (10): 745-750, 2009 ISSN 1549-3636 2009 Science Publications Job Type Approach for Deciding Job Scheduling in Grid Computing Systems Asef AL-Khateeb, Rosni Abdullah and Nur'Aini
More informationSOFTWARE AGENT AND CLOUD COMPUTING: A BRIEF REVIEW Gambang, Pahang, Malaysia 2 College of Information Technology, Universiti Tenaga Nasional,
International Journal of Software Engineering & ComputerSystems (IJSECS) ISSN: 2289-8522, Volume 2, pp. 108-113, February 2016 Universiti Malaysia Pahang DOI: http://dx.doi.org/10.15282/ijsecs.2.2016.9.0020
More informationCHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM
56 CHAPTER 4 A NEW ALTERNATE METHOD OF TRANS-SHIPMENT PROBLEM 4.1 Introduction In a transportation problem shipment of commodity takes place among sources and destinations. But instead of direct shipments
More informationCOMPARING VARIOUS WORKFLOW ALGORITHMS WITH SIMULATED ANNEALING TECHNIQUE
COMPARING VARIOUS WORKFLOW ALGORITHMS WITH SIMULATED ANNEALING TECHNIQUE Dr.V.Venkatesakumar #1, R.Yasotha #2 # Department of Computer Science and Engineering, Anna University Regional Centre, Coimbatore,
More informationTime Optimal Profit Maximization in a Social Network
Time Optimal Profit Maximization in a Social Network Yong Liu, Wei Zhang Hei Long Jiang University China liuyong001@hlju.edu.cn 149275442@qq.com ABSTRACT: Influence maximization aims to seek k nodes from
More informationOperation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras
Operation and supply chain management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture - 37 Transportation and Distribution Models In this lecture, we
More informationTrust-based IoT Participatory Sensing for Hazard Detection and Response
Trust-based IoT Participatory Sensing for Hazard Detection and Response Jia Guo 1, Ing-Ray Chen 1, Jeffrey J.P. Tsai 2, Hamid Al-Hamadi 3 1 Virginia Tech {jiaguo,irchen}@vt.edu 2 Asia University jjptsai@gmail.com
More informationThe Staffing Problem of the N-Design Multi-Skill Call Center Based on Queuing Model
3rd International Conference on Wireless Communication and Sensor etwork (WCS 06) The Staffing Problem of the -Design Multi-Skill Call Center Based on Queuing Model Chun-Yan Li, De-Quan Yue Zhijiang College
More informationTRANSPORTATION PROBLEM AND VARIANTS
TRANSPORTATION PROBLEM AND VARIANTS Introduction to Lecture T: Welcome to the next exercise. I hope you enjoyed the previous exercise. S: Sure I did. It is good to learn new concepts. I am beginning to
More informationGROUPING BASED USER DEMAND AWARE JOB SCHEDULING APPROACH FOR COMPUTATIONAL GRID
GROUPING BASED USER DEMAND AWARE JOB SCHEDULING APPROACH FOR COMPUTATIONAL GRID P.SURESH Assistant Professor (Senior Grade), Department of IT, Kongu Engineering College, Perundurai, Erode Tamilnadu, India
More informationEnterprise Output Management For Banking, Finance, and Insurance
A VPS White Paper from Levi, Ray & Shoup, Inc. Enterprise Output Management For Banking, Finance, and Insurance Slumping markets, industry initiatives such as T+1, and deregulation that allows banks, insurance
More informationScalability Investigations on Communication Traffic in Distributed Routing of Autonomous Logistic Objects
Scalability Investigations on Communication Traffic in Distributed Routing of Autonomous Logistic Objects Bernd-Ludwig Wenning Communication Networks University of Bremen Otto-Hahn-Allee, 28359 Bremen,
More informationAutonomic Approach to Planning and Scheduling in Networked Small Factories
Autonomic Approach to Planning and Scheduling in Networked Small Factories Flavio Bonfatti 1, Luca Martinelli 1, and Paola Daniela Monari 2 1 DII, University of Modena and Reggio Emilia,Via Vignolese 905,
More informationScheduling and Resource Management in Grids
Scheduling and Resource Management in Grids ASCI Course A14: Advanced Grid Programming Models Ozan Sonmez and Dick Epema may 13, 2009 1 Outline Resource Management Introduction A framework for resource
More information15th ICCRTS. The Evolution of C2. Title of Paper: Network Centric Simulation Architecture. Topic(s): 6, 1, 8
15th ICCRTS The Evolution of C2 Title of Paper: Network Centric Simulation Architecture Topic(s): 6, 1, 8 Name of Author(s): Shao-Jie Mao, Yu-Ping Li, Jian-Ning Lin, Ke-Bo Deng, Li-Yang Sun Point of Contact:
More informationOptimal Design, Evaluation, and Analysis of AGV Transportation Systems Based on Various Transportation Demands
Optimal Design, Evaluation, and Analysis of Systems Based on Various Demands Satoshi Hoshino and Jun Ota Dept. of Precision Engineering, School of Engineering The University of Tokyo Bunkyo-ku, Tokyo 113-8656,
More informationQoS-Aware Routing in Wireless Networks Using Aerial Vehicles
QoS-Aware Routing in Wireless Networks Using Aerial Vehicles 73 QoS-Aware Routing in Wireless Networks Using Aerial Vehicles Vishal Sharma 1, Kathiravan Srinivasan 2* 1 Computer Science and Engineering
More informationA case for cooperative and incentive-based federation of distributed clusters
Future Generation Computer Systems 24 (2008) 280 295 www.elsevier.com/locate/fgcs A case for cooperative and incentive-based federation of distributed clusters Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
More informationNegotiation Strategies Considering Opportunity Functions for Grid Scheduling
Negotiation Strategies Considering Opportunity Functions for Grid Scheduling Jiadao Li 1, Kwang Mong Sim 2, and Ramin Yahyapour 1 1 Members of the Core Grid Institute on Resource Management and Scheduling
More informationAsymptotic Analysis of Real-Time Queues
Asymptotic Analysis of John Lehoczky Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 Co-authors: Steve Shreve, Kavita Ramanan, Lukasz Kruk, Bogdan Doytchinov, Calvin Yeung, and
More informationDesign and Implementation of Office Automation System based on Web Service Framework and Data Mining Techniques. He Huang1, a
3rd International Conference on Materials Engineering, Manufacturing Technology and Control (ICMEMTC 2016) Design and Implementation of Office Automation System based on Web Service Framework and Data
More informationOn the Comparison of CPLEX-Computed Job Schedules with the Self-Tuning dynp Job Scheduler
On the Comparison of CPLEX-Computed Job Schedules with the Self-Tuning dynp Job Scheduler Sven Grothklags 1 and Achim Streit 2 1 Faculty of Computer Science, Electrical Engineering and Mathematics, Institute
More informationA case for cooperative and incentive-based federation of distributed clusters
Future Generation Computer Systems 24 (2008) 280 295 www.elsevier.com/locate/fgcs A case for cooperative and incentive-based federation of distributed clusters Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
More informationManaging Risk of Inaccurate Runtime Estimates for Deadline Constrained Job Admission Control in Clusters
Managing Risk of Inaccurate Runtime Estimates for Deadline Constrained Job Admission Control in Clusters Chee Shin Yeo and Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of
More informationJob co-allocation strategies for multiple high performance computing clusters
Cluster Comput (2009) 12: 323 340 DOI 10.1007/s10586-009-0087-x Job co-allocation strategies for multiple high performance computing clusters Jinhui Qin Michael A. Bauer Received: 28 April 2008 / Accepted:
More informationSystem Virtualization and Efficient ID Transmission Method for RFID Tag Infrastructure Network
System Virtualization and Efficient ID Transmission Method for RFID Tag Infrastructure Network Shin-ichi Kuribayashi 1 and Yasunori Osana 1 1 Department of Computer and Information Science, Seikei University,
More informationDistributed Accounting on the Grid
Distributed Accounting on the Grid William Thigpen Thomas J. Hacker Laura F. McGinnis Brian D. Athey NAS Systems Division CPC Pittsburgh MCBI NASA AMES University of Michigan Supercomputing Center University
More informationTutorial: Big Data Algorithms and Applications Under Hadoop KUNPENG ZHANG SIDDHARTHA BHATTACHARYYA
Tutorial: Big Data Algorithms and Applications Under Hadoop KUNPENG ZHANG SIDDHARTHA BHATTACHARYYA http://kzhang6.people.uic.edu/tutorial/amcis2014.html August 7, 2014 Schedule I. Introduction to big data
More informationApplications of Intelligent Agent Technology to the Grid
Applications of Intelligent Agent Technology to the Grid Carl Kesselman Information Sciences Institute University of Southern California Globus Alliance In collaboration with Nick Jennings & Ian Foster
More informationREA VALUE CHAIN AND SUPPLY CHAIN
REA VALUE CHAIN AND SUPPLY CHAIN František Huňka, Jaroslav Žáček, Zdeněk Meliš, Jaroslav Ševčík Abstract: Value chain model is a network of business processes that are bound by inflows and outflows resources.
More informationGroup #2 Project Final Report: Information Flows on Twitter
Group #2 Project Final Report: Information Flows on Twitter Huang-Wei Chang, Te-Yuan Huang 1 Introduction Twitter has become a very popular microblog website and had attracted millions of users up to 2009.
More informationTwo Level Job-Scheduling Strategies for a Computational Grid
Two Level Job-Scheduling Strategies for a Computational Grid Andrei Tchernykh 1, Juan Manuel Ramírez,ArutyunAvetisyan 3, Nikolai Kuzjurin 3,DmitriGrushin 3, and Sergey Zhuk 3 1 CICESE Research Center,
More informationDesign of intelligent logistics information platform based on wireless sensor RFID technology. Hai Ye 1, a
5th International Conference on Education, Management, Information and Medicine (EMIM 2015) Design of intelligent logistics information platform based on wireless sensor RFID technology Hai Ye 1, a 1 Qingyuan
More informationDesign and Implementation of Heterogeneous Workflow System Integration Mode Based on SOA Framework
2017 2nd International Conference on Wireless Communication and Network Engineering (WCNE 2017) ISBN: 978-1-60595-531-5 Design and Implementation of Heterogeneous Workflow System Integration Mode Based
More informationA Deadline and Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids
A and Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids Rajkumar Buyya, Manzur Murshed *, and David Abramson School of Computer Science and Software
More informationSCHEDULING JOBS ON GRID COMPUTING USING FIREFLY ALGORITHM
SCHEDULING JOBS ON GRID COMPUTING USING FIREFLY ALGORITHM 1 ADIL YOUSIF, 1 ABDUL HANAN ABDULLAH, 2 SULAIMAN MOHD NOR, 1 ADIL ALI ABDELAZIZ 1 Faculty of Computer Science & Information System, Universiti
More informationProceedings of the 2016 Winter Simulation Conference T. M. K. Roeder, P. I. Frazier, R. Szechtman, E. Zhou, T. Huschka, and S. E. Chick, eds.
Proceedings of the 2016 Winter Simulation Conference T. M. K. Roeder, P. I. Frazier, R. Szechtman, E. Zhou, T. Huschka, and S. E. Chick, eds. A DATA MODEL FOR PLANNING IN THE SEMICONDUCTOR SUPPLY CHAIN
More informationC. Wohlin, P. Runeson and A. Wesslén, "Software Reliability Estimations through Usage Analysis of Software Specifications and Designs", International
C. Wohlin, P. Runeson and A. Wesslén, "Software Reliability Estimations through Usage Analysis of Software Specifications and Designs", International Journal of Reliability, Quality and Safety Engineering,
More informationCOST ESTIMATION OF ADVANCE RESERVATIONS OVER QUEUED JOBS: A QUANTITATIVE STUDY
International Journal of Modeling, Simulation, and Scientific Computing Vol. 1, No. 3 (2010) 317 332 c World Scientific Publishing Company DOI: 10.1142/S1793962310000249 COST ESTIMATION OF ADVANCE RESERVATIONS
More informationCONVERGENCE OF CLOUD COMPUTING, SERVICE ORIENTED ARCHITECTURE AND ENTERPRISE ARCHITECTURE
CONVERGENCE OF CLOUD COMPUTING, SERVICE ORIENTED ARCHITECTURE AND ENTERPRISE ARCHITECTURE Susan Sutherland (nee Rao) University of Canberra PO Box 148, Jamison Centre, ACT 2614, Australia Susan.sutherland@canberra.edu.au
More informationService Selection in Web Service Composition: A Comparative Review of Existing Approaches
Service Selection in Web Service Composition: A Comparative Review of Existing Approaches Mahboobeh Moghaddam 1,2, Joseph G. Davis 1 1 School of Information Technologies, University of Sydney, NSW 2006,
More informationDeterministic Crowding, Recombination And Self-Similarity
Deterministic Crowding, Recombination And Self-Similarity Bo Yuan School of Information Technology and Electrical Engineering The University of Queensland Brisbane, Queensland 4072 Australia E-mail: s4002283@student.uq.edu.au
More informationCOLLABORATIVE WORKSPACE OVER SERVICE-ORIENTED GRID
COLLABORATIVE WORKSPACE OVER SERVICE-ORIENTED GRID SHEN ZHIQI Information Communication Institute of Singapore, School of Electrical and Electronic Engineering, Nanyang Technological University, 50 Nanyang
More informationGoodbye to Fixed Bandwidth Reservation: Job Scheduling with Elastic Bandwidth Reservation in Clouds
Goodbye to Fixed Bandwidth Reservation: Job Scheduling with Elastic Bandwidth Reservation in Clouds Haiying Shen *, Lei Yu, Liuhua Chen &, and Zhuozhao Li * * Department of Computer Science, University
More informationDecision Support System for reducing Post-Harvest Loss in Supply Chain Logistics using geographical Information System in Agriculture
2018 IJSRSET Volume 4 Issue 2 Print ISSN: 2395-1990 Online ISSN : 2394-4099 National Conference on Advanced Research Trends in Information and Computing Technologies (NCARTICT-2018), Department of IT,
More informationIntelligent Agent Supported Flexible Workflow Monitoring System
Intelligent Supported Flexible Workflow System Minhong Wang and Huaiqing Wang Department of Information Systems, City University of Hong Kong Kowloon, Hong Kong {iswmh,iswang}@is.cityu.edu.hk Abstract.
More information