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

17th IEEE international conference on Networks (ICON)

作者： Hu, Menglan Veeravalli, Bharadwaj Natl Univ Singapore Dept Elect & Comp Engn Singapore 117548 Singapore

ISBN: (纸本)9781457718250

Divisible load applications occur in many fields of science and engineering. Such applications can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. In this paper we investigate the scheduling problem for processing a set of tasks comprising both divisible and indivisible tasks on cluster systems. Indivisible loads are characterized by the property that they need to be processed on their entirety on a single processor while divisible loads can be distributed across several processing nodes by fully exploiting the underlying data parallelism. We propose a novel scheduling algorithm referred to as Hybrid Load Scheduling (HLS) algorithm for handling a set of tasks comprising both divisible and indivisible tasks on clusters. HLS fully exploits the parallelism in divisible loads to achieve high resource utilization. It also utilizes a pipelining technique to hide communication time and thus further optimize the overall performance. Simulations are presented to evaluate and compare the performance of the proposed strategy.

关键词： Divisible loads parallel processing communication delay cluster computing

来源：评论

学校读者我要写书评

暂无评论

A Data-oriented Method for Scheduling Dependent Tasks on High-density Multi-GPU systems 17

A Data-oriented Method for Scheduling Dependent Tasks on Hig...

引用

2015 IEEE 17th international conference on High Performance computing and Communications (HPCC)

作者： Zhang, Peng Gao, Yuxiang Qiu, Meikang SUNY Stony Brook Dept Biomed Engn Stony Brook NY 11794 USA Cray Inc Cluster Solut Dept San Jose CA USA Pace Univ Dept Comp Sci New York NY 10038 USA

ISBN: (纸本)9781479989379

the rapidly-changing computer architectures, though improving the performance of computers, have been challenging the programming environments for efficiently harnessing the potential of novel architectures. In this area, though the high-density multi-GPU architecture enabled unparalleled performance advantage of dense GPUs in a single server, it has increased the difficulty for scheduling diversified and dependent tasks. We therefore propose a data-oriented method for scheduling dependent tasks for this architecture while providing its implementation. In our method, we model a parallel program as a collection of data-dependent tasks for which data dependencies are managed by an expressive matrix. Accordingly, we develop a hierarchical scheduler infrastructure for our model. In this, a top scheduler is built for querying the data-dependency matrix;three downstream schedulers for queuing computation tasks that are exclusively assigned to processor, accelerator or either;and a multitude of bottom schedulers each for providing a processing element with assigned tasks. We experiment our scheduler for examples of Strassen matrix multiplication and Cholesky matrix inversion algorithms on a computer that has 8 Tesla K40 GPUs. the results show that our method is capable of offering the efficient task parallelism while fulfilling the complex task dependencies. When advanced task-oriented schedulers have been widely designed for distributed systems, a lightweight data-driven scheduler could be an alternative and handy approach that can handle the dependent yet diversified tasks of data-intensive applications for the novel high-density multi-accelerator system.

关键词： data scheduling task scheduling parallel computing heterogeneous multi-GPU systems

来源：评论

学校读者我要写书评

暂无评论

A Perspective on the CoreGRID Grid Component Model

A Perspective on the <i>CoreGRID</i> Grid Component Model

引用

17th international Euro-Par conference on parallel Processing

作者： Baude, Francoise Univ Nice Sophia Antipolis INRIA CNRS I3S 2004 Route Lucioles Sophia Antipolis France

ISBN: (纸本)9783642297373;9783642297366

the Grid Component Model is a software component model designed partly in the context of the CoreGRID European Network of Excellence, as an extension of the Fractal model, to target the programming of large-scale distributed infrastructures such as computing grids [3]. these distributed memory infrastructures, characterized by high latency, heterogeneity and sharing of resources, suggest the efficient use of several CPUs at once to obtain high performances.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Supporting dynamic space-sharing on clusters of non-dedicated workstations

Supporting dynamic space-sharing on clusters of non-dedicate...

引用

Proceedings of the 1997 17th international conference on distributed computing systems

作者： Chowdhury, Abdur Nicklas, Lisa D. Setia, Sanjeev K. White, Elizabeth L. George Mason Univ Fairfax United States

Clusters of workstations are increasingly being viewed as a cost-effective alternative to parallel supercomputers. However, resource management and scheduling on workstations clusters is complicated by the fact that the number of idle workstations available for executing parallel applications is constantly fluctuating. In this paper, we present a case for scheduling parallel applications on non-dedicated workstation clusters using dynamic space-sharing, a policy under which the number of processors allocated to an application can be changed during its execution. We describe an approach that uses application-level checkpointing and data repartitioning for supporting dynamic space-sharing and for handling the dynamic reconfiguration triggered when failure or owner activity is detected on a workstation being used by a parallel application. the performance advantages of dynamic space-sharing are quantified through a simulation study, and experimental results are presented for the overhead of dynamic reconfiguration of a grid-oriented data parallel application using our approach.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Introduction

引用

17th international conference on parallel Processing, Euro-Par 2011

作者： Kowalski, Dariusz Sens, Pierre Anta, Antonio Fernandez Pierre, Guillaume University of Liverpool United Kingdom University Paris 6 France IMDEA Networks Spain VU University Amsterdam Netherlands

ISBN: (纸本)9783642233999

parallel computing is increasingly exposed to the development and challenges of distributed systems, such as asynchrony, long latencies, failures, network partitions, mobility, heterogeneity, malicious and selfish behavior, disconnected operations, the lack of load balancing, and many others. Furthermore, distributed systems are becoming larger, more diverse and more dynamic, for example, in terms of highly dynamic number of participants and topology changes. the Euro-Par topic dedicated to distributed systems and algorithms provides a forum for research and practice, of interest to both academia and industry, to present and discuss novel approaches in distributed computing and to explore relations between parallel processing and distributed systems. © 2011 Springer-Verlag.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

引用

JOURNAL OF parallel AND distributed computing 2007年第7期67卷 797-815页

作者： Mittal, Neeraj Mohan, Prajwal K. Univ Texas Dept Comp Sci Richardson TX 75083 USA Intel Corp Digital Home Grp Hillsboro OR 97124 USA

In the group mutual exclusion problem, each critical section has a type or a group associated with it. Processes requesting critical sections belonging to the same group (that is, of the same type) may execute their critical sections concurrently. However, processes requesting critical sections belonging to different groups (that is, of different types) must execute their critical sections in a mutually exclusive manner. Most algorithms for solving the group mutual exclusion problem that have been proposed so far in the literature treat all groups equally. this is quite acceptable if a process, at the time of making a request for critical section, selects a group for the critical section uniformly. However, if some groups are more likely to be selected than others, then better performance can be achieved by treating different groups in a different manner. In this paper, we propose an efficient algorithm for solving the group mutual exclusion problem when group selection probabilities are nonuniformly distributed. Our algorithm has a message complexity of 2n - 1 per request for critical section, where n is the number of processes in the system. It has low synchronization delay of one message hop and low waiting time of two message hops. the maximum concurrency of our algorithm is n, which implies that if all processes have requested critical sections of the same type then all of them may execute their critical sections concurrently. Finally, the amortized message-size complexity of our algorithm is O(1). Our experimental results indicate that our algorithm outperforms the existing algorithms, whose complexity measures are comparable to that of ours, by as much as 50% in some cases. (C) 2007 Elsevier Inc. All rights reserved.

关键词： message-passing system resource management group mutual exclusion token-based algorithm non-uniform group selection priority-based scheme

来源：评论

学校读者我要写书评

暂无评论

Efficiently Trigger Data Races through Speculative Execution 17

Efficiently Trigger Data Races through Speculative Execution

引用

2015 IEEE 17th international conference on High Performance computing and Communications (HPCC)

作者： Wu, Zhendong Lu, Kai Wang, Xiaoping Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China

ISBN: (纸本)9781479989379

Harmful data races hidden in concurrent programs are hard to be detected due to non-determinism. Many race detectors report a large number of benign data races. To detect the harmful data races automatically, previous tools dynamically execute program and actively insert delay to create real race condition, checking whether failure occurs due to the race. If so, a harmful race is detected. However, performance may be affected due to the inserted delay. We use speculative execution to alleviate this problem. Unlike previous tools that suspend one thread's memory access to wait for another thread's memory access, we continue to execute this thread's memory accesses and do not suspend this thread until it is going to execute a memory access that may change the effort of race. therefore, real race condition will be created with less delay or even no delay. To our knowledge, this is the first technique that can trigger data races by speculative execution. the speculative execution does not affect the detection of harmful races. We have implemented a prototype tool and experimented on some real world programs. Results show that our tool can detect harmful races effectively. By speculative execution, the performance is improved significantly.

关键词： harmful data race speculative execution dynamic analysis concurrent program

来源：评论

学校读者我要写书评

暂无评论

NPB-MPJ: NAS parallel Benchmarks Implementation for Message-Passing in Java

NPB-MPJ: NAS Parallel Benchmarks Implementation for Message-...

引用

17th Euromicro international conference on parallel, distributed and Network-Based Processing

作者： Mallon, Damian A. Taboada, Guillermo L. Tourino, Juan Doallo, Ramon Univ A Coruna Dept Elect & Syst Comp Architecture Grp La Coruna 15071 Spain

ISBN: (纸本)9780769535449

Java is a valuable and emerging alternative for the development of parallel applications, thanks to the availability of several Java message-passing libraries and its full multithreading support. the combination of both shared and distributed memory programming is an interesting option for parallel programming multi-core systems. However, the concerns about Java performance are hindering its adoption in this field, although it is difficult to evaluate accurately its performance due to the lack of standard benchmarks in Java. this paper presents NPB-MPJ, the first extensive implementation of the NAS parallel Benchmarks (NPB), the standard parallel benchmark suite, for Message-Passing in Java (MPJ) libraries. Together with the design and implementation details of NPB-MPJ, this paper gathers several optimization techniques that can serve as a guide for the development of more efficient Java applications for High Performance computing (HPC). NPB-MPJ has been used in the performance evaluation of Java against C/Fortran parallel libraries on two representative multi-core clusters. thus, NPB-MPJ provides an up-to-date snapshot of MPJ performance, whose comparative analysis of current Java and native parallel solutions confirms that MPJ is an alternative for parallel programming multi-core systems.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Decentralized and Secure Cooperative Edge Node Grouping to Process IoT Applications in Heterogeneous Smart Cyber-Physical systems 17

Decentralized and Secure Cooperative Edge Node Grouping to P...

引用

17th international Bhurban conference on Applied Sciences and Technology (IBCAST)

作者： Mudassar, Muhammad Zhai, Yanlong Liao, Lejian Zahid, Muhammad Noaman Afzal, Fatima Beijing Inst Technol Sch Comp Sci Beijing 100081 Peoples R China Beijing Inst Technol Sch Opt & Photon Beijing 100081 Peoples R China Virtual Univ Pakistan Dept Comp Sci & Informat Technol Lahore Pakistan

ISBN: (纸本)9781728146768

Smart Cyber-Physical systems (SCPS) has enhanced use of smart devices with numerous applications including smart cities, smart traffic management, smart cars, smart health care and smart grids. Core logic behind these applications usually require huge processing or massive data handling which are normally performed at cloud but the application will suffer from latency. Edge computing offers solution for latency aware computations at edge of the network but with limited resources available at edge nodes. this problem can be resolved by leveraging edge resources in a group and executing resource intensive task. Most previous studies deploy centralized methods for clustering but comes with overhead of cluster formation and management. In this article, key idea is to group heterogeneous edge nodes on task arrival in a decentralize way, and handle task allocation and execution in parallel on group devices to achieve its deadline. Our methodology will help to reduce traffic amount travelling towards cloud in case of resource intensive big tasks of SCPS applications. We have proposed an algorithm for decentralized group formation and presented task division and allocation methodology for parallel execution. Our results show that our technique is working while providing desired goals of reducing overall latency, and limiting network traffic as well as achieving higher ratio for number of tasks meeting their deadline.

关键词： Edge computing distributed computing Internet of things Smart Cyber-Physical systems Collaborative computing

来源：评论

学校读者我要写书评

暂无评论

A distributed network intrusion detection system architecture based on computer stations using GPGPU

A distributed network intrusion detection system architectur...

引用

17th IEEE international conference on Intelligent Engineering systems, INES 2013

作者： Vokorokos, L. Ennert, M. Cajkovsky, M. Turinska, A. Department of Computers and Informatics Faculty of Electrical Engineering and Informatics Technical University of Košice Letná 9 042 00 Košice Slovakia

ISBN: (纸本)9781479908288

this article deals with the proposal of distributed parallel network system architecture for intrusion detection. the aim is to design model of architecture that will be used for searching, detecting and analyzing intrusions. this proposal of detection system in network will use enormous performance of the GPGPU high-parallel data computing technology which can substitute the most complicated part of the intrusion detection process in NIDS. the model is highly scalable and allows the usage of several most recent trends in the IDS field with GPGPU support. Due to the fast attacks reaction system analyzes all the data in different formats in whole set of attacks and system alerts. © 2013 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：