Achieving fault tolerance is one of the significant challenges of exascale computing due to projected increases in soft/transient failures. While past work on software-based resilience techniques typically focused on ...
详细信息
ISBN:
(数字)9781665415613
ISBN:
(纸本)9781665415620
Achieving fault tolerance is one of the significant challenges of exascale computing due to projected increases in soft/transient failures. While past work on software-based resilience techniques typically focused on traditional bulk-synchronous parallel programming models, we believe that Asynchronous Many-Task (AMT) programming models are better suited to enabling resiliency since they provide explicit abstractions of data and tasks which contribute to increased asynchrony and latency tolerance. In this paper, we extend our past work on enabling application-level resilience in single node AMT programs by integrating the capability to perform asynchronous MPI communication, thereby enabling resiliency across multiple nodes. We also enable resilience against fail-stop errors where our runtime will manage all re-execution of tasks and communication without user intervention. Our results show that we are able to add communication operations to resilient programs with low overhead, by offloading communication to dedicated communication workers and also recover from fail-stop errors transparently, thereby enhancing productivity.
Image processing promotes many of the technological advancements these days. The main aspect while performing image processing operations is the time taken to deal with the application of different routines on these i...
详细信息
ISBN:
(数字)9781728149882
ISBN:
(纸本)9781728149899
Image processing promotes many of the technological advancements these days. The main aspect while performing image processing operations is the time taken to deal with the application of different routines on these images. Thus, time is an important criterion for the efficiency of the systems. With the given situation, the idea of giving images to the processors and then depending upon code all the cores will be either dealing with one image and performing operations on the image or distributing the images to each core to perform the operations. This uses the idea of parallel programming i.e. the use of all computer resources that are cores here. The paper focuses on implementing different image-enhancing techniques integrated into a system that will execute it on single as well as multiple cores. The image processing operations implemented sequentially as well as parallelly in this paper are Image Blurring, Edge Detection, Contrast Stretching, and Image Negation the average speed for all the operations obtained when executed on multiple cores are 9.94, 9.54, 11.12, and 11.21 respectively.
In order to increase effectiveness of computing, solved problem is divided into parallel executable parts. This technique also brings some problems, that has to be solved, such as starvation or deadlock. In case these...
详细信息
ISBN:
(数字)9781665422260
ISBN:
(纸本)9781665446785
In order to increase effectiveness of computing, solved problem is divided into parallel executable parts. This technique also brings some problems, that has to be solved, such as starvation or deadlock. In case these problems are incorrectly solved, software reliability can decrease or even whole computing can fail. In order to prevent such mistakes, these problems have to be understand correctly by programmers. As this topic can be difficult to understand, we have decided to implement tool to visualize common synchronization problems, such as producer-consumer, reader-writer or dinning philosophers. This software tool is written in C++ language and allows user to visualize these problems, change their parameters, such as number of producers, and manage whole simulation of selected problem. This application will be used as support tool in teaching process of parallel programming at Faculty of Management Science and Informatics of University of Zilina.
Two years ago Utah Valley University (UVU) began offering a Master of Computer Science Degree(MCS). This program needed to be distinct from other similar programs in our service area, and needed to align with the work...
详细信息
ISBN:
(数字)9781728142913
ISBN:
(纸本)9781728142920
Two years ago Utah Valley University (UVU) began offering a Master of Computer Science Degree(MCS). This program needed to be distinct from other similar programs in our service area, and needed to align with the workforce development goals of UVU. The CS 6150 Advanced Algorithms course, one of the fundamental core courses students take in the MCS program, exhibits this distinctiveness. This paper describes five problems taught to students when they take CS 6150. They are: Balancing a Two-wheeled Robot, Stable Marriage Problem, Lemoine's Conjecture, Largest Triangle and Blockchains. These problems are an eclectic set of problems that are not commonly taught in data structures and algorithms textbooks and courses, but provide enough theory to be rigorous while giving experience with real-world, practical problems around which to develop new professional skills. Students are required to produce performant, working code while learning about the algorithms and related theories, concepts and mathematics involved. This blend supports the unique missions of UVU and the MCS Program. Student feedback is that the course is difficult, for reasons such as new advanced material and higher expectations of graduate students, however they also enjoy the challenging projects and they use the knowledge and skills they develop in school and work.
Peachy parallel Assignments are high-quality assignments for teaching parallel and distributed computing. They are selected competitively for presentation at the Edu* workshops. All of the assignments have been succes...
详细信息
ISBN:
(数字)9781665422963
ISBN:
(纸本)9781665404495
Peachy parallel Assignments are high-quality assignments for teaching parallel and distributed computing. They are selected competitively for presentation at the Edu* workshops. All of the assignments have been successfully used in class and they are selected based on the their ease of adoption by other instructors and for being cool and inspirational to students. This paper presents a paper-and-pencil assignment asking students to analyze the performance of different system configurations and an assignment in which students parallelize a simulation of the evolution of simple living organisms.
A new common OpenMP based parallel programming method MPMC (multi-node paralleling model base on multiprocessor devices) is proposed and implemented for data separation based to accelerate Super-Resolution (SR) task. ...
详细信息
Explicit parallel programming for shared and distributed memory architectures is an efficient way to deal with data intensive computations. However approaches such as explicit threads or MPI remain difficult solutions...
详细信息
The medical diagnosis of most pathologists requires the analysis of the image studies. Therefore, it is important to get the best quality of the images without noise and highlight the details of tissues. The principal...
详细信息
A major driving force behind the increasing popularity of data science is the increasing need for data-driven analytics fuelled by massive amounts of complex data. Increasingly, parallel processing has become a cost-e...
详细信息
We present and evaluate an implementation technique for histogram-like computations on GPUs that ensures both work-efficient asymptotic cost, support for arbitrary associative and commutative operators, and efficient ...
详细信息
ISBN:
(数字)9781728199986
ISBN:
(纸本)9781728199993
We present and evaluate an implementation technique for histogram-like computations on GPUs that ensures both work-efficient asymptotic cost, support for arbitrary associative and commutative operators, and efficient use of hardware-supported atomic operations when applicable. Based on a systematic empirical examination of the design space, we develop a technique that balances conflict rates and memory footprint. We demonstrate our technique both as a library implementation in CUDA, as well as by extending the parallel array language Futhark with a new construct for expressing generalized histograms, and by supporting this construct with several compiler optimizations. We show that our histogram implementation taken in isolation outperforms similar primitives from CUB, and that it is competitive or outperforms the hand-written code of several application benchmarks, even when the latter is specialized for a class of datasets.
暂无评论