{"title":"A classification for the implementations of heterogeneous strong migration of computations","authors":"Anolan Milanés, N. Rodriguez, B. Schulze","doi":"10.1109/CCGRID.2007.1","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.1","url":null,"abstract":"The Grid's intrinsic characteristics of high instability and unpredictability, makes adaptation a must-have requirement. The capability of moving a running computation to another available host has the desirable property of allowing the topology of distributed applications to adapt dynamically, reacting to changes in the environment. An outstanding example is that of opportunistic computing, where a mechanism must exist in order to evict remote computations in favor of the local owner. This work studies the problem of heterogeneous strong migration, identifying its structure and the taxonomy of the methods currently used for its implementation.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114623518","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}
C. E. C. F. Batista, T. Araújo, Derzu Omaia, Thiago Curvelo dos Anjos, Giuliano Maia Lins de Castro, F. Brasileiro, Guido Lemos de Souza Filho
{"title":"TVGrid: A Grid Architecture to use the idle resources on a Digital TV network","authors":"C. E. C. F. Batista, T. Araújo, Derzu Omaia, Thiago Curvelo dos Anjos, Giuliano Maia Lins de Castro, F. Brasileiro, Guido Lemos de Souza Filho","doi":"10.1109/CCGRID.2007.117","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.117","url":null,"abstract":"Systems such as SETI@home [8] have proven that it is possible to make good use of massive amounts of communication and computing power that would otherwise be wasted in the leaves of the Internet. In this paper we explore this idea in a different setting. We present the TVGrid architecture, which brings parallel application execution to the digital TV domain, by using the idle communication and processing capacity of a digital TV network. In the proposed architecture, a TV station runs a scheduler that uses unused bandwidth in the digital TV broadcast channel to send tasks to digital TV receivers, which may run them using their unused capacity. Task's outputs are later sent back to the TV station through a return channel (a broadband Internet connection, for example). TV Grid architecture was developed during the studies of the Brazilian Digital TV project.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114429752","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":"Mobility-Aware Efficient Job Scheduling in Mobile Grids","authors":"P. Ghosh, Nirmalya Roy, Sajal K. Das","doi":"10.1109/CCGRID.2007.73","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.73","url":null,"abstract":"In this paper, we present a node mobility prediction framework based on a generic mobile grid architecture. We show how this framework can be used to formulate a cost effective job scheduling scheme based on a predetermined pricing strategy at the wireless access point. The proposed scheme is for distributing grid computing jobs to the mobile nodes and considers the bandwidth constraints along with any internal job (e.g., call processing) arrival rate at the nodes. The simulation results point to the efficacy of our algorithm.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"64 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882964","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":"Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation","authors":"Jörg Decker, Jörg Schneider","doi":"10.1109/CCGRID.2007.56","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.56","url":null,"abstract":"Applications to be executed in grid computing environments become more and more complex and usually consist of multiple interdependent tasks. The coordinated execution of such tightly or loosely coupled tasks often requires simultaneous access to different grid resources. This leads to the problem of resource co-allocation. Efficient and robust scheduling algorithms have to be developed that can cope with the Grid's large- scale distribution, a high number of competing and demanding applications, the inherent resource heterogeneity and the often limited view on resource availability. In this paper, we present two heuristic scheduling algorithms that are based on a well-known list scheduling algorithm and both support co- allocation and advance resource reservation. Our first algorithm preserves the run-time efficiency of greedy list schedulers while the second approach incorporates more sophisticated search techniques in order to achieve better results with respect to the performance metrics. Both algorithms have been implemented within a grid simulation framework. An extensive simulation study was conducted to evaluate and compare the performance of both algorithms. It showed the general suitability of our enhanced list scheduling heuristics within heterogeneous grid environments.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123363079","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":"Revisit of View-Oriented Parallel Programming","authors":"Zhiyi Huang, Wenguang Chen","doi":"10.1109/CCGRID.2007.100","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.100","url":null,"abstract":"Traditional parallel programming styles have many problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers. While shared memory based parallel programming is relatively easy, it requires programmers to guarantee there is no data race in programs by using mutually exclusive locks. Data race conditions are generally difficult to debug and difficult to prevent as well. The view-oriented parallel programming (VOPP) is a novel shared-memory-based programming style. It removes the burden of guaranteeing data race free from the programmers. With the VOPP approach, shared data objects in a parallel program are divided into views according to the memory access pattern of the parallel algorithm. Data race is not an issue in VOPP, since mutual exclusion is automatically done by the underlying system when a view is accessed. The programmer only needs to synchronize the access of views using synchronization primitives like barriers. By removing data races of view access, VOPP makes it easier to code and less difficult to debug programs. It provides potential performance advantages on multi-core systems as well as cluster computers. It will also provide useful information for efficient implementation of transactional memory.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123426026","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":"Assessing the Quality of Automatically Built Network Representations","authors":"Lionel Eyraud-Dubois, M. Quinson","doi":"10.1109/CCGRID.2007.25","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.25","url":null,"abstract":"In order to efficiently use Grid resources, users or middlewares must use some network information, and in particular some knowledge of the platform network. As such knowledge is usually not available, one must use tools which automatically build a topological network model through some measurements. Our aim is to define a methodology to assess the quality of these network model building tools, and to apply this methodology to representatives of the main classes of model builders. Using this approach, we show that none of the main existing techniques build models that enable to accurately predict the running time of simple application kernels for actual platforms.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125173538","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":"A Semantic Framework for Integrated Asset Management in Smart Oilfields","authors":"R. Soma, A. Bakshi, V. Prasanna","doi":"10.1109/CCGRID.2007.11","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.11","url":null,"abstract":"Integrated asset management (IAM) is the vision of IT- enabled transformation of oilfield operations where information integration from a variety of tools for reservoir modeling, simulation, and performance prediction will lead to rapid decision making for continuous production optimization. This paper describes the design of a model-based IAM system for production forecasting. Domain knowledge is captured through a formal modeling language that forms the basis for an intuitive user interface to the system. An IAM metacatalog captures domain knowledge as well as metadata about computational resources and data sets in a single ontological framework, thereby providing a unified mechanism for application, data, and workflow integration . The framework is designed to be portable across oilfield assets, to allow different classes of end users to interact with the integrated system, and to accomodate new domain knowledge, software applications, data sets, and workflows for IAM.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124595114","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":"Overdrive Controllers for Distributed Scientific Computation","authors":"J. Wozniak","doi":"10.1109/CCGRID.2007.80","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.80","url":null,"abstract":"Large distributed computer systems have been successfully employed to solve modern scientific problems that were previously impracticable. Tools exist to bind together notably underutilized high speed computers and sizable storage resources, creating architectures that provide performance and capacity that scales with the quantity of resources invested. In various forms such as Internet computing, desktop grids, and even \"big iron \" grids, users and administrators find it difficult, however, to obtain aggregate systems that are more reliable than their underlying components and simple to utilize in concert. In this work, we will propose a model for controlling complex distributed systems and its application to the construction of scientific repositories.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126923561","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":"Query-load balancing in structured overlays","authors":"Anwitaman Datta, Roman Schmidt, K. Aberer","doi":"10.1109/CCGRID.2007.90","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.90","url":null,"abstract":"Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself sufficient. We then provide simple and effective load-aware variants of the standard greedy routing used in overlays, exploiting routing redundancy originally needed for fault-tolerance, to achieve very good query load-balancing.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127421526","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":"Genesis II - Standards Based Grid Computing","authors":"M. Morgan, A. Grimshaw","doi":"10.1109/CCGRID.2007.53","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.53","url":null,"abstract":"In the past years, hype over Web services and their uses in emerging software applications has prompted the creation of many standards and proto-standards. The OGF has seen a number of standards making their way through design and edit pipelines. While this standards process progresses, it is important that implementations of these standards develop in parallel in order to validate the efforts of the standards authors while also providing feedback for further specification refinement. No specification exists in isolation but rather composes with others to form higher order products. These specifications will form the grid infrastructure of the future and an evaluation of this emerging work becomes increasingly relevant. Genesis II is a grid system implemented using these standards that serves both to provide the feedback described above as well as to function as a production level grid system for research at the University of Virginia.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129073610","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}