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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

TRES-CORE: Content-based retrieval based on the balanced tree in Peer to Peer systems

引用

9th International Conference on Parallel computing Technologies

作者： Jin, Hai Xu, Jie Huazhong Univ Sci & Technol Sch Comp Sci & Technol Cluster & Grid Computing Lab Wuhan 430074 Peoples R China

ISBN: (纸本)9783540739395

Most existing Peer to Peer (P2P) systems support name-based retrieval and have provided very limited support for the full-text search of document contents. In this paper, we present a scheme (TRES-CORE) to support content-based retrieval. First, we propose a tree structure to organize data objects in vector-format in the P2P system, which is height-balanced so that the time complexity of search can be decreased. Second, we give a simple strategy for the placement of tree's nodes, which can guarantee both load balancing and fault tolerance. Then an efficient policy for the query is given. Besides theoretical analysis that can prove the correctness of our scheme, a simulation-based study is carried out to evaluate its performance under various scenarios finally. In this study, it shows that using this content-based retrieval scheme (TRES-CORE) is more accurate and more efficient than some other schemes in the P2P system.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

High performance RDF updates with triplebit + 13

High performance RDF updates with triplebit +

引用

13th International Conference on Digital Information Management, ICDIM 2018

作者： Yuan, Pingpeng Fan, Lijian Jin, Hai Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781538652435

The volume of RDF data continues to grow over the past decade and many known RDF datasets have billions of triples. A grant challenge of managing this huge RDF data is how to access this big RDF data efficiently. A popular approach to addressing the problem is to build a full set of permutations of (S, P, O) indexes. Although this approach has shown to accelerate joins by orders of magnitude, the large space overhead limits the scalability of this approach and makes it heavyweight. In this paper, we present TripleBit +, a fast and compact system for updating RDF data. The design of TripleBit + has two salient features. First, the efficient maintenance strategies of TripleBit + reduces both the overhead to update data and indexes. Second, effective maintenance technologies to handle online updates over RDF repositories are proposed. Our experiments show that TripleBit + outperforms RDF-3X, MonetDB, BitMat on LUBM, UniProt, and BTC 2012 benchmark queries and it offers orders of mangnitude performance improvement for some complex join queries. Our design also yields high task rates as high as 660,000 per second and fast average response time of task which is faster than x-RDF-3X and PostgreSQL. © 2018 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

A survey of cloud resource management for complex engineering applications

引用

Frontiers of Computer Science 2016年第3期10卷 447-461页

作者： Haibao CHEN Song WU Hai JIN Wenguang CHEN Jidong ZHAI Yingwei LUO Xiaolin WANG Services Computing Technology and System Lab Cluster and Grid Computing LabSchool of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Institute of High Performance Computing Tsinghua University Beijing 100084 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China School of Computer and Information Engineering Chuzhou University Chuzhou 239000 China

Traditionally, complex engineering applications （CEAs）, which consist of numerous components （software） and require a large amount of computing resources, usu- ally run in dedicated clusters or high performance computing （HPC） centers. Nowadays, Cloud computing system with the ability of providing massive computing resources and cus- tomizable execution environment is becoming an attractive option for CEAs. As a new type on Cloud applications, CEA also brings the challenges of dealing with Cloud resources. In this paper, we provide a comprehensive survey of Cloud resource management research for CEAs. The survey puts forward two important questions： 1） what are the main chal- lenges for CEAs to run in Clouds？ and 2） what are the prior research topics addressing these challenges？ We summarize and highlight the main challenges and prior research topics. Our work can be probably helpful to those scientists and en- gineers who are interested in running CEAs in Cloud envi- ronment.

关键词： Cloud computing complex engineering application resource management virtualization

来源：评论

学校读者我要写书评

暂无评论

A High-efficient inter-domain data transferring system for virtual machines 09

A High-efficient inter-domain data transferring system for v...

引用

3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09

作者： Li, Dingding Jin, Hai Shao, Yingzhe Liao, Xiaofei Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781605584058

Virtual machine (VM) technologies are becoming more and more important among industrial and academic institutions with the decreasing cost of computer hardware. It can offer a lot of benefits including performance isolation, server consolidation, and live migration. However, the development of virtualization technology is preferred to application isolation as yet, thus the performance overheads of communicate between virtual machines which are resident on the same physical machine are relatively high. In network-intensive applications, such as Internet servers, are consolidated in a physical machine using VM technology, the inter-domain shared memory communication mechanisms is necessary. In other words, nearly all the virtual machine monitors are not very efficient in I/O performance to meet these applications' requirements. As a result, some scholars resort to inter-domain shared memory mechanisms to improve data transferring performance, but some of these solutions only provide one-way tunnel for domains to communicate with each other, and others are not network-bypass, which use the existing AF-INET protocol family, and incur unnecessary overhead brought by TCP/IP stack. In this paper, we present an inter-domain data transferring system, called IDTS, with dual-way tunnels and fully network-bypass features in Xen virtual machine environment. The design of IDTS is different from virtual network scheme in that IDTS uses static circular memory buffer shared between domains instead of the Xen page-flipping mechanism. In order to enable dual-way communication, IDTS provides two shared memory tunnels for co-resident domains to communicate with each other. Our evaluation demonstrates that IDTS can reduce inter-domain round trip latency by nearly a factor of 4, and increase bandwidth by approximately 5 times, and also keep high scalability, compared with traditional TCP/IP approach. Copyright 2009 ACM.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Evaluating RISC-V Vector Instruction Set Architecture Extension with Computer Vision Workloads

引用

Journal of Computer Science & Technology 2023年第4期38卷 807-820页

作者：李若时彭平邵志远金海郑然 National Engineering Research Center for Big Data Technology and System Huazhong University of Science and Technology Wuhan 430074China Services Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074 China Cluster and Grid Computing Lab Huazhong University of Science and TechnologyWuhan 430074China

Computer vision(CV)algorithms have been extensively used for a myriad of applications *** the multimedia data are generally well-formatted and regular,it is beneficial to leverage the massive parallel processing power of the underlying platform to improve the performances of CV *** Instruction Multiple Data(SIMD)instructions,capable of conducting the same operation on multiple data items in a single instruction,are extensively employed to improve the efficiency of CV *** this paper,we evaluate the power and effectiveness of RISC-V vector extension(RV-V)on typical CV algorithms,such as Gray Scale,Mean Filter,and Edge *** our examinations,we show that compared with the baseline OpenCV implementation using scalar instructions,the equivalent implementations using the RV-V(version 0.8)can reduce the instruction count of the same CV algorithm up to 24x,when processing the same input ***,the actual performances improvement measured by the cycle counts is highly related with the specific implementation of the underlying RV-V *** our evaluation,by using the vector co-processor(with eight execution lanes)of Xuantie C906,vector-version CV algorithms averagely exhibit up to 2.98x performances speedups compared with their scalar counterparts.

关键词： RISC-V vector extension single instruction multiple data(SIMD) computer vision OpenCV

来源：评论

学校读者我要写书评

暂无评论

Athena: A real-time performance evaluation for distributed software with reliability-constrained

Athena: A real-time performance evaluation for distributed s...

引用

Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Jin, Hai Xie, Xia Li, Yunfa Han, Zongfen Chen, Hao Cluster and Grid Computing Lab. Huazhong Univ. of Sci. and Technol. Wuhan 430074 China

ISBN: (纸本)0769521320

In this paper, we propose an approach for the real-time performance analysis of distributed software with reliability constraints, called Athena. The approach is based on the principle of distributed program real-time performance analysis. In Athena, we design some algorithms, count the transmission time for all the transmission paths of each data file, and then calculate response time of each data file with reliability constraint. So the real-time performance of distributed software with reliability-constrained can be evaluated.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Yarqs: Yet another range queries schema in DHT based P2P network

Yarqs: Yet another range queries schema in DHT based P2P net...

引用

IEEE 9th International Conference on Computer and Information Technology, CIT 2009

作者： Zhang, Hao Jin, Hai Zhang, Qin Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769538365

Range query in DHT based P2P network is a hot topic in recent researches. The hashing function in DHT protocols makes the data hard to keep their original order relationship. Hence range queries for such networks become difficult. This paper presents the design of Yarqs - a new schema to achieve range queries in DHT based P2P networks. By using the inherent characteristics of DHT based networks, Yarqs catches the data pass the nodes and organizes them as a cache network. The range queries are deployed over the cache network. Yarqs does not change the design of the DHT overlay and builds the architecture for range queries by using the historical DHT queries data. Yarqs supports inherent load balancing. We also study the performance of Yarqs in evaluation section. The experiments to check the influences of different parameters of Yarqs are deployed and analyzed. © 2009 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：