{"title":"Energy-Optimization Scheduling of Task Dependent Graph on DVS-Enabled Cluster System","authors":"Yan Ma, Bin Gong, Lida Zou","doi":"10.1109/ChinaGrid.2010.16","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.16","url":null,"abstract":"At present, power management in High-Performance Computing (HPC) environment is becoming a hot topic owning to its high operation cost, low reliability and environmental impact. In this paper, we investigate energy minimization scheduling algorithm of data dependent tasks in DVS-Enabled cluster system. Considering the data-intensive characteristics, the proposed EOTD (Energy Optimization scheduling for Task Dependent graph) algorithm adopts task clustering to reduce data transmission time and communication energy consumption. In order to decrease dynamic power of processing elements, it uses one of the power-saving techniques in system level—Dynamic Voltage Scaling while not violating the deadline users specify. Moreover, on the premise that application execution is predictive and exclusive for processing elements, we employ Dynamic Power Management and Binary Search technique to reduce the static power of idle processing elements and last find the optimal number of processing elements. EOTD algorithm not only optimizes the energy consumption of task dependent graph, but also satisfies the QoS requirements service level agreement gives. Compared with VM and LJ-VM algorithm, experimental results demonstrate that EOTD algorithm can achieve larger energy optimization in less optimizing time.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251293","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 Comprehensive Task Scheduling Algorithm in Grid","authors":"Guowei Yang, Yanming Shen, Keqiu Li, W. Qu","doi":"10.1109/ChinaGrid.2010.34","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.34","url":null,"abstract":"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 include execution time, the cost of running a task on a machine and reliability. The existing scheduling approaches are usually dedicated to single criterion or certain criterion pairs that require users to define one’s preferences. These requirements are often not feasible for users and these algorithms often cannot find the solutions that fully satisfy users’ various requirements. The grid scheduling problem is NP-hard in the traditional grid system. In this paper, we propose a flexible and general requirement specification method based on N-constraint, and we model the problem as an extension of the Multidimensional Multiple-Choice Knapsack Problem. Further more, we propose a multi-criterion scheduling heuristic called N-Variable Constraints Algorithm (NVCA) based on dynamic programming for the optimal solution, dedicated to the problem model defined by us. Finally, promising results demonstrate the effectiveness of the proposed method with comparison to other existing methods.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130314700","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}
Congfeng Jiang, Xianghua Xu, Jian Wan, Jilin Zhang, Yunfa Li
{"title":"Java Multi Threaded Based Parallel Remote Sensing Image Interpretation in Desktop Grid","authors":"Congfeng Jiang, Xianghua Xu, Jian Wan, Jilin Zhang, Yunfa Li","doi":"10.1109/ChinaGrid.2010.27","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.27","url":null,"abstract":"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 interpretation in desktop grid is proposed. The framework consists of modules such as job partitioning and scheduling, load balancing, communication, and image processing. We also provided an implementation based on java multi threaded programming. The computation results on real application of soil moisture estimation workload show that the average speedup is 6.1 in a 9-node heterogeneous desktop grid environment and failure rate of jobs is less than 5.6%.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131588176","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":"Cloud Model-Based Security-Aware and Fault-Tolerant Job Scheduling for Computing Grid","authors":"Y. Hu, Bin Gong, Fengyu Wang","doi":"10.1109/ChinaGrid.2010.36","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.36","url":null,"abstract":"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 fuzziness or uncertainties between TL and SD attributes by the subjective judgment of human beings. Cloud model is a model of the uncertain transition between qualitative concept and its quantitative representation. Based on the cloud model, We propose a security-aware and fault-tolerant jobs scheduling strategy for grid (SAFT), which makes the assess of SD and SL to become more flexibile and more reliable. Meanwhile, the different fault-tolerant strategy has been applied in grid job scheduling algorithm by the SD and job workload. Moreover, much more important, we are able to set up some rules and active each qualitative rule to select a suitable fault-tolerant strategy for a scheduling job by input value (the SD and job workload) to realize the uncertainty reasoning. The results demonstrate that our algorithm has shorter makespan and more excellent efficiencies on improving the job failure rate than the fixed fault-tolerant strategy selection.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125066132","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":"Certificateless-Signature-Based Authenticated Key Agreement Protocol for Grid","authors":"Ming Chen, Kaigui Wu, Changze Wu, Zhongfu Wu","doi":"10.1109/ChinaGrid.2010.52","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.52","url":null,"abstract":"The traditional authentication for grid is based on PKI framework, using standard X.509 certificates. But with the growing scale of the grid, certificate management would become an encumbrance. However, certificateless-based signature scheme can overcome these problems for its certificate-free feature, and make authentication more efficient. In this paper, a certificateless-signature-based authenticated key agreement protocol is designed, which aims at circumventing the key escrow issues inherited in the identity-based schemes and the certifcate management burden in PKI-based cryptosystems in grid. Then its security and performance analysis are made, which shows that the new protocol is secure and efficient.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127242229","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":"An Effective Replica Location Algorithm Based on Routing-Forward in Data Grid","authors":"Runqun Xiong, Junzhou Luo, Aibo Song","doi":"10.1109/ChinaGrid.2010.35","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.35","url":null,"abstract":"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 analyzes the existing replica location methods, points out their insufficiency and then proposes an effective replica location algorithm based on Routing-Forward mechanism. Meanwhile, we analyze the time cost and space cost of all these algorithms, the result shows that the Routing-Forward algorithm costs lest time and tolerable space. As a conclusion, Routing-Forward algorithm is an effective replica location algorithm in Data Grid.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127535932","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":"Bitmap Based Partition in Structural Join of XML","authors":"Hong Yu","doi":"10.1109/ChinaGrid.2010.30","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.30","url":null,"abstract":"XML numbering scheme was analyzed. The advantages and disadvantages of RangePartitionJoin algorithm were analyzed. According to the feature of structural join, Bitmap based partition method was proposed. The determination method of partition boundaries was expounded. The corresponding structural join algorithms——Parent-Child structural join algorithm and Ancestor-Descendant structural join algorithm were presented. In order to test the performance of the algorithms, the experiments were design. The experiment result showed that proposed algorithms are effective","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133557286","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 Web Service Discovery Model Based on Pastry System","authors":"Ting Wang, Ruihua Di","doi":"10.1109/ChinaGrid.2010.24","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.24","url":null,"abstract":"The structure has been put forward of P2P systems are strictly based on the keyword matching to find the way of routing resources, so the routing mechanism will not be able to reflect the massive, distributed resources, and semantic information, thus reducing the precision of service discovery and search prospective rate. Semantic Web as the next generation of the embryonic form of the World Wide Web, which supports the semantic search query and increase the efficiency of the realization of intelligent search. Based on the Pastry system, a typical P2P system, advanced a new type of ontology semantic Web Service discovery model, and made in-depth discussions in how to make semantics and peer-to-peer networks integration.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114836242","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 Novel Computing-Enhanced Cloud Storage Model Supporting Combined Service Aware","authors":"Ke Liu, Jing-li Zhou, Leihua Qin, Ning Lv","doi":"10.1109/ChinaGrid.2010.31","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.31","url":null,"abstract":"Cloud storage has been increasing in popularity recently due to its ability to deliver virtualized storage on demand over a network. As the amount of digital resources continues to grow at an astounding rate, more and more intelligent devices (such as GPU) are embedded as computing units to enhance the performance of storage system. How to seamlessly integrate these computing resources into cloud storage is an important problem that we should confront with. In this paper, a novel computing-enhanced cloud storage model is provided, which divides coarse-grained storage service into fine-grained service modules. By combining these sub-service modules with additional computing modules, a combined service can be constructed to satisfy user’s complicated requests.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117125833","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":"An Approach to Optimized Resource Scheduling Algorithm for Open-Source Cloud Systems","authors":"Hai Zhong, Kun Tao, Xuejie Zhang","doi":"10.1109/ChinaGrid.2010.37","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2010.37","url":null,"abstract":"Based on the deep research on Infrastructure as a Service (IaaS) cloud systems of open-source, we propose an optimized scheduling algorithm to achieve the optimization or sub-optimization for cloud scheduling problems. In this paper, we investigate the possibility to allocate the Virtual Machines (VMs) in a flexible way to permit the maximum usage of physical resources. We use an Improved Genetic Algorithm (IGA) for the automated scheduling policy. The IGA uses the shortest genes and introduces the idea of Dividend Policy in Economics to select an optimal or suboptimal allocation for the VMs requests. The simulation experiments indicate that our dynamic scheduling policy performs much better than that of the Eucalyptus, Open Nebula, Nimbus IaaS cloud, etc. The tests illustrate that the speed of the IGA almost twice the traditional GA scheduling method in Grid environment and the utilization rate of resources always higher than the open-source IaaS cloud systems.","PeriodicalId":429657,"journal":{"name":"2010 Fifth Annual ChinaGrid Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122651878","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}