By Topic

2010 Fifth Annual ChinaGrid Conference

16-18 July 2010

Filter Results

Displaying Results 1 - 25 of 57
  • [Front cover]

    Publication Year: 2010, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (990 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2010, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2010, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (121 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (170 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2010, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (156 KB)
    Freely Available from IEEE
  • ChinaGrid 2010 Preface

    Publication Year: 2010, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (119 KB) | HTML iconHTML
    Freely Available from IEEE
  • ChinaGrid 2010 Conference Committee

    Publication Year: 2010, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • DSAA 2010 Workshop Welcome Message

    Publication Year: 2010, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (108 KB) | HTML iconHTML
    Freely Available from IEEE
  • DSAA 2010 Workshop Organizing and Program Committees

    Publication Year: 2010, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • A Comprehensive Task Scheduling Algorithm in Grid

    Publication Year: 2010, Page(s):3 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (363 KB) | HTML iconHTML

    Grid is evolving to a more efficient global computing infrastructure by introducing more and more task scheduling algorithms. With the grid expansion and users' requirements in an intuitive way, a new robust multi-criteria scheduling algorithm is needed. Resource brokers should provide a more comprehensive solution for users. Multiple scheduling criteria addressed by the related grid research incl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolutionary Grid Scheduling Algorithm with Predictive Resource Optimization

    Publication Year: 2010, Page(s):11 - 15
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    Optimal assigning jobs to resources is an important problem in grid computing. Now grid scheduling policies are mostly traditional heuristic algorithms for scheduling n independent tasks on m processors in early finishing time. However grids have developed to wide area, heterogeneous and non autonomous environments, business objective also became crucial for the success of the scheduling. Therefor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Self-Optimizing Computation Partitioning Algorithm for Distributed Many-Task Computing

    Publication Year: 2010, Page(s):16 - 24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (374 KB) | HTML iconHTML

    Many-task computing (MTC) is a practical paradigm for developing loosely coupled and complex scientific applications. In this paradigm, computation on a large dataset is decomposed into tasks that are expected to be executed in parallel with dynamically allocated computing resources. These tasks pass data via files, and each one is to execute an existing program on one dataset element. Task schedu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cloud Model-Based Security-Aware and Fault-Tolerant Job Scheduling for Computing Grid

    Publication Year: 2010, Page(s):25 - 30
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (375 KB) | HTML iconHTML

    The uncertainties of grid nodes security are main hurdle to make the job scheduling secure, reliable and fault-tolerant. The fixed fault-tolerant strategy in jobs scheduling may utilize excessive resources. In this paper, the job scheduling decides which kinds of fault-tolerance strategy will be applied to each individual job for more reliable computation and shorter makespan. And we discuss the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Effective Replica Location Algorithm Based on Routing-Forward in Data Grid

    Publication Year: 2010, Page(s):31 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (566 KB) | HTML iconHTML

    Data Grid is a kind of wide-area, distributed storage system, which can provide huge storage capacity. There are millions of files in data grid, distributed in hundreds of geographically dispersed storage resources. Given a unique logical identifier for desired content, replica location service can be used to determine the physical locations of one or more copies of this content. This paper analyz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of Task Scheduling with Replica Placement in Data Grid for Limited Disk Space of Resources

    Publication Year: 2010, Page(s):37 - 42
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB) | HTML iconHTML

    Data grid integrates geographically distributed resources for solving data-sensitive scientific applications. As tasks are sensitive to data, dealing with large amount of data makes the requirement for efficiency in data access more critical. The goal of replica placement is to shorten data access time for enhancing the task execution performance. Therefore, replica placement strategies are often ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust-GSM: A Trust Aware Security Model for Multi-domain Grid

    Publication Year: 2010, Page(s):43 - 47
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (287 KB) | HTML iconHTML

    Grid security is a major requirement in grid computing. Trust management is considered as an effective approach to enhance grid security. This paper introduces the trust into the multi-domain grid and qualifies grid trust as the relationship between grid resource providers and grid consumers. In order to provide more flexible and scalable protection for grid resources and services in multi-domain ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Java Multi Threaded Based Parallel Remote Sensing Image Interpretation in Desktop Grid

    Publication Year: 2010, Page(s):51 - 59
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    Typical remote sensing image interpretation consists of large number of long-lived independent computation jobs such as calibration, correction, and transformation and computation. These time consuming jobs are suitable for execution in desktop grid with high performance commodity PCs for its lower cost and high management ability. In this paper, a framework of parallel remote sensing image interp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Law Text Clustering Based on Referential Relations

    Publication Year: 2010, Page(s):60 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (567 KB) | HTML iconHTML

    This paper proposes a new method to cluster law texts based on referential relation of laws. We extract law entities (an entity represents a law) and their referential relation from law texts. Then SimRank algorithm is applied to calculate law entity's similarity through referential relation and law clustering is carried out based on the SimRank similarity. This is the first time to apply SimRank ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A QoS-Based Scheduling Approach for Complex Workflow Applications

    Publication Year: 2010, Page(s):67 - 73
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (753 KB) | HTML iconHTML

    In dynamic and heterogeneous Grid environments, the majority of the scientific applications require to be expressed as complex workflows which assemble multiple Web Services to implement complex scientific tasks. In addition, most workflow management systems are bound to concrete services distributed in different physical domains or concrete environments. Therefore, scientists still need to discov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ChemDataBase 2: An Enhanced Chemical Database Management System for Virtual Screening

    Publication Year: 2010, Page(s):74 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB) | HTML iconHTML

    Virtual screening is a newly emerging method used in new drug research and development (R&D). The introduction of virtual screening immensely reduces R&D cycle and decreases R&D cost directly. Mass of chemical data used for virtual screening needs to be managed effectively in certain ways. We have developed the first release of ChemDataBase, but it only has the basic functions of chemi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Scalable Middleware for Multiplayer Online Games

    Publication Year: 2010, Page(s):80 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (455 KB) | HTML iconHTML

    Warcraft III is one of the most popular Multiplayer Online Game (MOG) games, where users are designed to interact with support of a dedicated server. PKTown is a P2P-based third-party middleware developed to replace the dedicated servers. This paper presents the scalability and robustness of PKTown 2.0 architecture. The evaluation demonstrates the efficiency of the architecture. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Range Query Performance on Historic Web Page Data

    Publication Year: 2010, Page(s):87 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (469 KB) | HTML iconHTML

    This paper is about the performance of range queries on historic web page data set, i.e. requests into a data set of web pages that keeps record of historic versions of HTML data of URLs on the web for a subset of data, the URLs and the timestamps of which satisfy the query conditions. To keep track of all versions of every web URL, the data set could easily scale up to terabytes. Hence, systems p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on the Real-Time of the Perception between Objects in Internet of Things Based on Image

    Publication Year: 2010, Page(s):92 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (447 KB) | HTML iconHTML

    In this paper, the application of video-based information processing technology in the Internet of things has been researched. Currently, the real-time of most video-based identification methods is not satisfactory. The Hausdorff distance plays an important role in object recognition. However, when comparing the relationship between objects, the traditional Hausdorff distance even some modified Ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Appraisal Reputation of Community Resources Based on Sensitive Factors

    Publication Year: 2010, Page(s):98 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    In order to solve the optimization of community resources in virtual computing environment, shorten the time to select the best resources, this paper drew on Liebig minimum factor's Law and Shelford's law of tolerance in ecology, designed an appraisal reputation model of community resources, and put forward an appraisal reputation strategy based on sensitive factors. Experimental results show that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MISM: Modelica-Based Interactive Scheduling Mechanism for Virtual Educational Experiments

    Publication Year: 2010, Page(s):103 - 108
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    Different virtual educational experiments (VEEs) have different frameworks and implementations in different disciplines. How to integrate different VEEs into one unified supporting platform is a challenging problem. The key problem of this integration is how to build a unified mathematical model for VEEs of diversified disciplines. However, most existing multi-domain uniform modeling (MDUM) approa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.