Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling

Song, Shanshan; Hwang, Kai; Kwok, Yue Kuen

doi:10.1109/tc.2006.89

Cited by 175 publications

(108 citation statements)

References 31 publications

Supporting

Mentioning

108

Contrasting

Order By: Relevance

“…Security framework model [19] consists of three main entities, namely cloud customers, service integrators and service providers. The Service Integrator acts like a bridge between the customers and service providers.…”

Section: A Literature Surveymentioning

confidence: 99%

Secure Allocation of Resources in Cloud Using Trust

Usha¹,

Chandrasekaran²

2016

IJCNIS

View full text Add to dashboard Cite

Abstract-Cloud is the recent emerging technology in all aspects. The basic concern with the usage of this Cloud Technology is security. Security poses a major drawback with data storage, resource utilization, virtualization, etc. In the highly competitive environment the assurances are insufficient for the customers to identify the trust worthy cloud service providers. As a result all the entities in cloud and cloud computing environment should be trusted by each other and the entities that have communication should have valid trust on each other. Trust being the profound component in any network has attracted many researchers for research in various ways. The models developed so far are platform dependent and are not valid for heterogeneous platforms. An efficient model which can be ported on any platform is the current research trend in the research world. Our model is platform independent and also helps in calculating trust while migrating to another platform. The result shows that the proposed model is much more efficient in terms of computation time.

show abstract

Section: A Literature Surveymentioning

confidence: 99%

Secure Allocation of Resources in Cloud Using Trust

Usha¹,

Chandrasekaran²

2016

IJCNIS

View full text Add to dashboard Cite

show abstract

“…The results presented by Song et al (2006) were extended by Wu and Sun (2010) by considering the heterogeneity of the fault-tolerance mechanism in securityassured grid job scheduling. The authors defined four types of GA-based online schedulers for the simulation of some fault-tolerance mechanisms, including job retry, job migration (with and without checkpointing) and job replication mechanisms.…”

Section: Related Workmentioning

confidence: 99%

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Kołodziej¹,

Xhafa²

2011

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies, user privileges, etc. On the other, CGs have hierarchical nature and therefore any computational model should be able to effectively express the hierarchical architecture in the optimization model. Recently, researchers have been investigating the use of game theory for modeling user requirements regarding task and resource allocation in grid scheduling problems. In this paper we present two general non-cooperative game approaches, namely, the symmetric non-zero sum game and the asymmetric Stackelberg game for modeling grid user behavior defined as user requirements. In our game-theoretic approaches we are able to cast new requirements arising in allocation problems, such as asymmetric users relations, security and reliability restrictions in CGs. For solving the games, we designed and implemented GA-based hybrid schedulers for approximating the equilibrium points for both games. The proposed hybrid resolution methods are experimentally evaluated through the grid simulator under heterogeneity, and large-scale and dynamics conditions. The relative performance of the schedulers is measured in terms of the makespan and flowtime metrics. The experimental analysis showed high efficiency of meta-heuristics in solving the game-based models, especially in the case of an additional cost of secure task scheduling to be paid by the users.

show abstract

“…The problem from an architectural point of view is studied in Czajkowski et al (1999), Foster et al (2000), Wang and Luo (2004). Security assurance in Grid/Cluster job scheduling is studied in Song et al (2006), Xie and Qin (2008). Other research is focused on economic models in a Grid computing environment, e.g., (Sandholm et al 2006;Buyya et al 2001;Guo and Conitzer 2010).…”

Section: Introductionmentioning

confidence: 99%

Structural properties of the optimal resource allocation policy for single-queue systems

Yang¹,

Bhulai²,

Mei³

2011

Ann Oper Res

View full text Add to dashboard Cite

This paper studies structural properties of the optimal resource allocation policy for single-queue systems. Jobs arrive at a service facility and are sent one by one to a pool of computing resources for parallel processing. The facility poses a constraint on the maximum expected sojourn time of a job. A central decision maker allocates the servers dynamically to the facility. We consider two models: a limited resource allocation model, where the allocation of resources can only be changed at the start of a new service, and a fully flexible allocation model, where the allocation of resources can also change during a service period. In these two models, the objective is to minimize the average utilization costs whilst satisfying the time constraint. To this end, we cast these optimization problems as Markov decision problems and derive structural properties of the relative value function. We show via dynamic programming that (1) the optimal allocation policy has a work-conservation property, and (2) the optimal number of servers follows a step function with as extreme policy the bang-bang control policy. Moreover, (3) we provide conditions under which the bang-bang control policy takes place. These properties give a full characterization of the optimal policy, which are illustrated by numerical experiments.

show abstract

Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling

Cited by 175 publications

References 31 publications

Secure Allocation of Resources in Cloud Using Trust

Secure Allocation of Resources in Cloud Using Trust

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Structural properties of the optimal resource allocation policy for single-queue systems

Contact Info

Product

Resources

About