{"title":"Run-time Optimisation of Grid Workflow Applications","authors":"Rubing Duan, R. Prodan, T. Fahringer","doi":"10.1109/ICGRID.2006.310995","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.310995","url":null,"abstract":"The execution of workflow applications on the grid is a complex issue because of its dynamic and heterogeneous nature. While the grid provides good potential for achieving high performance, it also introduces a broad set of unpredictable overheads and possible failures. In this paper we present new methods for scalable and fault tolerant coordination of workflows in dynamic grid environments, including partitioning, static and dynamic optimisation, as well as virtual single execution environment, incorporated into the ASKALON distributed workflow enactment engine. We demonstrate the effectiveness of our methods on a material science workflow application executed in a real-world grid environment","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116772615","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":"Towards an Adoption Model of Grid Information Technology in the Organisational Arena","authors":"J. M. Maqueira, Sebastián Bruque","doi":"10.1109/ICGRID.2006.311041","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311041","url":null,"abstract":"Grid technologies are becoming of increasing interest in science and technology around the world. But little work has analysed these technologies in the organisational arena. The current work centres on this area of knowledge, and is justified by the expectation that the emergence of these technologies has generated in the business world. We analyse the determinant factors of the adoption of these technologies by organisations, and propose an adoption model that integrates contributions from two of the most relevant models used in studies of IT adoption: (1) Premkumar's contingent model; and (2) Davis's technology acceptance model (TAM)","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123956431","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":"Metascheduling Multiple Resource Types using the MMKP","authors":"D. Vanderster, N. Dimopoulos, R. Sobie","doi":"10.1109/ICGRID.2006.311020","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311020","url":null,"abstract":"Grid computing involves the transparent sharing of computational resources of many types by users across large geographic distances. The altruistic nature of many current grid resource contributions does not encourage efficient usage of resources. As grid projects mature, increased resource demands coupled with increased economic interests will introduce a requirement for a metascheduler that improves resource utilization, allows administrators to define allocation policies, and provides an overall quality of service to the grid users. In this work we present one such metascheduling framework, based on the multichoice multidimensional knapsack problem (MMKP). This strategy maximizes overall grid utility by selecting desirable options of each task subject to constraints of multiple resource types. We present the framework for the MMKP metascheduler and discuss a selection of allocation policies and their associated utility functions. The MMKP metascheduler and allocation policies are demonstrated using a grid of processor, storage, and network resources. In particular, a data transfer time metric is incorporated into the utility function in order to prefer task options with the lowest data transfer times. The resulting schedules are shown to be consistent with the defined policies","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132108294","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":"Operating System Support for Space Allocation in Grid Storage Systems","authors":"D. Thain","doi":"10.1109/ICGRID.2006.311004","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311004","url":null,"abstract":"Shared temporary storage space is often the constraining resource for clusters that serve as execution nodes in wide-area distributed systems. At least one large national-scale computing grid has reported a failure rate of as high as thirty percent of submitted jobs, often due to accidentally filled shared storage spaces. Previous systems have attacked this problem by adding space allocation to the distributed system interface. However, these allocations are not enforced at the filesystem level, and thus unexpected or unaccounted uses of storage may cause the system to fail. By adding an inexpensive allocation mechanism to the operating system, we may improve the robustness of such systems at minimal cost. In this paper, we describe an abstract model of space allocation in the file system and explore three implementations of the model: a user-level library, a recursive loopback filesystem, and a modified kernel filesystem. We evaluate the performance and completeness of these implementations and demonstrate that kernel support is essential to keeping the overhead low. Finally, we demonstrate empirically that a cluster under heavy filesystem load can be made more robust by adding allocations to the filesystem","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132045610","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":"Ranking and Performance Exploration of Grid Infrastructures: An Interactive Approach","authors":"George Tsouloupas, M. Dikaiakos","doi":"10.1109/ICGRID.2006.311035","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311035","url":null,"abstract":"In the ever-growing grid infrastructures picking the right resources is not an easy task. There are situations were finding enough idle CPU's that satisfy a set of minimum nominal hardware requirements is simply not enough. In many such occasions, users or VO managers need to be involved in the resource selection process, either by excluding resources or by indicating preference, more so when resources are not for free. To support users in this task, we propose an interactive and user-driven approach to a performance-based ranking of grid resources. Using the GridBench framework and the provided suite of micro-benchmarks, the user is able to interactively explore and rank what is currently available on the grid in order to pinpoint the right resources. Through this framework, the user is able to interactively compose ranked lists of grid resources using custom ranking functions that are based on low-level measurements","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128907837","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}
Christophe Blanchet, Rémi Mollon, D. Thain, G. Deléage
{"title":"Grid Deployment of Legacy Bioinformatics Applications with Transparent Data Access","authors":"Christophe Blanchet, Rémi Mollon, D. Thain, G. Deléage","doi":"10.1109/ICGRID.2006.311006","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311006","url":null,"abstract":"Although grid computing offers great potential for executing large-scale bioinformatics applications, practical deployment is constrained by legacy interfaces. Most widely deployed bioinformatics were designed long before grid computing arose, and thus are created, tested, and validated in the familiar environment of a workstation. Most perform simple local I/O and have no facility for interfacing with a distributed system. Because of these limitations, users of bioinformatics applications are generally constrained to creating large local clustered systems in order to perform data analysis. In order to deploy these applications in wide-area grid systems, users require a transparent mechanism of attaching legacy interfaces to grid I/O systems. We have explored this problem by deploying several bioinformatics databases and programs for protein sequence analysis on the European EGEE grid. Using tools for transparent adaptation, we have connected legacy applications to the logical namespace provided by a replica manager, and compared the performance of remote access versus file staging. For common bioinformatics applications, we find that remote access has performance equal or better than simple file staging, with the added advantage that users are freed from stating the data needs of applications in advance","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133749409","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":"Workflow Global Computing with YML","authors":"O. Delannoy, N. Emad, S. Petiton","doi":"10.1109/ICGRID.2006.310994","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.310994","url":null,"abstract":"In this paper we propose a framework dedicated to the development and the execution of parallel applications over large scale global computing platforms. A workflow programming environment will be introduced, based on a new workflow language YvetteML and a human-grid middleware interface called YML. This language allows description of different kind of components to be allocated to grid resources. Depending of the different targeted resources, the components may be associated to computation, data migration or other resource controls. YML is designed to have several back-ends for different middleware, as a well-designed front end is developed independently of any dedicated middleware. In order to make the framework immediately useful, YML comes with pre-configured interfaces to some numerical routines and a numerical library for iterative linear algebra methods. We will present experimentations done on some large scale platforms using a peer to peer middleware with a numerical application case study","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132511257","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}
Omid Khalili, J. He, C. Olschanowsky, A. Snavely, H. Casanova
{"title":"Measuring the Performance and Reliability of Production Computational Grids","authors":"Omid Khalili, J. He, C. Olschanowsky, A. Snavely, H. Casanova","doi":"10.1109/ICGRID.2006.311028","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311028","url":null,"abstract":"In this work we report on data gathered via a deployment of a monitoring and benchmarking infrastructure on two production grid platforms, TeraGrid and Geon. Our result show that these production grids are rather unavailable, with success rates for benchmark and application runs between 55% and 80%. We also found that performance fluctuation was in the 50% range, expectedly mostly due to batch schedulers. We also investigate whether the execution time of a typical grid application can be predicated based on previous runs of simple benchmarks. Perhaps surprisingly, we find that application execution time can be predicted with a relative error as low as 9%","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129035640","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}
Arshad Ali, A. Anjum, J. Bunn, Faisal Khan, R. McClatchey, H. Newman, C. Steenberg, Michael Thomas, I. Willers
{"title":"A Multi Interface Grid Discovery System","authors":"Arshad Ali, A. Anjum, J. Bunn, Faisal Khan, R. McClatchey, H. Newman, C. Steenberg, Michael Thomas, I. Willers","doi":"10.1109/ICGRID.2006.311032","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311032","url":null,"abstract":"Discovery systems (DS) can be considered as entry points for global loosely coupled distributed systems. An efficient discovery system in essence increases the performance, reliability and decision making capability of distributed systems. With the rapid increase in scale of distributed applications, existing solutions for discovery systems are fast becoming either obsolete or incapable of handling such complexity. They are particularly ineffective when handling service lifetimes and providing up-to-date information, poor at enabling dynamic service access and they can also impose unwanted restrictions on interfaces to widely available information repositories. In this paper we present essential the design characteristics, an implementation and a performance analysis for a discovery system capable of overcoming these deficiencies in large, globally distributed environments","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132701085","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}
F. Guim, I. Rodero, M. Tomas, J. Corbalán, J. Labarta
{"title":"The Palantir Grid Meta-Information System","authors":"F. Guim, I. Rodero, M. Tomas, J. Corbalán, J. Labarta","doi":"10.1109/ICGRID.2006.311043","DOIUrl":"https://doi.org/10.1109/ICGRID.2006.311043","url":null,"abstract":"Grids allow large scale resource-sharing across different administrative domains. Those diverse resources are likely to join or quit the grid at any moment or possibly to break down. Grid monitoring tools have to adapt supporting access information to these heterogeneous and not reliable environments. There is a wide rage of types of resources to be monitored, with different nature, characteristics and so on. For instance grid users want to monitor from which is the state of the jobs that submit till how many processors has a given resources of a given centre. These issues make the task of monitoring complex to treat, and it is difficult to provide a generals ways for accessing to all this information. In this work we propose a set of functionalities that a grid information system should provide. We describe the Palantir meta-information system that has been designed for uniform the access to different monitoring and information systems and that implements all the discussed functionalities. This meta-information system tries to abstract the resource information that underlies on the local systems, and homogenize the access to all this. We present the architecture of Palantir and its main characteristics","PeriodicalId":338314,"journal":{"name":"2006 7th IEEE/ACM International Conference on Grid Computing","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133379388","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}