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

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Ni, Sheng Guo, Rentong Liao, Xiaofei Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271217

Bloom filters are widely used in databases and network areas. These filters facilitate efficient membership checking with a low false positive ratio. It is a way to improve the throughput of bloom filter by parallel processing. Common many-core processors such as Xeon Phi can provide high parallelism. Thus, we build an iterative model to analyze memory access performance. This performance suggests that the bottleneck in the traditional design is mainly caused by synchronization cost and memory latency on many-core platforms. Therefore, we propose a parallel bloom filter (PBF), which is a lockless method involving input data preprocessing. This method reduces synchronization overhead and improves cache locality. We also implement and evaluate PBF on a Xeon Phi processor. Results show that the memory access performance is three times better than that of the counting bloom filter. PBF provides improved scalability, and the speedup ratio can reach a maximum of 80.7x. © Springer International Publishing Switzerland 2015.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

CDMCR: multi-level fault-tolerant system for distributed applications in cloud

CDMCR: multi-level fault-tolerant system for distributed app...

引用

作者： Qiang, Weizhong Jiang, Changqing Ran, Longbo Zou, Deqing Jin, Hai Services Computing Technology and System Lab and Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Cloud provides users with a new model of utilizing the computing infrastructure with the ability to perform parallel and distributed computations using elastic virtual cluster. However, the multi-level and complex features make cloud computing system more prone to failure. In this paper, we present a multi-level fault-tolerant system for distributed applications in cloud named Distributed-application oriented Multi-level Checkpoint/Restart for Cloud (CDMCR). The CDMCR system backups the complete state of applications periodically with a snapshot-based distributed checkpointing protocol, including file system state. Thus, we cannot only recover processes but also rollback data. A multi-level recovery strategy is proposed, which includes process-level recovery, virtual machine recreation, and host rescheduling, enabling comprehensive and efficient fault tolerance for different components in cloud. We deploy CDMCR as PaaS, so that users can be liberated from node management and system configuration and get access to fault-tolerant service conveniently. We have implemented this system based on the Xen virtualization platform and the OpenNebula cloud platform. Experiments on the prototype demonstrate the correctness of the system. Analysis shows that CDMCR does not cause message loss or data loss, and the backup time remains nearly constant as the number of nodes increases on virtual cluster. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Media Power Measuring via Emotional Contagion

引用

Journal of Social computing 2024年第1期5卷 15-35页

作者： Xue Lin Hong Huang Zongya Li Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China School of Journalism Huazhong University of Science and TechnologyWuhan 430074China

Media power,the impact that media have on public opinion and perspectives,plays a significant role in maintaining internal stability,exerting external influence,and shaping international dynamics for nations/***,prior research has primarily concentrated on news content and reporting time,resulting in limitations in evaluating media *** more accurately assess media power,we use news content,news reporting time,and news emotion simultaneously to explore the emotional contagion between *** use emotional contagion to measure the mutual influence between media and regard the media with greater impact as having stronger media *** propose a framework called Measuring Media Power via Emotional Contagion(MMPEC)to capture emotional contagion among media,enabling a more accurate assessment of media power at the media and national/regional *** also interprets experimental results through correlation and causality analyses,ensuring *** analyses confirm the higher accuracy of MMPEC compared to other baseline models,as demonstrated in the context of COVID-19-related news,yielding compelling and interesting insights.

关键词： explainability media power emotional contagion

来源：评论

学校读者我要写书评

暂无评论

A new approach for vehicle recognition and tracking in multi-camera traffic system 15th

A new approach for vehicle recognition and tracking in multi...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Jiang, Wenbin Lu, Zhiwei Jin, Hai Chi, Ye Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271361

In order to ensure recognition accuracy, intelligent traffic video tracking system usually requires various types of information. Therefore, multi-features fusion becomes a good choice. In this paper, a new recognition approach for vehicle types based multi-feature fusion is proposed, which is used for vehicle tracking in a multi-camera traffic system. An improved Canny operator is presented for edge detection. SURF (Speeded Up Robust Features) is used for local feature extraction. To improve the performance of distance cal- culation between features, a refined method based on Hellinger kernel is put forward. A position constraint rule is applied to reduce unnecessary fake matchings. Finally, the information of vehicle types combined with LBP (Local Binary Pattern), HOG (Histogram of Oriented Gradients) is used for a multi-camera vehicle tracking platform, which adopts Hadoop to realize the parallel computing of the system. Experimental results show that the proposed approach has good performance for the platform. © Springer International Publishing Switzerland 2015.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

Boosting mapreduce with network-aware task assignment 4th

Boosting mapreduce with network-aware task assignment

引用

4th International Conference on Cloud computing, CloudComp 2013

作者： Xu, Fei Liu, Fangming Zhu, Dekang Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319055053

Running MapReduce in a shared cluster has become a recent trend to process large-scale data analytical applications while improving the cluster utilization. However, the network sharing among various applications can make the network bandwidth for MapReduce applications constrained and heterogeneous. This further increases the severity of network hotspots in racks, and makes existing task assignment policies which focus on the data locality no longer effective. To deal with this issue, this paper develops a model to analyze the relationship between job completion time and the assignment of both map and reduce tasks across racks. We further design a network-aware task assignment strategy to shorten the completion time of MapReduce jobs in shared clusters. It integrates two simple yet effective greedy heuristics that minimize the completion time of map phase and reduce phase, respectively. With large-scale simulations driven by Facebook job traces, we demonstrate that the network-aware strategy can shorten the average completion time of MapReduce jobs, as compared to the state-of-the-art task assignment strategies, yet with an acceptable computational overhead. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

HRF: A resource allocation scheme for moldable jobs 15

HRF: A resource allocation scheme for moldable jobs

引用

12th ACM International Conference on computing Frontiers, CF 2015

作者： Wu, Song Tuo, Qiong Jin, Hai Yan, Chuxiong Weng, Qizheng Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781450333580

Moldable jobs, which allow the number of allocated processors to be adjusted before running in clusters, have attracted increasing concern in parallel job scheduling research. Compared with traditional rigid jobs where the number of allocated processors is fixed, moldable jobs are more flexible and therefore have more potential for improving their average turnaround time (a crucial metric to describe performance of jobs in a cluster). Average turnaround time of moldable jobs depends greatly on resource allocation schemes. Unfortunately, existing schemes do not perform well in reducing average turnaround time, either because they only consider a single job's turnaround time instead of the average turnaround time of all jobs, or because they just aim at fairness between short and long jobs instead of their average turnaround time. In this paper, we investigate how resource allocation affects the average turnaround time of moldable jobs in clusters, and propose a scheme named HRF (highest revenue first), which allocates processors according to the highest revenue of shortening runtime. In our simulations, experimental results show that HRF can reduce average turnaround time up to 71% when compared with state-of-the-art schemes. © Copyright 2015 ACM.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A data-centric tool to improve the performance of multithreaded program on NUMA 15th

A data-centric tool to improve the performance of multithrea...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Zeng, Dan Zhu, Liang Liao, Xiaofei Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271392

Non-uniform memory access (NUMA) is one of the main architectures of today’s high-performance server. The key feature of NUMA is the non-uniformity of access latency. Access from a processor to attached memory is faster, and it also reduces the possibility of causing contention on interconnect links and memory controller. Multithreaded programs may experience high memory latency without careful placement of data and thread. Thus, it is necessary to develop a tool to identify and help ameliorate NUMA problems. In this paper, we present a data-centric tool to analyze the performance of multithreaded programs on NUMA architectures and provide advices on how to improve the performance. This paper describes the design and implementation of the tool. The tool is evaluated on Linux using three benchmark applications, and the evaluation shows how this tool helps to identify costly variables and choose optimization methods. The result shows performance improvement of up to 51.92%. © 2015 Springer International Publishing Switzerland.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Dependency-aware maintenance for dynamic grid services

Dependency-aware maintenance for dynamic grid services

引用

36th International Conference on Parallel Processing in Xi'an, ICPP

作者： Jin, Hai Qi, Li Wu, Song Luo, Yaqin Dai, Jie Cluster and Grid Computing Lab. Service Computing Technology and System Huazhong University of Science and Technology

ISBN: (纸本)076952933X

Any mistaken maintenance for the complicated and distributed grid can bring unpredictable disaster. Here we focus on the system availability issues caused by service dependencies during the maintenance in grid. A novel mechanism, called Cobweb Guardian, is proposed in this paper. It provides multiple granularities (service-, container-, and node-level) maintenance for service components in grid. By using the Cobweb Guardian, grid administrators can execute the maintaining task safely in runtime with high availability. The evaluation results show that our proposed dependency-aware maintenance can make the grid management more automatic and available. © 2007 IEEE.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

Automatic detection and recognition of silicosis in chest radiograph

Automatic detection and recognition of silicosis in chest ra...

引用

作者： Zhu, Lei Zheng, Ran Jin, Hai Zhang, Qin Zhang, Wei Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Silicosis remains one of the most harmful occupational respiratory diseases. It threatens the workers exposed to dust environment. Chest radiograph is the main available image source for silicosis diagnosis according to the diagnostic criteria of pneumoconiosis (DCP). Automatic detection and recognition of silicosis in chest radiograph has great importance on aiding the process of silicosis diagnosis. This paper proposes a multi-scale opacity detection approach to detect all suspected opacities from the chest radiograph. A support vector machine (SVM) based computer-aided silicosis diagnosis is proposed to recognize silicosis opacity from a large amount of candidate regions, and gives processing result for radiologist reference. Comprehensive experiments conducted on real world chest radiographs demonstrate that the proposed approach can reveal changes of silicosis pathology well, and it can be adopted as an effective tool for automatic silicosis diagnosis. © 2014 - IOS Press and the authors.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Minimizing Overheads of Checkpoints in Distributed Stream Processing systems 7

Minimizing Overheads of Checkpoints in Distributed Stream Pr...

引用

7th IEEE International Conference on Cloud Networking, CloudNet 2018

作者： Muhammad Abrar Akber, Syed Chen, Hanhua Wang, Yonghui Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab Services Computing Technology and System Lab Big Data Technology and System Lab Wuhan430074 China

ISBN: (纸本)9781538668313

Failure occurrence in large-scale systems is inevitable, which makes the resilience a key challenge for modern systems. Checkpoints with rollback recovery is a well-known approach to provide fault tolerance in distributed systems. The checkpoint based fault tolerance approach periodically persists the application state to reliable storage, which serves as a recovery point in case of failure. These periodic checkpoints are not inline with the failure rate of the systems as many studies conclude that failure occurrence is not periodic. The optimal size of checkpoint interval is a crucial decision, which directly determines the checkpoint overheads. To minimize the checkpoint overheads, we propose to reduce the number of checkpoints during the application execution. We suggest reducing the number of checkpoints by successively increasing the checkpoint intervals. We consider the failure probability of the underlying infrastructure and iteratively increase the checkpoint intervals. The proposed checkpoint approach tailors the checkpoint initializing based on the failure probability. If failure probability is low, it increases the checkpoint interval, and eventually reduces the total number of checkpoints triggered during application timespan. Reducing the total number of checkpoints during application execution results in decreasing the checkpoint overheads. The experiment results show that the proposed checkpoint policy considerably reduces the checkpoint overheads as compared to periodic checkpoints. © 2018 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：