CHAPTER 6 DYNAMIC SERVICE LEVEL AGREEMENT FOR GRID RESOURCE ALLOCATION

Size: px
Start display at page:

Download "CHAPTER 6 DYNAMIC SERVICE LEVEL AGREEMENT FOR GRID RESOURCE ALLOCATION"

Transcription

1 158 CHAPTER 6 DYNAMIC SERVICE LEVEL AGREEMENT FOR GRID RESOURCE ALLOCATION 6.1 INTRODUCTION In a dynamic and heterogeneous Grid environment providing guaranteed quality of service for user s job is fundamentally important. The quality of service delivered to the client depends crucially on the selection of appropriate subset of available resources. To accomplish this goal, the process of resource selection should not be a simple matchmaking mechanism. Therefore, appropriate resources are selected from the available grid resources that satisfy the application requirements of trust, computation capacity and network capacity and establish dynamic service level agreements to the selected resources to provide guaranteed service to the client. The dynamic service level agreement helps to extend the resource capacity during runtime according to status of job execution and ensures successful completion of jobs by avoiding run time failures and unnecessary job migration common in certain Grid environments. The Grid resource owners have complete control over the resources shared on the Grid and it is important to consider the policy restrictions imposed by the provider during the selection of resources. Service Level Agreements are established between the resource providers and clients only after the resource access and usage policies are accepted by the client.

2 RESOURCE SELECTION STRATEGIES IN COMPUTATIONAL GRID In a computational grid, the resource selection and allocation mechanisms are incorporated at the meta-scheduler level to coordinate the sharing of resources among multiple clients. The selection of single or multiple resources for an application depends on the available computation capacity of the resource at the time of job submission. The existing resource selection mechanisms are merely based on matching the job requirements to the available resources and do not consider the access restriction policy of resources. Therefore, an integrated resource selection framework is developed to select appropriate resources with a concern on security, requirement satisfiability, resource availability, load and access policy restrictions. Computational grids enable sharing of resources and deliver various qualities of service to meet complex user demands. The QoS requirements for a client can be functional requirements as task and data dependencies and/or non-functional requirements as time deadline, budget restrictions and guarantee on bandwidth for data transfer (Brandic et al 2008). The grid supports execution of an application on multiple resources in a parallel fashion to reduce the completion time of the job. Hence, the resource selection strategy has to decide on the optimal number of resources required for job execution as over provisioning of resources increases the complexity of execution and minimizes the utilization of resources. The selected resources are evaluated against the security policy of user and resource provider, the cost constraints and the time deadline specified by the user. The jobs are submitted to these resources after negotiating and establishing SLA between the client and the resource providers. Hence, the problem of resource selection is studied in three different phases and is discussed in detail in the following sections.

3 Quality of Service in Resource Selection In a grid, the client submits his job request along with its QoS requirements. The qualities of service are in general the non-functional requirements that specify the availability, response time, reliability, security and network latency. The provisioning of QoS in grid computing is essential to employ grids in commercial domains apart from scientific research. The VO is highly dynamic and the participating resources can join or leave the VO at any time. Therefore, the users need to know whether they are interacting with the legitimate resource and the data and computations are protected against malicious activities (Humphrey and Thompson 2002). The required level of security is provided by integrating trust as a part of resource selection and it assures the basic entry level security for the client jobs. The trust relationships are established between the client and resource provider considering the domain information, type of activity performed on the resource and the number of jobs successfully executed. The resource access policies are defined for the security of the resource provider. The resource that satisfies all the requirements of the job, but not granting access is not available for job execution. Hence, policies at the site level are considered for selection of resources. The run time failures, reallocation and job migrations are avoided by evaluating the availability of computation and network resources at the time of job submission. User QoS based resource selection provides best effort services for job completion. But, to satisfy the user it is necessary to provide guaranteed service by establishing SLA between the participating resource providers and clients Service Level Agreements in Resource Selection Service Level Agreements guarantee the service quality delivered to the user as committed by the resource provider. The SLA specifies the

4 161 Service Level Objectives (SLO) that must be met by the resource provider. In grid environments, SLA establishment has to be supported at the metascheduler and it enforces restrictions on the resource usage and penalizes the user or the resource providers for violations against the agreements (Balakrishnan et al 2008). SLA should be a dynamic process and agreements are negotiated based on the requirements of the client and capability of resources according to the present environment operating conditions. The various phases of SLA management are SLA negotiation, SLA creation, SLA monitoring and SLA violation. In the negotiation phase, the resource QoS properties are described and it enables the meta-scheduler to select suitable resources according to the QoS requirements of the client. An agreement is created between the client and resource provider stating the service terms and guarantee terms and then the tasks are submitted. The SLA monitoring is done by the third party, the agent through the audit request and response messages. Any violations on the service and/or guarantee terms are noticed and penalties are imposed on the entity that violates the SLA. The SLA is an integral part of resource allocation in grid as the resource providers and users are from different domains bounded by different access and usage policies Policy Based Resource Selection The site level resource access policies and resource usage policies are stored in the policy repository of every VO. In a computational grid, the resources of a site are shared by local jobs and remote jobs submitted by grid users. If the client and resource provider are from different administrative domains, the client has to satisfy the site level policies of the resource. At the meta-scheduler level, the resource selection agent considers the site level policies for resource allocation. The resources that match the user requirements of trust, computation capacity and network capacity are

5 162 checked against the site level and usage policies stated by the resource providers. The local resource policies are taken care by the local resource management systems. The access policy expresses the authentication and authorization policies of resource where as the operational policies specify amount of resources contributed to the grid. These policies do not reveal any private information about the access control policies thus ensuring privacy in heterogeneous environments. The resource selection strategy presented in this work integrates trust, user QoS parameters and site level policies and thus establishes dynamic SLA for guaranteed service and eliminates run time failures that occur due to incompatible user resource pairs. 6.3 DYNAMIC SERVICE LEVEL AGREEMENTS The critical issue in grid environments is to select optimum number of appropriate resources and bind these resources to the client according to the SLA. The existing work assumes that parties know about SLA negotiation protocols and about the SLA templates before entering the negotiation. This assumption does not fit in a grid environment as the clients and resource providers meet each other dynamically and on-demand. Hence, there is a need to establish SLA by specifying the service terms and guarantee terms for every client job Establishing Dynamic SLA In a dynamic service environment, SLA management should be a dynamic process composed of SLA negotiation, definition, auditing, notification of violations and reactive actions if non-compliance is detected (Barbosa et al 2006). The SLA provides the user with the agreed resource capabilities and it should focus on guaranteed service which depends mainly on the successful completion of the submitted job.

6 163 In this work, the idea of dynamic DSLA is presented where the clients can extend the resource usage over a time period based on the forecasted load of the resource and this improves the success rate of the submitted jobs. To establish DSLA, templates are exchanged and service negotiations are performed and finally agreements are established. The resources can be used over an extended period through dynamic SLA in the same agreement Template Creation Every client application is different and the job requirements vary accordingly. The application may be either compute intensive or data intensive. The completion time of the job is decided by the amount of resource allotted and the time period over which these resources are allotted for execution of the tasks. If the required computation power for an application could not be provided by a single resource, then the job is divided into multiple tasks according to the resource capacity of the available resources and assigned to multiple resources. Every job or TS is allowed to execute on a resource after negotiation of SLO and signing of contracts with the resources that commit to provide service satisfying the SLO. To minimize the time involved in service negotiations, the proposed work creates a template to fetch the required information for the job. The templates are exchanged between the potential resource providers and the resource selection agent and SLO are negotiated with only those resources that accept to provide information according to template structure. The template is not a static structure and the template elements are decided for every application by the resource selection agent based on the application requirements. The compute intensive jobs are executed in a computational grid and hence templates are created suitable for these jobs. The basic structure of

7 164 a template contains elements relating to domain identification, site level security policy, trust level, resource usage, response time, support for extension and negotiation protocol. The templates are exchanged and negotiations are initiated with resources that accept the template and other resources that are not willing to provide the required information are neglected. Negotiating SLA only with these selected resources improves the service quality delivered to the client and significantly reduces the time spent for negotiations between the entities Extending Resource Usage The service level agreement that supports extended usage based on the present job execution conditions is called Dynamic SLA. In DSLA, the SLA expiration time is not specified as it provides a mechanism to extend the usage of a resource on which the job is currently in execution. The extension of resource usage is made possible by forecasting the load on the resource for the future n th time period. The forecasted load determines the available computation power of the resource for the next time interval and provides its capabilities beyond the time deadline specified in SLA. The resources that accept to deliver extended service are determined at the initial phases of template exchange. The SLA expires and terminates as the execution is completed successfully thereby enhancing the reliability of the allotted resource. The only limitation of DSLA is that extension would not be possible if the resources are reserved in advance for the specified time duration. The proposed method of DSLA is a more flexible approach and it avoids renegotiations that compromises the stated requirements and negotiates new requirements with the current resource. If renegotiation is not successful, new resources are to be selected and new SLA is to be agreed

8 165 upon for job execution. The above mentioned approaches waste a lot of time in relocation of jobs and leads to performance degradation of grid jobs. Dynamic SLA provides a promising solution to the above stated problems and provides a guaranteed service without unnecessary job migrations and runtime failures due to forced terminations. 6.4 GUARANTEED SERVICE RESOURCE SELECTION STRATEGY In the next generation computing systems, the user application increasingly rely on grids for their execution environments rather than local resources administered by its organization. There are several challenging issues that are to be addressed apart from the basic resource management functions of locating a resource and assigning jobs. These include cross domain trust, managing diverse resource policies, concurrent allocation of multiple resources, prediction of workload and commitments to provide required quality of service. The computational grid architecture is presented as three tier architecture. The middle layer is the resource selection and allocation layer that provides controlled access to the appropriate resources for execution of submitted application. The Guaranteed Service Resource Selection (GSRS) Strategy provides a unified framework for selection of appropriate resources by integrating the quantitative trust of a resource provider and its computation and network capabilities to enable on demand access through workload prediction. The dynamic service level agreements are established with the selected resources and it guarantees the required quality of service for grid jobs. The resource selection framework based on guaranteed service resource selection strategy is shown in Figure 6.1.

9 166 Virtual organization Client 1 App Client 2 App... Client n App Computational Resource Management Client Load Forecast Adaptive Factor Task Manager Task Grouping Single/ Multiple Resources Load Analysis Load Predictio Evaluate Resource Capacity Trust Model Trust Evaluation DT SBT RT OBT OTV Trust Update Trusted Resources User QoS Parameters Network Resource Management File Size Optimal Stripes Parallel Data Transfer Link Capacity Template Exchange SLA Negotiation Establish Agreement SLA Management Selected Resources Dynamic SLA SLA Monitoring Job Execution Management Resource Pool Trust Information Base Resource Allocation Job Execution User Satisfaction Job Status Satisfied SLO CN 1 CN 2 CN n CN 1 CN 2 CN n... CN 1 CN 2 CN n Figure 6.1 Architecture for guaranteed service resource selection strategy

10 Quantitative Execution Trust and User Quality of Service Trust has been recognized as an important factor for selection of appropriate resources in a grid. Trust is evaluated as a combination of qualitative trust and quantitative trust. The quantitative execution trust about a resource is evaluated by considering the components of Subjective Trust and Objective Trust of a resource. The qualitative trust is expressed as a function of user satisfaction and is evaluated from the actual experiences of the user involved in the transactions with the selected resource. The Service Satisfaction (SS R ) for the allotted resource is calculated as given in Equation (6.1), SS STJ * JS * SSLO (6.1) R R where, STJ represents the Status of completion of job, JS the Job Size and SSLO R represents the Satisfied Service Level Objectives of the resource R. The Satisfied Service Level Objectives are determined as the ratio of number of attained SLO to the number of committed SLO. The Service Satisfaction is the direct feedback about the allocated resource. Hence, the qualitative trust value is used as a factor for trust update in the Direct Trust Table of the resource and in the Overall Trust Repository (OTR) of the VO. User Quality of Service The satisfaction level of user depends on the level of QoS achieved for the client application. For every job, the minimum requirements of computation power, network speed, storage space and the QoS parameters as time deadline, response time and cost are specified by the user. Therefore, the resources that satisfy both the application requirements and user QoS parameters are selected for allocation to user jobs.

11 168 To avoid unnecessary job migration due to insufficient resource capability, the proposed model determines the total computation capability that can be offered by the resource. The ACP of a resource is calculated as the difference between the Overall Compute Power of the resource and the Occupied Compute Power of the resource at the submission time instant. The second QoS parameter that is important in resource selection is the Expected Completion Time for the job and is calculated prior to job submission. Selection of resources based on QoS parameters submits the job to the resource that best fits the application requirements and achieves a high level of user satisfaction Optimal Resource Selection with Network Resource Management In a computational grid, a client application is allowed to execute in parallel among multiple remote resources if it requires exhaustive computation power. A known strategy for efficient execution of a huge application is to partition the application into multiple independent tasks and schedule those tasks over a set of available processors (Saleh et al 2012). It is important to choose optimum number of resources for a job as too many resources increase the complexity of job scheduling and communication time for staging necessary input data on these resources. A client application is modeled as a set of tasks and the tasks are grouped according to Resource Capacity for the specified time deadline (RC TD ). Every task set k has m independent tasks that are grouped according to the RCP of the tasks and Resource Capacity as given in Equation. (4.1), TSk m j 1 RCP j where, m RCPj RC andm n TD j 1.

12 169 The optimum number of suitable resources is selected and the task sets are dispatched and scheduled on these resources. This method increases the acceptance rate of the jobs submitted on the grid and also improves the resource utilization. The distributed resources of a grid are connected through WAN. The job completion time is not only based on the computation capacity but also on the network bandwidth at the time of job submission. The Network Weather Service (Wolski 2003) forecasts the network load and provides approximate measurement on the network load for future job scheduling. In practice, the network bandwidth is shared by multiple entities and the speed of the link is relatively stable only for a short period of time and forecasts does not provide accurate network information (Marchal et al 2006). To efficiently utilize the bandwidth of the connected resource, TCP striping mechanism is employed and optimal number of stripes is opened in parallel between the communicating entities. The input data is sliced into equal sized blocks and transferred to the selected resources. To ensure minimum communication time and to avoid the delay in staging necessary input data for job execution, the data is transferred in parallel along multiple stripes determined by Optimal Stripe Size (OPT S ) as given in Equation (4.13). OPT S RLC ALC The network resource management component efficiently manages the network resources according to the present environmental conditions of the grid and utilizes the available bandwidth to its maximum potential in high latency networks.

13 Load Forecast and Managing SLA The resource management in computational grid combines the computational resource management and network resource management. The computational resource management considers the uncertainty of load conditions that prevails in grid due to local job execution and burst load from remote nodes. The pattern of load on resources varies from time to time and hence predicting the workload characteristics is of prime concern in the resource selection process. The jobs executed on multiple resources, require the job start time to be synchronized on all resources such that job is completed within the time limit. The current information of Resource Capacity (RC TD ) makes it possible to predict the workload on a resource at the n th time instant and job is submitted at that time to synchronize the start time of tasks. The Available Computation Power at the forecasted n th time interval (ACP FT ) is evaluated as given in Equation (5.7), ACPFT RCTD FLn 1 where, FL n-1 is the forecasted load at the (n-1) th time instant. The load is predicted based on the statistical properties of load on the resource. The state of the resource changes dynamically and hence short term forecasts offers good prediction accuracy and is useful for making appropriate scheduling decisions. In the Guaranteed Service Resource Selection framework, workload prediction plays a key role in 2 phases. In the pre-execution phase, the selection of appropriate resources through workload prediction strategy improves the acceptance rate and success rate of jobs as job failures due to uncertain load and insufficient computation power is avoided. In the second

14 171 phase, the execution stage, the jobs allocated to the resources are monitored for committed SLO and status of job completion. The jobs currently in execution, if not completed within the agreed time is allowed to extend the execution on the same resource by determining the future availability of resources for a future time period using workload prediction strategy. The Dynamic Service Level Agreements presented in this work has the capability to extend the usage of computational and network resources to complete the execution of the submitted job. The resources are requested to extend the duration of service and extending the resource usage is possible if there is availability of computation power determined by predicted load on the resource. The limitation of DSLA is that extended usage would not be possible if the resources have been reserved in advance for other user s job. The DSLA achieves high reliability for the users of grid as the jobs are completed on the allotted resource without abrupt termination or job migration. 6.5 PERFORMANCE EVALUATION The performance of the GSRS approach is evaluated based on the following performance metrics. Resource Utilization Rate: It is defined as the percentage of the utilized resource power to the available resource power for the resources present in the grid. Job Completion Time: It is defined as the total time taken by the resources for successful completion of the job and includes the job execution time, communication time and SLA creation time.

15 172 Job Success Rate: It is defined as the total number of jobs successfully completed to the total number of jobs submitted to the grid Guaranteed Service Resource Selection Strategy The performance of the proposed Guaranteed Service Resource Selection Strategy (GSRS) is analyzed and discussed. The simulation was based on the grid simulation toolkit GridSim Toolkit 4.0. The capabilities of GridSim have been expanded to support agreements during the process of resource allocation for providing guaranteed service to client applications. Each agreement has an Agreement ID associated with it to keep track of SLO and violations in it. For simulation purposes, five heterogeneous resources with different characteristics such as number of Processing Elements (PE) in a machine, MIPS rating of a PE, type of operating system, site security policy and cost were considered. The simulation is done for multiple client applications that submit different types and size of jobs. We consider the compute intensive jobs and a job can be divided into multiple tasks of varying size according to the resource capacity and resource availability. The performance metrics are evaluated for the applications submitted to the grid. The information of resources used in the simulation is shown in Table The client request for resources and submits the job for execution stating the requirements of security, time limit and cost limit. The GSRS strategy selects single or multiple resources from the Virtual Organization that satisfies trust, site security policy, available resource capability and time deadline. In the present work, we have simulated the widely employed GridWay Meta-scheduler and compared the performance of GSRS strategy with the GridWay meta-scheduler.

16 173 The length of the submitted job varies from 5000MI to MI and the size of the input data to be transferred varies from 1MB to 5MB. The time deadline specified for the client application is 12 seconds. The client applications are submitted to appropriate resources and the GSRS strategy performs divisible job scheduling and executes the task set in parallel to achieve optimal schedules. In the existing approaches, the communication time increases linearly with respect to the number of resources employed for job execution. But, this drawback is overcome in the GSRS strategy and the communication time is reduced as the data is transferred in multiple stripes to/from the remote resources using TCP striping. As optimal number of resources is chosen, the complexity and time overhead for the grid jobs are minimized. Establishing SLA between resource providers and clients provide reliable services to requesting clients without much time overhead. The SLA creation time for different client jobs is given in Table 6.1. and Figure 6.2. Table 6.1 SLA creation time No. of Job Requests SLA Template SLA Creation Time (s) GSRS-Template

17 174 SLA Creation Time (s) SLA Template GSRS- Template Number of Job Requests Figure 6.2 SLA creation time The client job executed on more number of resources requires SLA to be created on all the resources. But, in the GSRS strategy, optimal number of resources are selected based on the resource availability and the predicted load and SLA are established only with these selected resource providers. Therefore the time for SLA creation has been reduced to 65% compared to GridWay which in turn reduces the completion time of jobs. Table 6.2. The Total Completion time of jobs executed on the grid is shown in Table 6.2 Job completion time Job Completion Time (s) No. of Jobs Gridway GSRS

18 175 The Total Completion Time of jobs executed on the grid resources using GSRS strategy and GridWay is depicted in Figure Job Completion Time(s) GSRS Grid way Number of Allotted Jobs Figure 6.3 Job completion time The user specified a time limit of 12 seconds and the proposed GSRS strategy successfully complete the job within a maximum time of 15seconds as it allows dynamic extension of resource usage and avoids run time failures. The SLA creation time, communication time and execution time are reduced to about 40% in the proposed method compared to GridWay. The reduced completion time is due to the load prediction strategy which considers local and remote jobs and predicts the available computation power accurately. The dynamic SLA avoids renegotiations and creation of new SLA to other resources for the jobs currently in execution. The jobs are completed with a small increase in the time deadline given by the user. This increased completion time does not affect the performance of either the resource or the

19 176 job. But, it improves the reliability of the resources as abrupt job terminations are avoided. The jobs divided as TS are executed in parallel and the execution time of the completed jobs is closer to the specified time deadline. It is clear from Figure 6.3, that the maximum extension of resource usage availed is only about 10-15% from the stated time limit. The Success Rate obtained in GSRS and GridWay strategies for the submitted grid jobs are shown in Table 6.3. The proposed GSRS strategy is very reliable as more focus is on selection of resources for client application. The selection is based on multiple criteria as trust level, site security policy, current resource availability and workload prediction. The selected resources are allocated to client after establishing DSLA and thus avoid forced termination due to insufficient resource capabilities. Table 6.3 Job success rate No. of Jobs Job Success Rate (%) GSRS GridWay The Job Success Rate for the proposed GSRS and the existing GridWay approach is shown in Figure 6.4.

20 Job Success Rate (%) GSRS Grid Way Number of Jobs Figure 6.4 Job success rate It is evident that the proposed GSRS strategy performs well compared to GridWay and achieves about 20% higher success rate than GridWay. The GSRS algorithm is evaluated by executing multiple applications and the achieved success rate is more than 92%. The job is put in a pending state if suitable resources are not found for its execution but the probability of this state is less than 5%. The job acceptance rate is about 95% for the proposed algorithm. The Utilization Rate of the resources that participate in the grid for the different proposed approaches as UQS, ORS-G, CLP-DESA and GSRS and the existing GridWay is shown in Table 6.4.

21 178 Table 6.4 Resource utilization rate Resource ID Resource Utilization Rate (%) GridWay UQS ORS-G CLP-DESA GSRS R R R R R The utilization rate of computational grid resources for UQS, ORS-G, CLP-DESA and GSRS strategies is depicted in Figure Utilization Rate (%) UQS ORS-G CLP-DESA GridWay GSRS 10 0 R1 R2 R3 R4 R5 Resource ID Figure 6.5 Resource utilization

22 179 The proposed method allocates task sets to resources based on their present availability and forecasted load. As the forecasted load allows the resources to be used for an increased time period if it is not been reserved and the idle time of resources are reduced leading to increased utilization. The GSRS approach achieves high resource utilization greater than 90% for all resources that are participate in the grid. The utilization of R1 and R5 are very high as they have highest capacity with more number of fast CPUs, high trust value, high bandwidth than R2, R3 and R4. The resource R1 if available has the top priority and client jobs are assigned to it. The jobs are allotted based on the capacity of the resources that best matches the client requirements and jobs are executed on these resources that satisfy the user qualities of service and the maximize the utilization of grid resources. 6.6 SUMMARY The Computational grid to be employed in commercial domains should provision suitable resources with performance guarantee to execute critical jobs submitted by different clients that demands different performance levels. An integrated resource selection framework is presented and it integrates multiple components for incorporating security, user QoS, TCP striping, load forecasting and dynamic service level agreements. The different components of the proposed Guaranteed Service Resource Selection (GSRS) framework are evaluated using different mechanisms and integrated to provide resource selection service. This unified framework is implemented at the meta-scheduler of the virtual organization to select and allocate appropriate resources for the requesting grid users. The DSLA provide the flexibility to extend the usage of allotted resources even after the time duration given in the agreement. The Grid jobs achieves a very high success rate as dynamic SLA allow the jobs to complete

23 180 the execution by extending the usage of allotted resources and avoid job migrations and forceful job terminations. The main focus of this work is on selection of appropriate trustworthy resources because if suitable resources are selected at the initial phases of job submission the chances of malicious attacks, runtime failures, job terminations and job migrations are highly reduced. There is a significant improvement in the performance of the whole Grid system as the utilization of the Grid resources are maximized and level of satisfaction attained by the users are also high. Hence, the computational Grid is viable to be employed in commercial and Business domains.

Packet Scheduling in Cloud by Employing Genetic Algorithm

Packet 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 information

Trade-off between Power Consumption and Total Energy Cost in Cloud Computing Systems. Pranav Veldurthy CS 788, Fall 2017 Term Paper 2, 12/04/2017

Trade-off between Power Consumption and Total Energy Cost in Cloud Computing Systems. Pranav Veldurthy CS 788, Fall 2017 Term Paper 2, 12/04/2017 Trade-off between Power Consumption and Total Energy Cost in Cloud Computing Systems Pranav Veldurthy CS 788, Fall 2017 Term Paper 2, 12/04/2017 Outline Introduction System Architectures Evaluations Open

More information

Graph Optimization Algorithms for Sun Grid Engine. Lev Markov

Graph Optimization Algorithms for Sun Grid Engine. Lev Markov Graph Optimization Algorithms for Sun Grid Engine Lev Markov Sun Grid Engine SGE management software that optimizes utilization of software and hardware resources in heterogeneous networked environment.

More information

ProRenaTa: Proactive and Reactive Tuning to Scale a Distributed Storage System

ProRenaTa: Proactive and Reactive Tuning to Scale a Distributed Storage System ProRenaTa: Proactive and Reactive Tuning to Scale a Distributed Storage System Ying Liu, Navaneeth Rameshan, Enric Monte, Vladimir Vlassov and Leandro Navarro 2015 15th IEEE/ACM International Symposium

More information

Resource Scheduling in Hybrid Grid Environment

Resource 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 information

Towards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems

Towards 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 information

Failure Recovery in Distributed Environments with Advance Reservation Management Systems

Failure Recovery in Distributed Environments with Advance Reservation Management Systems Failure Recovery in Distributed Environments with Advance Reservation Management Systems Lars-Olof Burchard, Barry Linnert {baron,linnert}@cs.tu-berlin.de Technische Universitaet Berlin, GERMANY Abstract.

More information

Timed/Advance Reservation Schemes and Scheduling Algorithms for QoS Resource Management in Grids

Timed/Advance Reservation Schemes and Scheduling Algorithms for QoS Resource Management in Grids CHAPTER 16 Timed/Advance Reservation Schemes and Scheduling Algorithms for QoS Resource Management in Grids Emmanuel Varvarigos University of Patras, Department of Computer Engineering and Informatics,

More information

CSC 553 Operating Systems

CSC 553 Operating Systems CSC 553 Operating Systems Lecture 9 - Uniprocessor Scheduling Types of Scheduling Long-term scheduling The decision to add to the pool of processes to be executed Medium-term scheduling The decision to

More information

Virtual Workspaces Dynamic Virtual Environments in the Grid

Virtual Workspaces Dynamic Virtual Environments in the Grid Virtual Workspaces Dynamic Virtual Environments in the Grid October 5, 2006 ESAC Grid Workshop '06 Borja Sotomayor University of Chicago Index Virtual Workspaces What is a workspace? Why are VM-based workspaces

More information

CHAPTER 6 RESULTS AND DISCUSSION

CHAPTER 6 RESULTS AND DISCUSSION 76 CHAPTER 6 RESULTS AND DISCUSSION This chapter discusses the details of agent based model for monitoring and describes about the mobile agent s role in the monitoring. This chapter discusses experimental

More information

Processor Co-Allocation Enabling Advanced Reservation of Jobs using Priorities in MultiCluster Systems

Processor Co-Allocation Enabling Advanced Reservation of Jobs using Priorities in MultiCluster Systems Processor Co-Allocation Enabling Advanced Reservation of Jobs using Priorities in MultiCluster Systems A.C.Kaladevi, Department of Computer Science and Engineering, Sona College of Technology, Salem, India.

More information

A Dynamic Job Grouping-Based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids

A Dynamic Job Grouping-Based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids A Dynamic ing-based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids Nithiapidary Muthuvelu, Junyang Liu, Nay Lin Soe, Srikumar Venugopal, Anthony Sulistio and Rajkumar Buyya

More information

February 14, 2006 GSA-WG at GGF16 Athens, Greece. Ignacio Martín Llorente GridWay Project

February 14, 2006 GSA-WG at GGF16 Athens, Greece. Ignacio Martín Llorente GridWay Project February 14, 2006 GSA-WG at GGF16 Athens, Greece GridWay Scheduling Architecture GridWay Project www.gridway.org Distributed Systems Architecture Group Departamento de Arquitectura de Computadores y Automática

More information

Mapping Service-Orientation to TOGAF 9 Part IV: Applying Service-Orientation to TOGAF s Service Contracts

Mapping Service-Orientation to TOGAF 9 Part IV: Applying Service-Orientation to TOGAF s Service Contracts Mapping Service-Orientation to TOGAF 9 Part IV: Applying Service-Orientation to TOGAF s Service Contracts by Filippos Santas, Credit Suisse Private Banking in Switzerland In this series of articles we

More information

ICIMTR International Conference on Innovation, Management and Technology Research, Malaysia, September, 2013

ICIMTR International Conference on Innovation, Management and Technology Research, Malaysia, September, 2013 Available online at www.sciencedirect.com ScienceDirect Procedia - Social and Behavioral Scien ce s 129 ( 2014 ) 436 440 ICIMTR 2013 International Conference on Innovation, Management and Technology Research,

More information

Oracle s Hyperion System 9 Strategic Finance

Oracle s Hyperion System 9 Strategic Finance Oracle s Hyperion System 9 Strategic Finance June 2007 Light Use... 3 Heavy Use... 3 Client Machine... 3 Server Machine... 3 Client Machine... 3 Server Machine... 3 Data Integration... 3 The Hyperion System

More information

Cost-based Job Grouping and Scheduling Algorithm for Grid Computing Environments

Cost-based Job Grouping and Scheduling Algorithm for Grid Computing Environments Cost-based Job Grouping and Scheduling Algorithm for Grid Computing Environments Sonal Yadav M.Tech (CSE) Sharda University Greater Noida, India Amit Agarwal, Ph.D Associate Professor University of Petroleum

More information

Enhancing Resource Reservation by Applying Defer Time in FCFS Scheme for Grid Computing Environments

Enhancing 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 information

Cluster Workload Management

Cluster Workload Management Cluster Workload Management Goal: maximising the delivery of resources to jobs, given job requirements and local policy restrictions Three parties Users: supplying the job requirements Administrators:

More information

Trust Based Grid Scheduling Algorithm for Commercial Grids

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 information

Australian Journal of Basic and Applied Sciences. LB Scheduling for Advanced Reservation and Queuing Using TBRA in Grid Computing Environments

Australian Journal of Basic and Applied Sciences. LB Scheduling for Advanced Reservation and Queuing Using TBRA in Grid Computing Environments AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com LB Scheduling for Advanced Reservation and Queuing Using TBRA in Grid Computing Environments

More information

Application of Min-Min and Max-Min Algorithm for Task Scheduling in Cloud Environment Under Time Shared and Space Shared VM Models *

Application of Min-Min and Max-Min Algorithm for Task Scheduling in Cloud Environment Under Time Shared and Space Shared VM Models * International Journal of Computing Academic Research (IJCAR) ISSN 235-9184, Volume 4, Number 6 (December 215), pp.182-19 MEACSE Publications http://www.meacse.org/ijcar Application of Min-Min and Max-Min

More information

A Proactive Fault Tolerant Strategy for Desktop Grid

A 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 information

D5.1 Inter-Layer Cloud Stack Adaptation Summary

D5.1 Inter-Layer Cloud Stack Adaptation Summary D5.1 Inter-Layer Cloud Stack Adaptation Summary The ASCETiC architecture focuses on providing novel methods and tools to support software developers aiming at optimising energy efficiency resulting from

More information

Improving Throughput and Utilization in Parallel Machines Through Concurrent Gang

Improving Throughput and Utilization in Parallel Machines Through Concurrent Gang Improving Throughput and Utilization in Parallel Machines Through Concurrent Fabricio Alves Barbosa da Silva Laboratoire ASIM, LIP6 Universite Pierre et Marie Curie Paris, France fabricio.silva@lip6.fr

More information

Workflow Management Business Engineering

Workflow Management Business Engineering Workflow Management Business Engineering Workflows and Web Services Kapitel 7 1 The Notion of Business (Re)Engineering Business Reengineering = The fundamental rethinking and radical redesign of business

More information

PhD Proposal Economically enhanced autonomic resource allocation for datacenters on Cloud computing markets. Mario Macías Advisor: Jordi Guitart

PhD Proposal Economically enhanced autonomic resource allocation for datacenters on Cloud computing markets. Mario Macías Advisor: Jordi Guitart PhD Proposal Economically enhanced autonomic resource allocation for datacenters on Cloud computing markets Mario Macías Advisor: Jordi Guitart June 4, 2010 2 Abstract Cloud Computing markets arise as

More information

Motivation. Types of Scheduling

Motivation. Types of Scheduling Motivation 5.1 Scheduling defines the strategies used to allocate the processor. Successful scheduling tries to meet particular objectives such as fast response time, high throughput and high process efficiency.

More information

A Scalability and Performance Evaluation of a Distributed Usage SLA-based Broker in Large Grid Environments

A Scalability and Performance Evaluation of a Distributed Usage SLA-based Broker in Large Grid Environments 1 A Scalability and Performance Evaluation of a Distributed Usage SLA-based Broker in Large Grid Environments *Computer Science Department The University of Chicago {cldumitr,iraicu}@cs.uchicago.edu Catalin

More information

Experimental Analysis on Autonomic Strategies for Cloud Elasticity T HOMAS L E DOUX

Experimental Analysis on Autonomic Strategies for Cloud Elasticity T HOMAS L E DOUX 2015 International Conference on Cloud Computing and Autonomic Computing Experimental Analysis on Autonomic Strategies for Cloud Elasticity SIMON DUPONT, J O NAT HAN LEJEUNE, FREDERICO ALVARES T HOMAS

More information

W911NF Project - Mid-term Report

W911NF Project - Mid-term Report W911NF-08-1-0041 Project - Mid-term Report Agent Technology Center, Czech Technical University in Prague Michal Pechoucek 1 Accomplishments for the First 6 Months 1.1 Scenario and Demos During the first

More information

Optimized Virtual Resource Deployment using CloudSim

Optimized Virtual Resource Deployment using CloudSim Optimized Virtual Resource Deployment using CloudSim Anesul Mandal Software Professional, Aptsource Software Pvt. Ltd., A-5 Rishi Tech Park, New Town, Rajarhat, Kolkata, India. Kamalesh Karmakar Assistant

More information

Batch Resizing Policies and Techniques for Fine- Grain Grid Tasks: The Nuts and Bolts

Batch Resizing Policies and Techniques for Fine- Grain Grid Tasks: The Nuts and Bolts Journal of Information Processing Systems, Vol.7, No.2, June 2011 DOI : 10.3745/JIPS.2011.7.2.299 Batch Resizing Policies and Techniques for Fine- Grain Grid Tasks: The Nuts and Bolts Nithiapidary Muthuvelu*,

More information

GROUPING BASED USER DEMAND AWARE JOB SCHEDULING APPROACH FOR COMPUTATIONAL GRID

GROUPING 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 information

AN ENERGY EFFICIENT SCHEME FOR CLOUD RESOURCE PROVISIONING USING TASK SCHEDULING STRATEGY BASED ON VACATION QUEUING THEORY

AN ENERGY EFFICIENT SCHEME FOR CLOUD RESOURCE PROVISIONING USING TASK SCHEDULING STRATEGY BASED ON VACATION QUEUING THEORY AN ENERGY EFFICIENT SCHEME FOR CLOUD RESOURCE PROVISIONING USING TASK SCHEDULING STRATEGY BASED ON VACATION QUEUING THEORY M.Sarojinidevi Department of Computer Science and Engineering K.Ramakrishnan College

More information

Cloud Computing Concept, Technology & Architecture

Cloud Computing Concept, Technology & Architecture Cloud Computing Concept, Technology & Architecture Chapter 09 Cloud Management Mechanics 課程名稱 : 雲端管理系統 授課教師 : 高勝助 Contents Cloud-based IT resources need to be set up, configured, maintained, and monitored.

More information

Module: Building the Cloud Infrastructure

Module: Building the Cloud Infrastructure Upon completion of this module, you should be able to: Describe the cloud computing reference model Describe the deployment options and solutions for building a cloud infrastructure Describe various factors

More information

INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN

INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 SURVEY ON META-SCHEDULER IN GRID ENVIRONMENT P.Priscilla 1, Mr. P.Karthikeyan 2 1 PG Full Time Student, CSE Department,

More information

Learning Based Admission Control. Jaideep Dhok MS by Research (CSE) Search and Information Extraction Lab IIIT Hyderabad

Learning Based Admission Control. Jaideep Dhok MS by Research (CSE) Search and Information Extraction Lab IIIT Hyderabad Learning Based Admission Control and Task Assignment for MapReduce Jaideep Dhok MS by Research (CSE) Search and Information Extraction Lab IIIT Hyderabad Outline Brief overview of MapReduce MapReduce as

More information

Workflow Management Business (Re)Engineering

Workflow Management Business (Re)Engineering Workflow Management Business (Re)Engineering Workflows and Web Services Kapitel 7 1 The Notion of Business (Re)Engineering Business Reengineering = The fundamental rethinking and radical redesign of business

More information

Product Brief SysTrack VMP

Product Brief SysTrack VMP Product Brief SysTrack VMP Benefits Optimize desktop and server virtualization and terminal server projects Anticipate and handle problems in the planning stage instead of postimplementation Use iteratively

More information

HLF: A Dynamic Scheduling Algorithm for Task Scheduling in Cloud Computing

HLF: A Dynamic Scheduling Algorithm for Task Scheduling in Cloud Computing HLF: A Dynamic Scheduling Algorithm for Task Scheduling in Cloud Computing Santhosh B 1, Prachi Kaneria A 2, Dr. Manjaiah D.H 3 Dept. of MCA, AIMIT, St. Aloysius College (Autonomous), Mangalore, Karnataka,

More information

Real-Time and Embedded Systems (M) Lecture 4

Real-Time and Embedded Systems (M) Lecture 4 Clock-Driven Scheduling Real-Time and Embedded Systems (M) Lecture 4 Lecture Outline Assumptions and notation for clock-driven scheduling Handling periodic jobs Static, clock-driven schedules and the cyclic

More information

Grouping-Based Job Scheduling in Cloud computing using Ant Colony Framework

Grouping-Based Job Scheduling in Cloud computing using Ant Colony Framework ing-based Job Scheduling in Cloud computing using Ant Colony Framework Madhusree Kuanr*, Prithviraj Mohanty**, Suresh Chandra Moharana*** *(Department of Computer Science, Vivekananda Institute of Technology,

More information

Global Workload Manager Overview

Global Workload Manager Overview Global Workload Manager Overview Dan Herington Infrastructure Solutions Division 2004 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice The

More information

Trust and Reputation Based Association Among Grid Entities

Trust 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 information

Scheduling and Resource Management in Grids

Scheduling 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 information

Best in Service Program Overview

Best in Service Program Overview Best in Service Program Overview Effective November 1, 2016 Contents Overview... 3 1.1 What is Best in Service?... 3 1.2 Program Goals... 3 1.3 Data Center Considerations... 4 1.4 Designation Types: Orange

More information

QoS-based Scheduling for Task Management in Grid Computing

QoS-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 information

InfoSphere DataStage Grid Solution

InfoSphere DataStage Grid Solution InfoSphere DataStage Grid Solution Julius Lerm IBM Information Management 1 2011 IBM Corporation What is Grid Computing? Grid Computing doesn t mean the same thing to all people. GRID Definitions include:

More information

Clairvoyant Site Allocation of Jobs with Highly Variable Service Demands in a Computational Grid

Clairvoyant Site Allocation of Jobs with Highly Variable Service Demands in a Computational Grid Clairvoyant Site Allocation of Jobs with Highly Variable Service Demands in a Computational Grid Stylianos Zikos and Helen Karatza Department of Informatics Aristotle University of Thessaloniki 54124 Thessaloniki,

More information

Distributed Accounting on the Grid

Distributed 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 information

Evaluating Workflow Trust using Hidden Markov Modeling and Provenance Data

Evaluating Workflow Trust using Hidden Markov Modeling and Provenance Data Evaluating Workflow Trust using Hidden Markov Modeling and Provenance Data Mahsa Naseri and Simone A. Ludwig Abstract In service-oriented environments, services with different functionalities are combined

More information

A case for cooperative and incentive-based federation of distributed clusters

A 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 information

A case for cooperative and incentive-based federation of distributed clusters

A 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 information

Job Scheduling with Lookahead Group Matchmaking for Time/Space Sharing on Multi-core Parallel Machines

Job Scheduling with Lookahead Group Matchmaking for Time/Space Sharing on Multi-core Parallel Machines Job Scheduling with Lookahead Group Matchmaking for Time/Space Sharing on Multi-core Parallel Machines Xijie Zeng and Angela Sodan University of Windsor, Windsor ON N9B 3P4, Canada zengx@uwindsor.ca,acsodan@uwindsor.ca

More information

ISACA Systems Implementation Assurance February 2009

ISACA Systems Implementation Assurance February 2009 ISACA Pressures Today Pressure to increase realization of value from IT spending Pressure to deliver on IT projects at a time when resources/budgets are constrained Pressure from risk of technology-based

More information

Energy Aware Resource Allocation for Data Center

Energy Aware Resource Allocation for Data Center Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 1 (2017) pp. 1-9 Research India Publications http://www.ripublication.com Energy Aware Resource Allocation for Data Center

More information

Research Perspectives for Dynamic SLA Management

Research Perspectives for Dynamic SLA Management Ramin Yahyapour, Dortmund University of Technology SLA@SOI: Research Perspectives for Dynamic SLA Management Workshop on Dynamic Service Level Agreements Barcelona, Spain, 2008 02. June 2008 Content SLA@SOI

More information

Super Schlumberger Scheduler

Super Schlumberger Scheduler Software Requirements Specification for Super Schlumberger Scheduler Page 1 Software Requirements Specification for Super Schlumberger Scheduler Version 0.2 Prepared by Design Team A Rice University COMP410/539

More information

Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny

Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia mifawzi@ksu.edu.sa Keywords:

More information

CMS readiness for multi-core workload scheduling

CMS readiness for multi-core workload scheduling CMS readiness for multi-core workload scheduling Antonio Pérez-Calero Yzquierdo, on behalf of the CMS Collaboration, Computing and Offline, Submission Infrastructure Group CHEP 2016 San Francisco, USA

More information

Managing 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 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 information

10/1/2013 BOINC. Volunteer Computing - Scheduling in BOINC 5 BOINC. Challenges of Volunteer Computing. BOINC Challenge: Resource availability

10/1/2013 BOINC. Volunteer Computing - Scheduling in BOINC 5 BOINC. Challenges of Volunteer Computing. BOINC Challenge: Resource availability Volunteer Computing - Scheduling in BOINC BOINC The Berkley Open Infrastructure for Network Computing Ryan Stern stern@cs.colostate.edu Department of Computer Science Colorado State University A middleware

More information

Service Oriented Architecture

Service Oriented Architecture Service Oriented Architecture Part I INTRODUCING SOA Service Oriented Architecture- Presented by Hassan.Tanabi@Gmail.com 2 Fundamental SOA 1. The term "service-oriented" has existed for some time, it has

More information

Service-Oriented Computing

Service-Oriented Computing Service-Oriented Computing edited by Dimitrios Georgakopoulos and Michael P. Papazoglou The MIT Press Cambridge, Massachusetts London, England 2009 Massachusetts Institute of Technology All rights reserved.

More information

Research Statement. Nilabja Roy. August 18, 2010

Research Statement. Nilabja Roy. August 18, 2010 Research Statement Nilabja Roy August 18, 2010 1 Doctoral Dissertation Large-scale, component-based distributed systems form the backbone of many service-oriented applications, ranging from Internet portals

More information

Research Article Agent Based Load Balancing Mechanisms in Federated Cloud

Research Article Agent Based Load Balancing Mechanisms in Federated Cloud Research Journal of Applied Sciences, Engineering and Technology 13(8): 632-637, 2016 DOI:10.19026/rjaset.13.3049 ISSN: 2040-7459; e-issn: 2040-7467 2016 Maxwell Scientific Publication Corp. Submitted:

More information

Secure information access is critical & more complex than ever

Secure information access is critical & more complex than ever WHITE PAPER Purpose-built Cloud Platform for Enabling Identity-centric and Internet of Things Solutions Connecting people, systems and things across the extended digital business ecosystem. Secure information

More information

IBM System Storage. IBM Information Archive: The next-generation information retention solution

IBM System Storage. IBM Information Archive: The next-generation information retention solution IBM System Storage IBM Information Archive: The next-generation information retention solution Highlights Reduce cost Reduce disk capacity requirements with built-in data deduplication and compression

More information

An Economic Allocation of Resources for Divisible Workloads in Grid Computing Paradigm

An Economic Allocation of Resources for Divisible Workloads in Grid Computing Paradigm European Journal of Scientific Research ISS 1450-216X Vol.65 o.3 (2011), pp. 434-443 EuroJournals Publishing, Inc. 2011 http://www.europeanjournalofscientificresearch.com An Economic Allocation of Resources

More information

A NEW SELECTION ALGORITHM BASED ON REPUTATION AND CONTRACT-MANAGEMENT

A NEW SELECTION ALGORITHM BASED ON REPUTATION AND CONTRACT-MANAGEMENT A NEW SELECTION ALGORITHM BASED ON REPUTATION AND CONTRACT-MANAGEMENT 1 LINGYU XU, 2 YINGHUA SUN 1 Lecturer, International College, Qingdao University,China 2 Assoc. Prof., Information and Engineering

More information

Optimizing Grid-Based Workflow Execution

Optimizing Grid-Based Workflow Execution Journal of Grid Computing (2006) 3: 201 219 # Springer 2006 DOI: 10.1007/s10723-005-9011-7 Optimizing Grid-Based Workflow Execution Gurmeet Singh j, Carl Kesselman and Ewa Deelman Information Sciences

More information

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 54006 Thessaloniki, Greece karatza@csd.auth.gr Abstract

More information

CS510 Operating System Foundations. Jonathan Walpole

CS510 Operating System Foundations. Jonathan Walpole CS510 Operating System Foundations Jonathan Walpole Project 3 Part 1: The Sleeping Barber problem - Use semaphores and mutex variables for thread synchronization - You decide how to test your code!! We

More information

Service Theory. Fundamentals of Communications Networks 1

Service Theory. Fundamentals of Communications Networks 1 Service Theory Fundamentals of Communications Networks 1 Communications services We saw that Vail introduced the notion of a communications service and that today we pay mostly for Quality of Service Classic

More information

An 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 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 information

Resource management in IaaS cloud. Fabien Hermenier

Resource management in IaaS cloud. Fabien Hermenier Resource management in IaaS cloud Fabien Hermenier where to place the VMs? how much to allocate 1What can a resource manager do for you 3 2 Models of VM scheduler 4 3Implementing VM schedulers 5 1What

More information

CIMFLOW A WORKFLOW MANAGEMENT SYSTEM BASED ON INTEGRATION PLATFORM ENVIRONMENT

CIMFLOW A WORKFLOW MANAGEMENT SYSTEM BASED ON INTEGRATION PLATFORM ENVIRONMENT CIMFLOW A WORKFLOW MANAGEMENT SYSTEM BASED ON INTEGRATION PLATFORM ENVIRONMENT Haibin Luo Yushun Fan State CIMS Engineering and Research Center, Dept. of Automation, Tsinghua University Beijing, P.R. China.

More information

A Profile Guided Approach to Scheduling in Cluster and Multi-cluster Systems

A Profile Guided Approach to Scheduling in Cluster and Multi-cluster Systems A Profile Guided Approach to Scheduling in Cluster and Multi-cluster Systems Arvind Sridhar and Dan Stanzione Ph. D. {ahsridha, dstanzi}@asu.edu Fulton High Performance Computing, Arizona State University

More information

Enabling Resource Sharing between Transactional and Batch Workloads Using Dynamic Application Placement

Enabling Resource Sharing between Transactional and Batch Workloads Using Dynamic Application Placement Enabling Resource Sharing between Transactional and Batch Workloads Using Dynamic Application Placement David Carrera 1, Malgorzata Steinder 2, Ian Whalley 2, Jordi Torres 1, and Eduard Ayguadé 1 1 Technical

More information

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out

More information

SE350: Operating Systems. Lecture 6: Scheduling

SE350: Operating Systems. Lecture 6: Scheduling SE350: Operating Systems Lecture 6: Scheduling Main Points Definitions Response time, throughput, scheduling policy, Uniprocessor policies FIFO, SJF, Round Robin, Multiprocessor policies Scheduling sequential

More information

CPU scheduling. CPU Scheduling

CPU scheduling. CPU Scheduling EECS 3221 Operating System Fundamentals No.4 CPU scheduling Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University CPU Scheduling CPU scheduling is the basis of multiprogramming

More information

INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS

INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 AN IMPRESSION ON PERFORMANCE METRICS FOR SCHEDULING PROBLEM IN GRID COMPUTING ENVIRONMENT Abstract D. Thilagavathi

More information

Job Scheduling Challenges of Different Size Organizations

Job Scheduling Challenges of Different Size Organizations Job Scheduling Challenges of Different Size Organizations NetworkComputer White Paper 2560 Mission College Blvd., Suite 130 Santa Clara, CA 95054 (408) 492-0940 Introduction Every semiconductor design

More information

Chapter 9 Uniprocessor Scheduling

Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles Chapter 9 Uniprocessor Scheduling Eighth Edition By William Stallings Table 9.1 Types of Scheduling Long- t er m schedul i ng The decision to add to the

More information

A Hybrid Scheduling Approach for Scalable Heterogeneous Hadoop Systems

A Hybrid Scheduling Approach for Scalable Heterogeneous Hadoop Systems A Hybrid Scheduling Approach for Scalable Heterogeneous Hadoop Systems Aysan Rasooli Department of Computing and Software McMaster University Hamilton, Canada Email: rasooa@mcmaster.ca Douglas G. Down

More information

PRIORITY BASED SCHEDULING IN CLOUD COMPUTING BASED ON TASK AWARE TECHNIQUE

PRIORITY BASED SCHEDULING IN CLOUD COMPUTING BASED ON TASK AWARE TECHNIQUE RESEARCH ARTICLE OPEN ACCESS PRIORITY BASED SCHEDULING IN CLOUD COMPUTING BASED ON TASK AWARE TECHNIQUE Jeevithra.R *, Karthikeyan.T ** * (M.Phil Computer Science Student Department of Computer Science)

More information

A Systematic Approach to Performance Evaluation

A Systematic Approach to Performance Evaluation A Systematic Approach to Performance evaluation is the process of determining how well an existing or future computer system meets a set of alternative performance objectives. Arbitrarily selecting performance

More information

CIM Forum Charter Dated

CIM Forum Charter Dated CIM Forum Charter Dated 2018-12-18 The information provided below is subject to change and reflects the current state of the CIM Forum charter within the DMTF. Management Problem(s) and Environment The

More information

Burstiness-aware service level planning for enterprise application clouds

Burstiness-aware service level planning for enterprise application clouds Youssef and Krishnamurthy Journal of Cloud Computing: Advances, Systems and Applications (2017) 6:17 DOI 10.1186/s13677-017-0087-y Journal of Cloud Computing: Advances, Systems and Applications RESEARCH

More information

PERFORMANCE MANAGEMENT AND AVAILABILITY SOLUTIONS OVERVIEW

PERFORMANCE MANAGEMENT AND AVAILABILITY SOLUTIONS OVERVIEW PERFORMANCE MANAGEMENT PERFORMANCE MANAGEMENT AND AVAILABILITY S OVERVIEW Featuring: ASG-TMON Product Family PERFORMANCE MANAGEMENT AND AVAILABILITY S OVERVIEW ASG PERFORMANCE MANAGEMENT AND AVAILABILITY

More information

DEVELOPMENTS IN WESTERN MARKETS: RENEWABLES AND EXPANSION OF ORGANIZED MARKETS IN THE WEST

DEVELOPMENTS IN WESTERN MARKETS: RENEWABLES AND EXPANSION OF ORGANIZED MARKETS IN THE WEST DEVELOPMENTS IN WESTERN MARKETS: RENEWABLES AND EXPANSION OF ORGANIZED MARKETS IN THE WEST Power Regulatory Webinar Series Deanna E. King Stephen J. Hug September 28, 2016 CURRENT DEVELOPMENTS IN WESTERN

More information

Service Provision and Composition in Virtual Business Communities

Service Provision and Composition in Virtual Business Communities Service Provision and Composition in Virtual Business Communities Giacomo Piccinelli Extended Enterprise Laboratory HP Laboratories Bristol HPL-1999-84 16th July, 1999* E-mail: giacomo-piccinelli@hp.com

More information

Online vaccines and immunizations service based on resource management techniques in cloud computing.

Online vaccines and immunizations service based on resource management techniques in cloud computing. Biomedical Research 2016; Special Issue: S392-S399 ISSN 0970-938X www.biomedres.info Online vaccines and immunizations service based on resource management techniques in cloud computing. Tamil Vizhi 1*,

More information

IBM ICE (Innovation Centre for Education) Welcome to: Unit 1 Overview of delivery models in Cloud Computing. Copyright IBM Corporation

IBM ICE (Innovation Centre for Education) Welcome to: Unit 1 Overview of delivery models in Cloud Computing. Copyright IBM Corporation Welcome to: Unit 1 Overview of delivery models in Cloud Computing 9.1 Unit Objectives After completing this unit, you should be able to: Understand cloud history and cloud computing Describe the anatomy

More information

Announcements. Program #1. Reading. Is on the web Additional info on elf file format is on the web. Chapter 6. CMSC 412 S02 (lect 5)

Announcements. Program #1. Reading. Is on the web Additional info on elf file format is on the web. Chapter 6. CMSC 412 S02 (lect 5) Program #1 Announcements Is on the web Additional info on elf file format is on the web Reading Chapter 6 1 Selecting a process to run called scheduling can simply pick the first item in the queue called

More information

SAP Cloud Platform Pricing and Packages

SAP Cloud Platform Pricing and Packages Pricing and Packages Get Started Packages Fast. Easy. Cost-effective. Get familiar and up-and-running with Platform in no time flat. Intended for non-production use. Designed to help users become familiar

More information