检索结果-内蒙古大学图书馆

Transactional Memory Consistency : A New Consistency Model for Distributed Transactional Memory

Transactional Memory Consistency : A New Consistency Model f...

The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

作者： Xuping Tu Xuepeng Fan Hai Jin Long Zheng Xin Peng Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Transactional memory (TM) is a parallel programming concept. Existing consistency protocols in distributed transactional memory system consume too much bandwidth and bring high latency. In this paper, we propose our Transaction Memory Consistency Protocol (TMCP), and point the new features compared to the current protocols. After formulating our model and analyzing the performance, we found both too much and too little execution time will cause more conflicts, given that the execution time of transaction population follows Gamma distribution. We indicate that it is important to adjust the execution time to a reasonable value to improve performance.

关键词： distributed system distributed shared memory software transactional memory consistency model

来源：评论

学校读者我要写书评

暂无评论

Modeling Distributed Stream Processing systems Under Heavy Workload

Modeling Distributed Stream Processing Systems Under Heavy W...

引用

International Conference on Cyberworlds

作者： Muhammad Mudassar Qureshi Hanhua Chen Hai Jin Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Big data applications play a significant role in diverse fields. Distributed Stream Processing Engines (DSPEs) are widely used to support real time applications efficiently. Partitioning algorithms are used to partition data streams into multiple nodes to process in parallel to gain efficient performance. Aggregation cost is an important factor when process stateful streaming applications using such partitioning algorithms because it plays an important role on performance when final result is being produced in stateful streaming applications. However, impact of aggregation cost in stream processing is not discussed comprehensively in existing literature. We use performance modeling to identify the importance of aggregation cost when workload is high. We implement performance model on a multi-node cluster to predict the same behavior as on single resource performance model. We demonstrate that stateful streaming applications need more resources as compare to stateless applications when workload is high and both stateful and stateless applications are running in the same DSPE. Experiments results show that a stateful streaming application needs more resources compared to a stateless streaming application when both applications are running on the same DSPE when the workload is high. Further experiment results show that the performance modeling may be helpful to predict maximum workload that can be process on a DSPE and increase in parallelism level is not guaranteed to increase the performance of streaming applications.

关键词： Partitioning algorithms Data models Predictive models Heuristic algorithms Big Data applications Throughput

来源：评论

学校读者我要写书评

暂无评论

Assessing MapReduce for Internet computing: A Comparison of Hadoop and BitDew-MapReduce

Assessing MapReduce for Internet Computing: A Comparison of ...

引用

International Workshop on grid computing

作者： Lu Lu Hai Jin Xuanhua Shi Gilles Fedak Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China INRIA Universitý of Lyon Lyon France

MapReduce is emerging as an important programming model for data-intensive application. Adapting this model to desktop grid would allow taking advantage of the vast amount of computing power and distributed storage to execute new range of application able to process enormous amount of data. In 2010, we have presented the first implementation of MapReduce dedicated to Internet Desktop grid based on the BitDew middleware. In this paper, we present new optimizations to BitDew-MapReduce (BitDew-MR): aggressive task backup, intermediate result backup, task re-execution mitigation and network failure hiding. We propose a new experimental framework which emulates key fundamental aspects of Internet Desktop grid. Using the framework, we compare BitDew-MR and the open-source Hadoop middleware on grid5000. Our experimental results show that 1) BitDew-MR successfully passes all the stress-tests of the framework while Hadoop is unable to work in typical wide-area network topology which includes PC hidden behind firewall and NAT; 2) BitDew-MR outperforms Hadoop performances on several aspects: scalability, fairness, resilience to node failures, and network disconnections.

关键词： Peer to peer computing Runtime Internet Dynamic scheduling Distributed databases Heart beat Data processing

来源：评论

学校读者我要写书评

暂无评论

Echo: An Edge-Centric Code Offloading system with Quality of Service Guarantee

arXiv

引用

arXiv 2018年

作者： Lin, Li Liao, Xiaofei Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Code offloading is promising to accelerate mobile applications and save energy of mobile devices by shifting some computation to cloud. However, existing code offloading systems suffer from a long communication delay between mobile devices and cloud. To address this challenge, in this paper, we consider to deploy edge nodes in the proximity of mobile devices, and study how they benefit code offloading. We design an edge-centric code offloading system, called Echo, over a three-layer computing hierarchy consisting of mobile devices, edge and cloud. A critical problem needs to be addressed by Echo is to decide which method should be offloaded to which computing platform (edge or cloud). Different from existing offloading systems that let mobile devices individually make offloading decisions, Echo implements a centralized decision engine at the edge node. This edge-centric design can fully exploit the limited hardware resources at the edge to provide an offloading service with Quality of Service guarantee. Furthermore, we propose some novel mechanisms, e.g., lazy object transmission and differential object update, to further improve system performance. The results of a small-scale real deployment and trace-driven simulations show that Echo significantly outperforms existing code offloading systems at both execution time and energy consumption. Copyright © 2018, The Authors. All rights reserved.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Pricing Strategies in grid Market: Simulation and Analysis

Pricing Strategies in Grid Market: Simulation and Analysis

引用

第七届网格与协同计算国际会议(Seventh International Conference on grid and Cooperative computing GCC 2008)

作者： Jin Huang Hai Jin Song Wu Xia Xie Simon See Jie Song Melvin Koh Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of S Asia Pacific Science and Technology Center Sun Microsystems Inc.Singapore

ISBN: (纸本)9781424432806

The most important concept of a market is price – the terms on which the trading objects (products or services) are exchanged. In an ideal market, the price is a reflection of the current state of the market, and therefore it should be dynamic. From the seller perspective, using an effective dynamic pricing strategy can make a difference between making a profit or loss in a makret. In a grid marketplace, the strategy is even more important given it is very dynamic and volatile nature. In this paper, we describe and review three different pricing strategies for the grid market: Demand-Response, Revenue-Response and Price-Maximizing strategy, and analyze their behavior in different market conditions using simulation approach. Our results show that two of the strategies are able to generate high revenue in various market conditions.

关键词： Auction pricing strategies grid market simulation

来源：评论

学校读者我要写书评

暂无评论

PBJIM: Plugin-based Job Interoperation Mechanism for Heterogeneous grid systems

PBJIM: Plugin-based Job Interoperation Mechanism for Heterog...

引用

第六届网格与协同计算国际会议(The Sixth International Conference on grid and Cooperative computing GCC 2007)

作者： Song Wu Yongcai Tao Zhongqing Xu Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

With the development of grid technology, grid gains more popularity that ever and a variety of grid middlewares come into being. However, most of grid middlewares are developed by their own, and it's not easy to interoperate these grid platforms. Existing grid interoperability projects mainly resorts to case-by-case mechanism, which is simple but of poor scalability. Job management is the core and the most complex components of grid system. To realize the interoperability of heterogeneous grids, the interoperation of heterogeneous job managements must be addressed In the paper, a plugin based job interoperation mechanism for heterogeneous grid systems, called PBJIM, is proposed, which is based on the idea of virtualization and plug-in *** are two well-established grid systems in china,chinagrid and china National grid, and they are built with two different grid middlewares, CGSP and VEGA. Via PBJIM, the interoperation of job management of these two grid systems is achieved.

关键词： Middleware grid computing Information management Identity management systems Computer science Scalability Standards development Data security Information security Management information systems

来源：评论

学校读者我要写书评

暂无评论

Public auditing for secure data storage in cloud through a third party auditor using modern ciphertext

Public auditing for secure data storage in cloud through a t...

引用

International Symposium on Information Assurance and Security (IAS)

作者： Zaid Alaa Hussien Hai Jin Zaid Ameen Abduljabbar Ali A. Yassin Mohammed Abdulridha Hussain Salah H. Abbdal Deqing Zou Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China University of Basrah Basrah Iraq

ISBN: (纸本)9781467387163

Outsourced data in cloud and computation results are not always trustworthy because data owners lack physical possession and control over the data as a result of virtualization, replication, and migration techniques. Protecting outsourced data from security threats has become a challenging and potentially formidable task in cloud computing; hence, many schemes have focused on ameliorating this problem and on enabling public auditability for cloud data storage security. These schemes drop into two categories: total computation cost and burden on client side. Researchers have used bilinear map technology with public key cryptography. Although this technology is highly efficient, computation time is long and overhead cost is high. The client needs to perform numerous computations to ensure the integrity of data storage. To reduce auditing cost, we propose an efficient and robust scheme to maintain data integrity in cases that involve public auditing. Our scheme adopts modern cipher cryptography with a cryptographic hash function. We consider allowing a third party auditor to preprocess data on behalf of cloud users before uploading them to cloud service providers and then verifying data integrity afterward. Our proposed scheme has important security characteristics, such as privacy, key management, low cost computation, key exchange, low overhead cost, no burden on client side, inability of cloud service providers to create correct verifier respond without data, and one-time key. Finally, efficiency analysis shows that our scheme is faster and more cost-efficient than the bilinear map-based scheme.

关键词： Cloud computing Cryptography Memory Metadata Outsourcing Protocols

来源：评论

学校读者我要写书评

暂无评论

GradedDAG: An Asynchronous DAG-based BFT Consensus with Lower Latency

GradedDAG: An Asynchronous DAG-based BFT Consensus with Lowe...

引用

Reliable Distributed systems

作者： Xiaohai Dai Zhaonan Zhang Jiang Xiao Jingtao Yue Xia Xie Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China School of Computer Science and Technology Hainan University China

To enable parallel processing, the Directed Acyclic Graph (DAG) structure is introduced to the design of asyn-chronous Byzantine Fault Tolerant (BFT) consensus protocols, known as DAG-based BFT. Existing DAG-based BFT protocols operate in successive waves, with each wave containing three or four Reliable Broadcast (RBC) rounds to broadcast data, resulting in high latency due to the three communication steps required in each RBC. For instance, Tusk, a state-of-the-art DAG-based BFT protocol, has a good-case latency of 7 communication steps and an expected worst latency of 21 communication steps. To reduce latency, we propose GradedDAG, a new DAG-based BFT consensus protocol based on our adapted RBC called Graded RBC (GRBC) and the Consistent Broadcast (CBC), with each wave consisting of only one GRBC round and one CBC round. Through GRBC, a replica can deliver data with a grade of 1 or 2, and a non-faulty replica delivering the data with grade 2 can ensure that more than 2/3 of replicas have delivered the same data. Meanwhile, through CBC, data delivered by different non-faulty replicas must be identical. In each wave, a block in the GRBC round will be elected as the leader. If a leader block has been delivered with grade 2, it and all its ancestor blocks can be committed. GradedDAG offers a good-case latency of 4 communication steps and an expected worst latency of 7.5 communication steps, significantly lower than the state-of-the-art. Experimental results demonstrate GradedDAG's feasibility and efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PKTown: A Peer-to-Peer Middleware to Support Multiplayer Online Games

PKTown: A Peer-to-Peer Middleware to Support Multiplayer Onl...

引用

International Conference on Multimedia and Ubiquitous Engineering (MUE)

作者： Hai Jin Hong Yao Xiaofei Liao Sirui Yang Wei Liu Yong Jia Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Geoscience Wuhan China

Peer-to-peer (P2P) system can support service for lots of end users with little hardware investment, which suits for the efforts to lower down the service cost for multiplayer online games (MOG). In this paper, we introduce PKTown, a P2P middleware inserted into Star Craft and the network layer. PKTown captures all packets generated by Star Craft. We apply application layer multicast (ALM) to transmit the broadcast packets through overlay network. PKTown extends the LAN game experiences to players belong to different LAN. We design a k-regular random overlay network based on game specific requirements analysis. No change is made on binary code of Star Craft. Preliminary test results show that PKTown works well and supports other MOG in the same way. Our contribution is to provide a new game experience method with little hardware investment.

关键词： Peer to peer computing Middleware Local area networks Hardware Investments Web server Costs Broadcasting Binary codes Testing

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities 24

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability Dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：