Pub Date : 2009-08-21DOI: 10.1109/ChinaGrid.2009.46
Chao Zhang, W. Qu, Zhaobin Liu, Wanlei Zhou
Resource allocation and task scheduling are two key technologies in grid computing system. The market-based resource allocation model is considered as a good one. In this paper, an on-line reverse auction method of resource allocation for computational grids was proposed to solve the problem of resource management considering the dynamic characteristics of computing resources in the computational grid environment and the advantages of economics mechanism. In this method, the current price can be set using former bids. And bidders arriving one by one the on-line buyer must be required to make a decision immediately about each bid as it is received. Then we prove that the algorithm is incentive compatible and simulate the auction protocol in Gridsim to evaluate its communication demand.
{"title":"A Resource Allocation Method for Computational Grids Based on On-line Reverse Auction","authors":"Chao Zhang, W. Qu, Zhaobin Liu, Wanlei Zhou","doi":"10.1109/ChinaGrid.2009.46","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.46","url":null,"abstract":"Resource allocation and task scheduling are two key technologies in grid computing system. The market-based resource allocation model is considered as a good one. In this paper, an on-line reverse auction method of resource allocation for computational grids was proposed to solve the problem of resource management considering the dynamic characteristics of computing resources in the computational grid environment and the advantages of economics mechanism. In this method, the current price can be set using former bids. And bidders arriving one by one the on-line buyer must be required to make a decision immediately about each bid as it is received. Then we prove that the algorithm is incentive compatible and simulate the auction protocol in Gridsim to evaluate its communication demand.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"58 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":"125069416","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.24
Yongying He, Ruisheng Zhang, Ruipeng Wei, C. Hu, Lian Li
All chemistry software has its own language and provides its corresponding script editor. A complex chemical job running in Grid environment often requires different chemistry software’s collaboration. The chemist edits computational chemistry program locally, then submits them to the Grid environment. Therefore, chemists need to use appropriate chemical editors for syntax checking when modifying chemical scripts. This process would require installing several kinds of chemistry software locally, which would be time-consuming and inconsequence. This paper proposes a solution, a Chemical Script Editor supporting several chemical script languages, to deal with this issue. The Chemical Script Editor is not only multifunctional and multi-lingual but also simple and easy to install. What’s more, the Chemical Script Editor caters to the dynamic characteristics of Grid environment perfectly. This paper would use a new framework -DLTK- to generate the Chemical Script Editor as a PLUG-INS to Eclipse platform.
{"title":"Designing a Chemical Script Editor in Grid environment with DLTK","authors":"Yongying He, Ruisheng Zhang, Ruipeng Wei, C. Hu, Lian Li","doi":"10.1109/ChinaGrid.2009.24","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.24","url":null,"abstract":"All chemistry software has its own language and provides its corresponding script editor. A complex chemical job running in Grid environment often requires different chemistry software’s collaboration. The chemist edits computational chemistry program locally, then submits them to the Grid environment. Therefore, chemists need to use appropriate chemical editors for syntax checking when modifying chemical scripts. This process would require installing several kinds of chemistry software locally, which would be time-consuming and inconsequence. This paper proposes a solution, a Chemical Script Editor supporting several chemical script languages, to deal with this issue. The Chemical Script Editor is not only multifunctional and multi-lingual but also simple and easy to install. What’s more, the Chemical Script Editor caters to the dynamic characteristics of Grid environment perfectly. This paper would use a new framework -DLTK- to generate the Chemical Script Editor as a PLUG-INS to Eclipse platform.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"36 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":"130906952","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.11
Zhongwen Guo, Pengpeng Chen, Keyong Hu, Yuan Feng, Feng Hong
Testing of household appliances in the manufacturing enterprises often suffers from low efficiency. The adoption of the web services and grid technology can provide the promising future for improving the test and development efficiency of products. This paper describes a complete test platform for household appliances based on web services, which allows the users to carry out efficient data analysis and assist products design by providing curve modeling, laboratory environment modeling and performance modeling services. The architecture and realization of test platform have been illustrated and the scalable grid service has been described in details. To demonstrate the test platform based on web services, a prototype application has been constructed. The results show that the test platform is feasible and effective.
{"title":"A Test Platform for Household Appliances Based on Web Services","authors":"Zhongwen Guo, Pengpeng Chen, Keyong Hu, Yuan Feng, Feng Hong","doi":"10.1109/ChinaGrid.2009.11","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.11","url":null,"abstract":"Testing of household appliances in the manufacturing enterprises often suffers from low efficiency. The adoption of the web services and grid technology can provide the promising future for improving the test and development efficiency of products. This paper describes a complete test platform for household appliances based on web services, which allows the users to carry out efficient data analysis and assist products design by providing curve modeling, laboratory environment modeling and performance modeling services. The architecture and realization of test platform have been illustrated and the scalable grid service has been described in details. To demonstrate the test platform based on web services, a prototype application has been constructed. The results show that the test platform is feasible and effective.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"1 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":"134285718","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.21
Changze Wu, Kaigui Wu, Ming Chen, Chunxiao Ye
Data Replication in large scale distributed systems was introduced for enhancing data availability, reducing network flow and access latency. Efficient selecting the best replica to minimize access latency remains a fundamental challenge. Existing algorithms mostly use the previous history of replica transfers stored locally to estimate the replica access time for selection replica. It will not always give the best result especially stale access replica log. In this research, we propose a replica selection services according to evaluate replication state. To selected the best replica from replication state information according to replica node state fuzzification evaluation. The replica node state’s duration time called “statelife-cycle”. It is calculated by grey prediction model. At last,the experimental results show that proposed replica selection services can improve performance to reducing access latency.
{"title":"Dynamic Replica Selection Services Based on State Evaluation Strategy","authors":"Changze Wu, Kaigui Wu, Ming Chen, Chunxiao Ye","doi":"10.1109/ChinaGrid.2009.21","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.21","url":null,"abstract":"Data Replication in large scale distributed systems was introduced for enhancing data availability, reducing network flow and access latency. Efficient selecting the best replica to minimize access latency remains a fundamental challenge. Existing algorithms mostly use the previous history of replica transfers stored locally to estimate the replica access time for selection replica. It will not always give the best result especially stale access replica log. In this research, we propose a replica selection services according to evaluate replication state. To selected the best replica from replication state information according to replica node state fuzzification evaluation. The replica node state’s duration time called “statelife-cycle”. It is calculated by grey prediction model. At last,the experimental results show that proposed replica selection services can improve performance to reducing access latency.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"472 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":"123951985","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.12
Jianjiang Li, D. Hei, Lin Yan
Using OpenMP to develop multithreaded programs is very simple and easy. However, wrong execution results occur when directives are not properly used. In this paper, a correctness testing and checking technique based on online-offline mixed mode is proposed. Where, online correctness testing only needs to record the data relative to those parallel regions of which execution results are not correct, and at the same time, it is able to identify all wrong parallel regions through one-parse online correctness testing. Offline correctness testing needn’t record relative data of parallel regions and is able to flexibly test the correctness of parallel regions modified repeatedly. The technique overcomes the shortcomings of the high overheads of the existing correctness tools which can’t repeatedly test the correctness of parallel regions.
{"title":"Correctness Analysis Based on Testing and Checking for OpenMP Programs","authors":"Jianjiang Li, D. Hei, Lin Yan","doi":"10.1109/ChinaGrid.2009.12","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.12","url":null,"abstract":"Using OpenMP to develop multithreaded programs is very simple and easy. However, wrong execution results occur when directives are not properly used. In this paper, a correctness testing and checking technique based on online-offline mixed mode is proposed. Where, online correctness testing only needs to record the data relative to those parallel regions of which execution results are not correct, and at the same time, it is able to identify all wrong parallel regions through one-parse online correctness testing. Offline correctness testing needn’t record relative data of parallel regions and is able to flexibly test the correctness of parallel regions modified repeatedly. The technique overcomes the shortcomings of the high overheads of the existing correctness tools which can’t repeatedly test the correctness of parallel regions.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"39 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":"127960377","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.14
Min Zhang, Haitao Jia, Shunsheng Zhang
Complicated Electromagnetic Environment Simulation still puzzles the researchers who are engaged in System Design of large-scale electron system. Even electromagnetic simulation for a less dielectric has great iterative numeration, and complicated environment will refer to more and more calculation units belong to intricate electron equipment and national element. Mass compute, data alternation transfers and complex electromagnetic mechanism actualization will let researcher to go mad. This paper presents a novel system framework to build a complicated electromagnetic environment simulation based on ChinaGrid, which is agile and distributed federations. It can achieve the goal of the simulation system and administer to system design for large electron system.
{"title":"Achievement for Complicated Electromagnetic Environment Simulation Application Based on ChinaGrid","authors":"Min Zhang, Haitao Jia, Shunsheng Zhang","doi":"10.1109/ChinaGrid.2009.14","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.14","url":null,"abstract":"Complicated Electromagnetic Environment Simulation still puzzles the researchers who are engaged in System Design of large-scale electron system. Even electromagnetic simulation for a less dielectric has great iterative numeration, and complicated environment will refer to more and more calculation units belong to intricate electron equipment and national element. Mass compute, data alternation transfers and complex electromagnetic mechanism actualization will let researcher to go mad. This paper presents a novel system framework to build a complicated electromagnetic environment simulation based on ChinaGrid, which is agile and distributed federations. It can achieve the goal of the simulation system and administer to system design for large electron system.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"48 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":"117022223","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.27
Li Qi, Song Wu
In today's highly competitive financial markets, financial innovation and bank's merge and acquisition activities are growing much. How to quickly construct business process upon IT infrastructure becomes the kernel of competition. As one of the classic application of service-oriented architecture, the grid technology can considerably help banks to improve the efficiency of constructing business process. In this paper, a tag-based processing model upon service-oriented grid is proposed. Through the practical scenario, the efficiency and security are demonstrated. Compared with traditional methods, the proposed solution has three advantages: (i) it is general enough to apply to banking applications without modifying upper business logic; (ii) with minor cost on processing normal request, it can provide high security and facility for reconstruction of banking business; (iii) it can help bank construct the new business process in the mean time.
{"title":"Adaptively Construct Banking Process with Tags Upon Services-Oriented Grid","authors":"Li Qi, Song Wu","doi":"10.1109/ChinaGrid.2009.27","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.27","url":null,"abstract":"In today's highly competitive financial markets, financial innovation and bank's merge and acquisition activities are growing much. How to quickly construct business process upon IT infrastructure becomes the kernel of competition. As one of the classic application of service-oriented architecture, the grid technology can considerably help banks to improve the efficiency of constructing business process. In this paper, a tag-based processing model upon service-oriented grid is proposed. Through the practical scenario, the efficiency and security are demonstrated. Compared with traditional methods, the proposed solution has three advantages: (i) it is general enough to apply to banking applications without modifying upper business logic; (ii) with minor cost on processing normal request, it can provide high security and facility for reconstruction of banking business; (iii) it can help bank construct the new business process in the mean time.","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":"115693681","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.44
Jing Xu, Shoubao Yang, Bin Wu, Li-yao Shi
In the background of widely use of grid applications, users would no longer be satisfied with the current grid infrastructure services of “do my best”, and hope the grid system is able to provide those services which can guarantee quality. Furthermore, as the expansion of user group, the service should be much easier to use and correspond with the applications’ particular requirements. Users’ QoS (Quality of Service) requirements are of subjective, fuzzy and incompletely considering, so aiming at these problems this paper proposes a method named FuzzyQoS. It considers users’ multi-QoS requirements using fuzzy decision-making theory based on their preferences in online scheduling. This method not only normalizes the multi-QoS requirements which have the features of subjectivity and fuzziness, but also highlights the QoS requirements of user preferences. It is shown that, with the same system makespan, the degree of user satisfaction is close to other multi-QoS methods and significantly improved comparing with one-dimensional QoS scheduling method. What is the most important, this method does not require users to be sufficiently professional. It is simple, effective and sensitive to the users’ preferences.
{"title":"Research on Multi-QoS On-line Scheduling Based on Fuzzy Theory in the Grid","authors":"Jing Xu, Shoubao Yang, Bin Wu, Li-yao Shi","doi":"10.1109/ChinaGrid.2009.44","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.44","url":null,"abstract":"In the background of widely use of grid applications, users would no longer be satisfied with the current grid infrastructure services of “do my best”, and hope the grid system is able to provide those services which can guarantee quality. Furthermore, as the expansion of user group, the service should be much easier to use and correspond with the applications’ particular requirements. Users’ QoS (Quality of Service) requirements are of subjective, fuzzy and incompletely considering, so aiming at these problems this paper proposes a method named FuzzyQoS. It considers users’ multi-QoS requirements using fuzzy decision-making theory based on their preferences in online scheduling. This method not only normalizes the multi-QoS requirements which have the features of subjectivity and fuzziness, but also highlights the QoS requirements of user preferences. It is shown that, with the same system makespan, the degree of user satisfaction is close to other multi-QoS methods and significantly improved comparing with one-dimensional QoS scheduling method. What is the most important, this method does not require users to be sufficiently professional. It is simple, effective and sensitive to the users’ preferences.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"24 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":"131137872","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.16
Yiqun Zhu, Minglu Li, Chuliang Weng
Task scheduling is one important job in Grid computing and also a hard and complex problem. We have quite a few algorithm of task scheduling in the past researches. Ant Algorithm is a heuristic algorithm. The inherent parallelism and scalability make this algorithm meet the requirement of complex task scheduling in Grid computing.In this paper, we will propose an improved ant algorithm in our power grid environment. We made several improvements on the calculation of pheromone and task issue method as well. The improved algorithm becomes more sensitive with the power grid environment and more robust with heavy workload.
{"title":"Ant Algorithm with Execution Quality Based Prediction in Grid Scheduling","authors":"Yiqun Zhu, Minglu Li, Chuliang Weng","doi":"10.1109/ChinaGrid.2009.16","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.16","url":null,"abstract":"Task scheduling is one important job in Grid computing and also a hard and complex problem. We have quite a few algorithm of task scheduling in the past researches. Ant Algorithm is a heuristic algorithm. The inherent parallelism and scalability make this algorithm meet the requirement of complex task scheduling in Grid computing.In this paper, we will propose an improved ant algorithm in our power grid environment. We made several improvements on the calculation of pheromone and task issue method as well. The improved algorithm becomes more sensitive with the power grid environment and more robust with heavy workload.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"1 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":"124157950","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.31
Rong Deng, Changjun Jiang, Qinma Kang, Fei Yin
The problem of scheduling task graph which is represented by DAG (Directed Acyclic Graph) in Heterogeneous Environment is not a new problem. However, up to now nearly all of the Heuristics use Forward Planning methods. This paper introduces novel BackWard Planning (BWP) procedure in this field. Quite different from Forward Planning methods, BWP always delays the tasks’ starttime as late as possible, in an attempt to delay the starttime of the entry nodes and shorten the makespan of the schedule in the end.Combining BWP and traditional List Scheduling Algorithm, this paper proposes a two pass Forward/Backward (F/B) scheduling technique which can improve the performance of the original algorithm significantly. Using famous HEFT algorithm as example, we evaluate and compare the performance of two scheduling technique: our F/B technique and traditional insertion based scheduling technique used by HEFT and some other existing list scheduling algorithms. The experimental results indicate that F/B technique outperforms another in all the metrics considered in our examination.
{"title":"Backward Planning: A Simple and Efficient Method to Improve the Performance of List Scheduling Algorithms","authors":"Rong Deng, Changjun Jiang, Qinma Kang, Fei Yin","doi":"10.1109/ChinaGrid.2009.31","DOIUrl":"https://doi.org/10.1109/ChinaGrid.2009.31","url":null,"abstract":"The problem of scheduling task graph which is represented by DAG (Directed Acyclic Graph) in Heterogeneous Environment is not a new problem. However, up to now nearly all of the Heuristics use Forward Planning methods. This paper introduces novel BackWard Planning (BWP) procedure in this field. Quite different from Forward Planning methods, BWP always delays the tasks’ starttime as late as possible, in an attempt to delay the starttime of the entry nodes and shorten the makespan of the schedule in the end.Combining BWP and traditional List Scheduling Algorithm, this paper proposes a two pass Forward/Backward (F/B) scheduling technique which can improve the performance of the original algorithm significantly. Using famous HEFT algorithm as example, we evaluate and compare the performance of two scheduling technique: our F/B technique and traditional insertion based scheduling technique used by HEFT and some other existing list scheduling algorithms. The experimental results indicate that F/B technique outperforms another in all the metrics considered in our examination.","PeriodicalId":212445,"journal":{"name":"2009 Fourth ChinaGrid Annual Conference","volume":"19 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":"134493126","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
扫码关注我们
求助内容：
应助结果提醒方式：