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

International Conference on Computer Communications and Networks (ICCCN)

作者： Xiao Lei Zaiyang Tang Peng Li Hai Jin Song Guo Xiaofei Liao Feng Lu Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Aizu Daigaku Aizuwakamatsu Fukushima JP School of Computer Science and Engineering The University of Aizu Japan

It has been recognized that cellular network interfaces are not energy efficient because of tail energy after each transmission. Although many research efforts have been made to reduce tail energy, they ignore the dynamic of link quality caused by user mobility or network congestion, which would lead to limited improvement without quality-of-experience guarantee. In this paper, we study to minimize energy consumption of the cellular network interface with a sequence of download/upload requests. Given accurate estimation of achievable link rate, we design a dynamic-programming (DP) based algorithm to obtain the optimal solution. Without the knowledge of dynamic link quality and future requests, an online algorithm is proposed to approximate the optimal solution. Finally, we conduct extensive simulations using real traces to evaluate the performance of our proposals, and the results show that 29% energy can be saved by using our algorithm under typical network settings.

关键词： Heuristic algorithms Energy consumption Algorithm design and analysis Network interfaces Bandwidth Minimization Data communication

来源：评论

学校读者我要写书评

暂无评论

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 availab.e 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

来源：评论

学校读者我要写书评

暂无评论

FDKeeper: A quick and open failure detector for cloud computing system

FDKeeper: A quick and open failure detector for cloud comput...

引用

2014 7th International C Conference on Computer Science and Software Engineering, C3S2E 2014

作者： Wang, Fengwei Jin, Hai Zou, Deqing Qiang, Weizhong Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781450327121

Failure detection is a basic service for building dependable cloud computing system. Unfortunately, the natural complexity of cloud computing system makes failure detectors much harder to build. In this work, we present the design, implementation, and evaluation of FDKeeper, a failure detector for cloud computing system with several features. First, FDKeeper is a failure detector with short detection time, high accuracy and low disruption. Second, FDKeeper is scalab.e, with communication cost and number of manager nodes scaling linearly with the number of physical nodes, which makes FDKeeper very suitable for large-scale cloud computing system. Third, FDKeeper provides a protocol for failure detection among many cloud computing systems. FDKeeper achieves these features by providing a layered failure detection mechanism, a cluster architecture and a cloud failure detection protocol. The evaluation results show that the detection time for app/kernel layer is less than 600 milliseconds, and 2 seconds for vmm/hardware layer, the accuracy is 100% for all layers, and the disruption is less than 0.27 times per year. As for scalab.lity, the theoretical analysis and experimental results show that there is a linear relationship between the number of nodes used to accomplish the failure detection and the number of nodes in the computing systems, and the growth factor is less than 0.001. Thus we believe FDKeeper is the first failure detector that is fast, reliable, scalab.e, and viable. As such, it could change the way that a dependable cloud computing system is built. © 2014 ACM.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Dependability Analysis for Fault-Tolerant Computer systems Using Dynamic Fault Graphs

引用

China Communications 2014年第9期11卷 16-30页

作者： ZHAO Feng JIN Hai ZOU Deqing QIN Pan Services Computing Technology and System Lab & Cluster and Grid Computing Lab School of Computer Scienceand Technology Huazhong University of Science and Technology Wuhan 430074 Hubei Province P. R. China

Dependability analysis is an important step in designing and analyzing safety computer systems and protection *** multi-processor and virtual machine increases the system faults' complexity,diversity and dynamic,in particular for software-induced failures,with an impact on the overall ***,it is very different for safety system to operate successfully at any active phase,since there is a huge difference in failure rate between hardware-induced and softwareinduced *** handle these difficulties and achieve accurate dependability evaluation,consistently reflecting the construct it measures,a new formalism derived from dynamic fault graphs(DFG) is developed in this *** exploits the concept of system event as fault state sequences to represent dynamic behaviors,which allows us to execute probabilistic measures at each timestamp when change *** approach automatically combines the reliability analysis with the system *** this paper,we describe how to use the proposed methodology drives to the overall system dependability analysis through the phases of modeling,structural discovery and probability analysis,which is also discussed using an example of a virtual computing system.

关键词： fault-tolerant system depend-ability analysis dynamic fault-graph structural link probability forecast

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Robust One-TimeMessage Authentication CodeScheme using Feature Extraction of Iris in Cloud computing

An Efficient and Robust One-TimeMessage Authentication CodeS...

引用

2014 International Conference on Cloud computing and Internet of Things (CCIOT)(2014年第一届云计算和物联网国际会议)

作者： Mohammed Abdulridha Hussain ZaidAmeen Abduljabbar Deqing Zou Hai Jin Ali A.Yassin ZaidAlaa Hussien Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scien 1Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scie University of Basrah BasrahIraq Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Scien

Cloud computing suffers from a number of problems in terms of security *** and integrity play an important role in the security field and numerous concerns have been raised to recognizeor protect any tampering with exchanges of text between two entities(sender and receiver)within the cloud *** schemes in this area can be vulnerable to well known methods of attack such as replay attack,forgery attack,dictionary,insider,and modification attacks.A robust scheme is therefore required to detect or prevent any modification or manipulation of a message during *** this paper,we propose a new message authentication code(MAC)based on feature extraction of the user's iris in order to assure the integrity of the user's *** are extracted from the user's iris to generate a message code for each user's login and to prohibit malicious attacks such as replay,forgery and insider *** proposed scheme enjoysseveral important security attributes such as a user's one time bio-key,robust message anonymity,data integrity for a user's message,phase key agreement,bio-key management,and one time message code for each user's ***,our security analysis and experimental results demonstrate and prove the invulnerability and efficiency of our proposed scheme.

关键词： Cloud computing Iris Features Extraction One Time Bio-key One Tim Message Authentication Code MAC.

来源：评论

学校读者我要写书评

暂无评论

Secure and Efficient Data Integrity Based on Iris Features in Cloud computing

Secure and Efficient Data Integrity Based on Iris Features i...

引用

International Conference on Security technology, SECTECH

作者： Salah H. Abbdal Hai Jin Deqing Zou Ali A. Yassin Services Computing Technologyt and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

Cloud computing aids users to outsource their data in the cloud remotely to prevent them from burdens of local storage and maintenance. Users no longer have possession and control of these data. This property brings many new security challenges like unauthorised entities and correctness of stored data. In this paper, we focus on the problem of ensuring the integrity of data stored in the cloud. We propose a method which combines biometric and cryptography techniques in a cost-effective manner for data owners to gain trust in the cloud. We present efficient and secure integrity based on the XOR operation and iris feature extraction as the strong factors. This work gives the cloud user more confidence in detecting any block that has been changed. Additionally, our proposed scheme employs user's iris features to secure and integrate data in a manner difficult for any internal or external entity to take or compromise it. Extensive security and performance analysis show that our scheme is highly efficient and provably secure.

关键词： Cloud computing Servers Security Iris Iris recognition Feature extraction

来源：评论

学校读者我要写书评

暂无评论

SDPMN: Privacy Preserving MapReduce Network Using SDN

SDPMN: Privacy Preserving MapReduce Network Using SDN

引用

International Conference on Cloud computing and Big Data (CCBD)

作者： He Li Hai Jin Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781479966226

MapReduce is a popular programming model and an associated implementation for parallel processing big data in the distributed environment. Since large scaled MapReduce data centers usually provide services to many users, it is an essential problem to preserve the privacy between different applications in the same network. In this paper, we propose SDPMN, a framework that using software defined network (SDN) to distinguish the network between each application, which is a manageable and scalab.e method. We design this framework based on the existing SDN structure and Hardtop networks. Since the rule space of each SDN device is limited, we also propose the rule placement optimization for this framework to maximize the hardware supported isolated application networks. We state this problem in a general MapReduce network and design a heuristic algorithm to find the solution. From the simulation based evaluation, with our algorithm, the given network can support more privacy preserving application networks with SDN switches.

关键词： Privacy Ports (Computers) Data privacy Network topology Virtualization IP networks Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

esDMT: Efficient and scalab.e deterministic multithreading through memory isolation

esDMT: Efficient and scalable deterministic multithreading t...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Jie Sun Xiaofei Liao Long Zheng Hai Jin Yu Zhang School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Cluster and Grid Computing Lab

Deterministic multithreading (DMT) system is well-known to eliminate the harmful program behaviors caused by nondeterminism, i.e., always proceeding the program execution into the same thread schedule for the same given input. To achieve this goal, two kinds of schedules are enforced by existing DMT systems. 1) A mem-based schedule ensures the determinism with the total order of the shared memory accesses, and 2) A sync-based schedule makes it by only enforcing the total order of the synchronization operations. Mem-schedule achieves full determinism but suffers from prohibitive overhead; while sync-schedule mitigates this overhead but cannot ensure the determinism for the race schedules, i.e., part determinism. Much recent research is devoted to the hybrid schedule combining the determinism of mem-schedule and efficiency of sync-schedule. However, they suffer from the practicability and scalab.lity problems due to the defects of their technical characteristics, such as trace collection in advance and huge schedule memoization. To address the above problem, this paper proposes esDMT, an efficient and scalab.e DMT system using a new technique of memory isolation. It can improve the efficiency by proceeding the execution of each thread in parallel within its private virtual memory, and defers the determinism guarantee by updating private memory into shared memory in a deterministic order according to deterministic lock algorithm, thus further reducing the overhead of inter-thread waiting. In contrast to the previous hybrid work avoiding the nondeterminism of race schedules offline based on the enormous historical records, our key insight is to eliminate the nondeterminism of race schedules online at runtime. Our experimental results on PARSEC benchmarks show that esDMT eliminates the nondeterminism successfully, almost gains the same performance as the sync-schedule (with

关键词： Instruction sets Schedules Synchronization Scalab.lity Clocks Computer crashes Runtime

来源：评论

学校读者我要写书评

暂无评论

A Secure Synchronized Reading system over Time-Critical Online Contests

A Secure Synchronized Reading System over Time-Critical Onli...

引用

IEEE International Conference on Communications

作者： Wei Wang Peng Xu Hui Li Laurence Tianruo Yang Key Lab of Cloud Computing Technology Peking University Shenzhen China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Embedded and Pervasive Computing Lab Huazhong University of Science and Technology Wuhan China

The time-critical online contest environment calls for an elegant and precise management system to start a contest online. The management system should simultaneously follow three rules of security that are confidentiality, anonymity and fairness. We present in this paper a novel system named Secure Synchronized Reading (SSR) system as well as its corresponding security model according to the three rules. SSR can evoke a synchronized start for all competitors in a contest at the intended time by employing a Randomness-reused Identity-Based Encryption (RIBE) scheme. It can avoid huge differences among delivery delays of heterogeneous competitors and any false start by an adverse competitor. Consequently when an online contest begins, the SSR system performs quasi real-time with ignorable communication delays in the security model. As a complement, the analysis on the provable security of SSR is given finally, as well as a further analysis on the achievement of synchronization.

关键词： Synchronization Encryption Delays Real-time systems Identity-based encryption

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：