Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.34
Houkun Zhu, Yuan Luo, Chuliang Weng, Minglu Li
In gird environment, collaborative filtering (CF) could be used for security recommendation when grid users face plenty of unknown security grid services. Also, CF recommender systems could be employed in the virtual machines managing platform to measure the creditability of each virtual machine. In this study, a polynomial regression based recommendation model on the basis of typical user-based CF is built to make security recommendation. In the model, a cluster of recommendation algorithms based on polynomial regression are derived according to various regression orders and dataset sizes. From our experiments, three significant conclusions are discovered in this model. Firstly, algorithms with lower regression orders make better predictions. Secondly, among algorithms with each fixed regression order, the best one satisfies that its dataset size is equal to its regression order in general. Thirdly, selecting appropriate regression order and dataset size could enhance recommendation quality.
{"title":"A Collaborative Filtering Recommendation Model Using Polynomial Regression Approach","authors":"Houkun Zhu, Yuan Luo, Chuliang Weng, Minglu Li","doi":"10.1109/ChinaGrid.2009.34","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.34","url":null,"abstract":"In gird environment, collaborative filtering (CF) could be used for security recommendation when grid users face plenty of unknown security grid services. Also, CF recommender systems could be employed in the virtual machines managing platform to measure the creditability of each virtual machine. In this study, a polynomial regression based recommendation model on the basis of typical user-based CF is built to make security recommendation. In the model, a cluster of recommendation algorithms based on polynomial regression are derived according to various regression orders and dataset sizes. From our experiments, three significant conclusions are discovered in this model. Firstly, algorithms with lower regression orders make better predictions. Secondly, among algorithms with each fixed regression order, the best one satisfies that its dataset size is equal to its regression order in general. Thirdly, selecting appropriate regression order and dataset size could enhance recommendation quality.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122768206","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.30
Meng Xu, Li-zhen Cui, Haiyang Wang, Yanbing Bi, Ji Bian
The data-intensive workflow in scientific and enterprise grids has gained popularity in recent times. Data-intensive workflow needs to access, process and transfer large datasets that may each be replicated on different data hosts. Because of the large data sets, the execution time is bounded by the cost of data transfer. Minimizing the time of transferring these datasets to the computational resources where the tasks of workflow are executed requires that appropriate computational and data resources be selected. In this paper, we introduce an algorithm MDTT to select the resource set which the task should be mapped. Our experiments show that our algorithm is able to minimize the total makespan of data-intensive workflow and the time of data transferring.
{"title":"A Data-Intensive Workflow Scheduling Algorithm for Grid Computing","authors":"Meng Xu, Li-zhen Cui, Haiyang Wang, Yanbing Bi, Ji Bian","doi":"10.1109/ChinaGrid.2009.30","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.30","url":null,"abstract":"The data-intensive workflow in scientific and enterprise grids has gained popularity in recent times. Data-intensive workflow needs to access, process and transfer large datasets that may each be replicated on different data hosts. Because of the large data sets, the execution time is bounded by the cost of data transfer. Minimizing the time of transferring these datasets to the computational resources where the tasks of workflow are executed requires that appropriate computational and data resources be selected. In this paper, we introduce an algorithm MDTT to select the resource set which the task should be mapped. Our experiments show that our algorithm is able to minimize the total makespan of data-intensive workflow and the time of data transferring.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128533365","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.38
Haocong Wang, Xiaoyong Du, Jieping Wang, Pingping Yang
In the Database-As-a-Service (DAS) paradigm, data owners outsource their data to the third-party service provider. Since the service provider is untrusted, the data should be encrypted before outsourced. Various approaches have been proposed to query on encrypted data, among which bucket based method is effective. However, previous researches just look at the data distribution with respect to a given workload, which is ineffective in changing workload behaviors. In this paper, we propose a Self-Tuning Bucket scheme: STBucket. By gathering and analyzing query feedback, STBucket achieves adaptation to workload through online bucket splitting and merging. Experimental results show that STBucket is workload aware and performs well with reasonable overhead.)
{"title":"STBucket: A Self-Tuning Bucket Index in DAS Paradigm","authors":"Haocong Wang, Xiaoyong Du, Jieping Wang, Pingping Yang","doi":"10.1109/ChinaGrid.2009.38","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.38","url":null,"abstract":"In the Database-As-a-Service (DAS) paradigm, data owners outsource their data to the third-party service provider. Since the service provider is untrusted, the data should be encrypted before outsourced. Various approaches have been proposed to query on encrypted data, among which bucket based method is effective. However, previous researches just look at the data distribution with respect to a given workload, which is ineffective in changing workload behaviors. In this paper, we propose a Self-Tuning Bucket scheme: STBucket. By gathering and analyzing query feedback, STBucket achieves adaptation to workload through online bucket splitting and merging. Experimental results show that STBucket is workload aware and performs well with reasonable overhead.)","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127476409","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.17
Jinyu Zhang, Xiaoming Li
We present the second version of Realcourse. Realcourse is a cooperative Internet video publishing and delivery system used by more than thirty Chinese universities to share course videos. The design of Realcourse bears the following assumptions 1) the system is supposed to consists of hundreds of unreliable but controllable servers where temporal failures are common, permanent failures are rare, 2) videos are concurrently uploaded to local servers but their metadata are broadcasted to all servers, 3) users are connected to and served by local servers but should be able to watch all the videos in the system in a seamless and efficient fashion. Realcourse has gone through two versions. In Realcourse1.0, all servers were treated equal and fully connected by messaging channels. In order to maintain a consistent global directory among servers, each server informs all others of local update operations through the message channels. The fully connected server topology poses a great challenge to system management with respect to failures. To solve this problem, Realcourse2.0 adopts a server topology of multiple overlapping stars by 1) replacing direct broadcast with relayed-broadcast, in which message is first sent to a relay server and then forwarded to all other servers, 2) partitioning the global directory into sub-trees, each sub-tree is then fully replicated to a group of selected servers while groups may overlap with each other. This paper explains why such a change is necessary and how it was done. Realcourse has been operational since December 2003. Today, more than 5000 videos are served. We constantly observe about 10000 unique user IP addresses each day.
{"title":"Realcouse2.0: From Fully Connected Topology to Multiple Overlapping Stars","authors":"Jinyu Zhang, Xiaoming Li","doi":"10.1109/ChinaGrid.2009.17","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.17","url":null,"abstract":"We present the second version of Realcourse. Realcourse is a cooperative Internet video publishing and delivery system used by more than thirty Chinese universities to share course videos. The design of Realcourse bears the following assumptions 1) the system is supposed to consists of hundreds of unreliable but controllable servers where temporal failures are common, permanent failures are rare, 2) videos are concurrently uploaded to local servers but their metadata are broadcasted to all servers, 3) users are connected to and served by local servers but should be able to watch all the videos in the system in a seamless and efficient fashion. Realcourse has gone through two versions. In Realcourse1.0, all servers were treated equal and fully connected by messaging channels. In order to maintain a consistent global directory among servers, each server informs all others of local update operations through the message channels. The fully connected server topology poses a great challenge to system management with respect to failures. To solve this problem, Realcourse2.0 adopts a server topology of multiple overlapping stars by 1) replacing direct broadcast with relayed-broadcast, in which message is first sent to a relay server and then forwarded to all other servers, 2) partitioning the global directory into sub-trees, each sub-tree is then fully replicated to a group of selected servers while groups may overlap with each other. This paper explains why such a change is necessary and how it was done. Realcourse has been operational since December 2003. Today, more than 5000 videos are served. We constantly observe about 10000 unique user IP addresses each day.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132038048","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.20
Bennian Dou, Hong Zhang, Chungen Xu, Mu Han
Sequential aggregate signature (SAS) schemes allow multiple signers to sequentially produce a short signature of different messages and also allow signers to attest to these messages as well as the order in which they signed. Identity-based signature (IBS) schemes allow a signer to sign a message, in which the signature can be verified by his identity. At CCS 2007, Boldyreva et al. proposed an identity-based sequential aggregate signature from pairings on elliptic curves, which have the merits of both SAS and IBS schemes. In this paper, we present and prove secure an identity-based sequential aggregate signature scheme, which is not based on pairings but based on RSA.
{"title":"Identity-Based Sequential Aggregate Signature from RSA","authors":"Bennian Dou, Hong Zhang, Chungen Xu, Mu Han","doi":"10.1109/ChinaGrid.2009.20","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.20","url":null,"abstract":"Sequential aggregate signature (SAS) schemes allow multiple signers to sequentially produce a short signature of different messages and also allow signers to attest to these messages as well as the order in which they signed. Identity-based signature (IBS) schemes allow a signer to sign a message, in which the signature can be verified by his identity. At CCS 2007, Boldyreva et al. proposed an identity-based sequential aggregate signature from pairings on elliptic curves, which have the merits of both SAS and IBS schemes. In this paper, we present and prove secure an identity-based sequential aggregate signature scheme, which is not based on pairings but based on RSA.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127430245","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.13
Mengbo Hou, Qiuliang Xu
Grid Security Infrastructure (GSI) provides an efficient mechanism to solve security problems using conventional public key infrastructure (PKI). The notion of certificateless public key cryptography gives another efficient cryptographic primitive to support Grid security services. In the recent work, Wang et al. proposed the first certificateless authentication and key agreement protocol (CL-AK) for Grid computing based on the Diffie-Hellman key agreement protocol and certificateless public key cryptography, which fits well with the GSI and provides a more lightweight key management approach for entity or data authentication and confidential protection. The authors declare that the protocol achieves many security goals. However, we found the scheme cannot withstand key compromise impersonation attack and key replicating attack, thus it doesn’t possess some desirable security attributes, such as key compromise impersonation resilience and key integrity. We analyze the key replicating attack against the protocol in the BR93 security model in more detail.
{"title":"On the Security of Certificateless Authenticated Key Agreement Protocol (CL-AK) for Grid Computing","authors":"Mengbo Hou, Qiuliang Xu","doi":"10.1109/ChinaGrid.2009.13","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.13","url":null,"abstract":"Grid Security Infrastructure (GSI) provides an efficient mechanism to solve security problems using conventional public key infrastructure (PKI). The notion of certificateless public key cryptography gives another efficient cryptographic primitive to support Grid security services. In the recent work, Wang et al. proposed the first certificateless authentication and key agreement protocol (CL-AK) for Grid computing based on the Diffie-Hellman key agreement protocol and certificateless public key cryptography, which fits well with the GSI and provides a more lightweight key management approach for entity or data authentication and confidential protection. The authors declare that the protocol achieves many security goals. However, we found the scheme cannot withstand key compromise impersonation attack and key replicating attack, thus it doesn’t possess some desirable security attributes, such as key compromise impersonation resilience and key integrity. We analyze the key replicating attack against the protocol in the BR93 security model in more detail.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123406837","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}
Distributed metadata management is an important issue in the design and implementation of Data Grid. The key challenge lies in the strategies of metadata synchronization and the representation of the distributed metadata. We have designed a Hierarchical Bloom Filter, which consists of two level Bloom filters, to facilitate the metadata management. A Recent Bloom Filter at the top level is based on the list of recent accessed files while a Summary Bloom Filter at the bottom level represents the set of entire files. Furthermore, we propose a novel update scheme to make Recent Bloom Filters synchronized among metadata servers. Each metadata server could use the Hierarchical Bloom Filters to reduce the update frequency and the network overhead. The experimental results show that the Hierarchical Bloom Filters improve the performance and scalability of Data Grid markedly.
{"title":"Distributed Metadata Management Based on Hierarchical Bloom Filters in Data Grid","authors":"Shihua Chen, Xiaomeng Huang, Pengzhi Xu, Weimin Zheng","doi":"10.1109/ChinaGrid.2009.15","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.15","url":null,"abstract":"Distributed metadata management is an important issue in the design and implementation of Data Grid. The key challenge lies in the strategies of metadata synchronization and the representation of the distributed metadata. We have designed a Hierarchical Bloom Filter, which consists of two level Bloom filters, to facilitate the metadata management. A Recent Bloom Filter at the top level is based on the list of recent accessed files while a Summary Bloom Filter at the bottom level represents the set of entire files. Furthermore, we propose a novel update scheme to make Recent Bloom Filters synchronized among metadata servers. Each metadata server could use the Hierarchical Bloom Filters to reduce the update frequency and the network overhead. The experimental results show that the Hierarchical Bloom Filters improve the performance and scalability of Data Grid markedly.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116226796","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.35
Xiaogang Zhang, Huajun Chen, Jun Ma, Jinhuo Tao
Traditional Chinese Medicine (TCM) Semantic Grid is an application of Semantic Grid technique in TCM domain. It comprises TCM ontology and TCM Databases as data resources and Dart Search, Dart Query etc. as TCM application. This paper reports an ontology engineering component of the TCM Semantic Grid. Although ontology engineering has gained significant progress, ontology construction still mainly depends on manual work and tends to be mistaken prone. In this paper, we introduce a semantic relation verification method based on both domain ontology and domain publications. A modified vector space model is used to extract semantic relations from domain publications, which is particularly useful when the semantic relation cannot be extracted directly. Association rule learning method is used to distinguish significant relations from trivial ones. Further verification method is used to give user recommendations of relation types. We use Traditional Chinese Medicine Language System, domain ontology for Traditional Chinese Medicine, and relevant publications to validate our approach. But our method is not limited to this field. In fact, any data source that can be extracted into relevant instance pairs is applicable.
{"title":"Ontology Based Semantic Relation Verification for TCM Semantic Grid","authors":"Xiaogang Zhang, Huajun Chen, Jun Ma, Jinhuo Tao","doi":"10.1109/ChinaGrid.2009.35","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.35","url":null,"abstract":"Traditional Chinese Medicine (TCM) Semantic Grid is an application of Semantic Grid technique in TCM domain. It comprises TCM ontology and TCM Databases as data resources and Dart Search, Dart Query etc. as TCM application. This paper reports an ontology engineering component of the TCM Semantic Grid. Although ontology engineering has gained significant progress, ontology construction still mainly depends on manual work and tends to be mistaken prone. In this paper, we introduce a semantic relation verification method based on both domain ontology and domain publications. A modified vector space model is used to extract semantic relations from domain publications, which is particularly useful when the semantic relation cannot be extracted directly. Association rule learning method is used to distinguish significant relations from trivial ones. Further verification method is used to give user recommendations of relation types. We use Traditional Chinese Medicine Language System, domain ontology for Traditional Chinese Medicine, and relevant publications to validate our approach. But our method is not limited to this field. In fact, any data source that can be extracted into relevant instance pairs is applicable.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"66 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120924702","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.8
Chong Yao, Keqiu Li, Kai Lin, Yanming Shen
The Exchanged Hypercube is an interconnection network which is obtained by systemically removing some links from a binary hypercube. In parallel systems, load balancing is a very important factor which can affect the performance of the whole system. So distributing tasks evenly on processors is essential for multiprocessor computing systems. Based on the classical DE-based algorithm, in this paper we propose a load balancing algorithm for the Exchanged Hypercube architecture. We also theoretically prove the correctness of the proposed algorithm. Finally, we use a case study to further explain our algorithm.
{"title":"Load Balancing on the Exchanged Hypercube","authors":"Chong Yao, Keqiu Li, Kai Lin, Yanming Shen","doi":"10.1109/ChinaGrid.2009.8","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.8","url":null,"abstract":"The Exchanged Hypercube is an interconnection network which is obtained by systemically removing some links from a binary hypercube. In parallel systems, load balancing is a very important factor which can affect the performance of the whole system. So distributing tasks evenly on processors is essential for multiprocessor computing systems. Based on the classical DE-based algorithm, in this paper we propose a load balancing algorithm for the Exchanged Hypercube architecture. We also theoretically prove the correctness of the proposed algorithm. Finally, we use a case study to further explain our algorithm.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129036178","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}
Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.25
Dong Wang, Jinlei Jiang, Yongwei Wu, Guangwen Yang
This paper describes the design and implementation of CampusWare, a lightweight grid middleware for the compute-intensive applications in campus environment. Though there are many grid middlewares available, they are unnecessarily complex for use in the campus environment where the main applications are compute-intensive, and the main requirements are the convenience and efficiency in clusters management and job submissions. To deal with the problem, CampusWare proposes a “fast job” concept and provides a two-layer middleware architecture as well as a three-layer user account hierarchy. Compared with the existing grid middlewares, its deployment, configuration and usage are all simplified, which makes it easy-to-use, efficient and portable.
{"title":"CampusWare: An Easy-to-Use, Efficient and Portable Grid Middleware for Compute-Intensive Applications","authors":"Dong Wang, Jinlei Jiang, Yongwei Wu, Guangwen Yang","doi":"10.1109/ChinaGrid.2009.25","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.25","url":null,"abstract":"This paper describes the design and implementation of CampusWare, a lightweight grid middleware for the compute-intensive applications in campus environment. Though there are many grid middlewares available, they are unnecessarily complex for use in the campus environment where the main applications are compute-intensive, and the main requirements are the convenience and efficiency in clusters management and job submissions. To deal with the problem, CampusWare proposes a “fast job” concept and provides a two-layer middleware architecture as well as a three-layer user account hierarchy. Compared with the existing grid middlewares, its deployment, configuration and usage are all simplified, which makes it easy-to-use, efficient and portable.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130201026","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：