{"title":"Scientific workflow scheduling in computational grids — Planning, reservation, and data/network-awareness","authors":"Yonghong Yan, B. Chapman","doi":"10.1109/GRID.2007.4354111","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354111","url":null,"abstract":"A very important issue in executing a scientific workflow in computational grids is how to map and schedule workflow tasks onto multiple distributed resources and handle task dependencies in a timely manner to deliver users' expected performance. In this paper, we present our work to develop and evaluate an advanced workflow scheduler in computational grid environments, the GRACCE scheduler. The GRACCE scheduler applies advanced scheduling techniques, such as resource negotiation and reservation, data/network-aware scheduling and performance prediction in the resource allocation and execution planning process. To evaluate the scheduler, we have set up an experimental environment that models a computational grid in those aspects relevant to workflow scheduling. Our results show the average performance improvement, using the GRACCE scheduler, is about 20% under high resource loads.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127495903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Chazapis, G. Tsoukalas, Georgios Verigakis, K. Kourtis, A. Sotiropoulos, N. Koziris
{"title":"Global-scale peer-to-peer file services with DFS","authors":"A. Chazapis, G. Tsoukalas, Georgios Verigakis, K. Kourtis, A. Sotiropoulos, N. Koziris","doi":"10.1109/GRID.2007.4354140","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354140","url":null,"abstract":"The global inter-networking infrastructure that has become essential for contemporary day-to-day computing and communication tasks, has also enabled the deployment of several large-scale data sharing overlays. Communities collaboratively aggregate and distribute tile and storage resources either in the controlled environment of the Grid, or hidden under the anonymity cloak created by peer-to-peer protocols. Both designs exhibit unique properties and characteristics: Peer-to-peer algorithms address the formation of vast, heterogeneous and dynamic sharing networks, while Grids focus on policy enforcement and accounting features. A distributed data management facility that will assimilate respective practices has been envisioned by numerous related research initiatives, especially when there is a need to incorporate disperse resources in large pools, without relinquishing participants of their respective rights. In this paper, we describe the Distributed File Services (DFS) architecture - a peer-to-peer service overlay, which allows distinct administrative entities to form arbitrary tile distribution relationships. Each DFS peer can be uniquely authenticated and maintains direct control of its own namespace and storage assets by defining corresponding authorization directives and policies. The peer-to-peer nature of the system allows for scalable deployment and resource allocation, either in a stand-alone scenario or in the Grid context. Moreover, we introduce the notion of a \"web of files\", as a non-hierarchical, global-scale namespace of distributed data collections and elaborate on a prototype implementation that features novel semantics for integrating our architectural principles and concepts into the operating system level.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127869396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Chervenak, E. Deelman, M. Livny, Mei-Hui Su, R. Schuler, S. Bharathi, Gaurang Mehta, K. Vahi
{"title":"Data placement for scientific applications in distributed environments","authors":"A. Chervenak, E. Deelman, M. Livny, Mei-Hui Su, R. Schuler, S. Bharathi, Gaurang Mehta, K. Vahi","doi":"10.1109/GRID.2007.4354142","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354142","url":null,"abstract":"Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute data in ways that are advantageous for application execution, for example, by placing data sets so that they may be staged into or out of computations efficiently or by replicating them for improved performance and reliability. In particular, we propose to study the relationship between data placement services and workflow management systems. In this paper, we explore the interactions between two services used in large-scale science today. We evaluate the benefits of prestaging data using the Data Replication Service versus using the native data stage-in mechanisms of the Pegasus workflow management system. We use the astronomy application, Montage, for our experiments and modify it to study the effect of input data size on the benefits of data prestaging. As the size of input data sets increases, prestaging using a data placement service can significantly improve the performance of the overall analysis.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134574537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Rossetto, Vinicius C. M. Borges, A. C. Silva, M. Dantas
{"title":"SuMMIT - A framework for coordinating applications execution in mobile grid environments","authors":"A. Rossetto, Vinicius C. M. Borges, A. C. Silva, M. Dantas","doi":"10.1109/GRID.2007.4354125","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354125","url":null,"abstract":"The infrastructure of mobile grid presents some challenges to allow the interaction between mobile devices and grid environments, such as (a) applications submission and monitoring facilities in an automated and coordinated manner, (b) disconnections during execution of applications, and (c) selection of suitable grid resources for their execution. This article presents a framework, coined as SuMMIT, that employs the workflow concept for providing automated and coordinated features and a resource matching based on ontology for selecting resources for applications execution in grid configurations. A case study has demonstrated that the framework has selected more suitable resources for applications, thus, submitting them from mobile devices to a grid configuration. In addition, the SuMMIT environment provides an execution How adjustment, in disconnection case of the mobile device, matching requirements of submitted application and options defined by the user.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123431798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Resource usage policy expression and enforcement in grid computing","authors":"Jun Feng, G. Wasson, M. Humphrey","doi":"10.1109/GRID.2007.4354117","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354117","url":null,"abstract":"To date, not enough attention has been paid to issues surrounding the description and enforcement of policies for controlling grid resources. These policies define the permitted or desired usage scenario(s) allowed by resource providers, virtual organizations, or even the governing body for an entire grid. Most existing Grid systems have either \"in-spirit\" usage policies with no actual enforcement (e.g., all resource providers are assumed to contribute in kind), or have implicit resource usage policies whose intent can only be manifested by examining the ad-hoc policy enforcement. Moreover, systems that do define some resource usage policies typically consider only CPU resources, without mentioning other grid resources such as disk and bandwidth. Unless sufficient resource usage policies and enforcement mechanisms are created, resource providers will be increasingly reluctant to participate in grids out of fear that their local resources will be overrun. In this paper, we identify the requirements for a resource usage policy language, and then propose an event-centric model by which to implement these policies. We describe the language structure, its implementation on top of the XML access control language XACML and a policy service that processes the language. Because decisions based on this type of policy typically require information from outside the security context of a single grid request, we extend XACML for general timer-based and event-centric processing necessary to enforce such Grid resource usage policies. We evaluate our prototype implementation on a grid consisting of three data repositories by showing that a usage policy-controlled grid environment can be achieved with only minimal overhead.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116277827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Gutiérrez, Asunción Gómez-Pérez, Óscar Corcho, Ó. Muñoz-García
{"title":"WS-DAIOnt-RDF(S): Ontology access provision in grids","authors":"M. Gutiérrez, Asunción Gómez-Pérez, Óscar Corcho, Ó. Muñoz-García","doi":"10.1109/GRID.2007.4354120","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354120","url":null,"abstract":"This paper presents WS-DAIOnt-RDF(S), a system that provides an homogeneous access mechanism for using heterogeneous and distributed RDF(S) ontologies in Grid applications. These ontologies may be stored in different RDF(S) storage systems, geographically distributed across the Grid infrastructure. The paper describes in detail the design of the system, its rationale, the current implementation, and the ongoing standardisation effort.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116801287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Load prediction using hybrid model for computational grid","authors":"Yongwei Wu, Yulai Yuan, Guangwen Yang, Weimin Zheng","doi":"10.1109/GRID.2007.4354138","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354138","url":null,"abstract":"Due to the dynamic nature of grid environments, schedule algorithms always need assistance of a long-time-ahead load prediction to make decisions on how to use grid resources efficiently. In this paper, we present and evaluate a new hybrid model, which predicts the n-step-ahead load status by using interval values. This model integrates autoregressive (AR) model with confidence interval estimations to forecast the future load of a system. Meanwhile, two filtering technologies from signal processing field are also introduced into this model to eliminate data noise and enhance prediction accuracy. The results of experiments conducted on a real grid environment demonstrate that this new model is more capable of predicting n-step-ahead load in a computational grid than previous works. The proposed hybrid model performs well on prediction advance time for up to 50 minutes, with significant less prediction errors than conventional AR model. It also achieves an interval length acceptable for task scheduler.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115788530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Z. Hill, Jonathan C. Rowanhill, A. Nguyen-Tuong, G. Wasson, J. Knight, J. Basney, M. Humphrey
{"title":"Meeting virtual organization performance goals through adaptive grid reconfiguration","authors":"Z. Hill, Jonathan C. Rowanhill, A. Nguyen-Tuong, G. Wasson, J. Knight, J. Basney, M. Humphrey","doi":"10.1109/GRID.2007.4354131","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354131","url":null,"abstract":"In order for Grids to become relied upon for critical infrastructure and scientific computing, Grid-wide management must be automated so that it is possible in quickly and comprehensively respond to or anticipate specific environmental changes and requirements. That is, due to the disjoint administration of Grids which results in high communication requirements as well as large numbers of skilled administrators, manual reconfiguration of large portions of a Grid in such situations is not a viable solution. We have developed an architecture that allows changes to the grid configuration to be automated in response to operator input or sensors placed throughout the Grid. Additionally, our architecture allows the resource owner to specify who is allowed to alter the configuration of his resource and what types of reconfigurations are allowed. This permits the automation of reconfiguration while retaining owner control of the individual resources. Our experiments show that this architecture can be used to reconfigure a representative GT4-based development grid to enforce maximum latency limits on a Virtual Organization's jobs by dynamically controlling job priorities Grid-wide.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116149148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yudong Sun, S. McKeever, K. Balali-Mood, M. Sansom
{"title":"Integrating multi-level molecular simulations across heterogeneous resources","authors":"Yudong Sun, S. McKeever, K. Balali-Mood, M. Sansom","doi":"10.1109/GRID.2007.4354129","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354129","url":null,"abstract":"Biomolecular simulations play a key role in the study of complex biological processes at microscopic levels in which macromolecules such as proteins are involved. The simulations are usually computationally demanding and no single method can achieve all levels of details. Thus, the simulations at different levels need to be integrated to jointly manifest atomic insights into these processes. This paper presents a grid-based simulation framework to support the integration of multi-level simulations by means of dynamic coupling, automated workflow management, resource-dependent job distribution, and XML-based data representation. The framework provides an e-science infrastructure to support biomolecular simulations on grids. A biomolecular simulation markup language called BioSimML is developed to provide a formatted data representation to the multi-level simulations. Experimental simulations have shown flexible integration and high performance enhancement achieved in molecular simulations based on our framework.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125032560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Grid-based asynchronous replica exchange","authors":"Z. Li, M. Parashar","doi":"10.1109/GRID.2007.4354134","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354134","url":null,"abstract":"Replica exchange is a powerful sampling algorithm and can be effectively used for applications such as simulating the structure, function, folding, and dynamics of proteins and drug design. However, Grid-based implementations of the algorithm present significant challenges due to its synchronization and communication requirements. This paper presents an asynchronous formulation of the replica exchange algorithm and the design and implementation of a Grid-based asynchronous replica exchange engine (GARE). GARE is based on CometG, a decentralized computational infrastructure for Desktop Grid environments that provides a scalable communication and interaction substrate and presents a virtual semantically specialized shared space abstraction. It enables the dynamic and asynchronous interactions required by the algorithm to be simply expressed and efficiently implemented. The design and implementation of GARE/CometG and the replica exchange simulations that it enables are presented. Experimental evaluations using the PlanetLab |1| wide-area test bed as well as a campus Grid environment arc presented.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131615222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}