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

Annual Hawaii International Conference on System Sciences (HICSS)

作者： L. Buttner U. Haack W. Schroder-Preikschat T. Stickdorn GMD FIRST Berlin Germany

programming a distributed memory parallel machine generally entails a high degree of complexity. Load balancing in particular is a demanding task. If high efficiency is to be maintained, this task cannot be solved by a distributed operating system alone, but must involve the application programmer. Instead of the underlying message passing architecture being shielded from the programmer, it should be explicitly modeled. Three key concepts of a parallel operating system-dual, mobile and reactive objects-are presented. They provide simple but efficient mechanisms that can be easily utilized for such complex tasks as load balancing, i.e., initial placement and migration of application entities. To illustrate the applicability of these concepts, a simple VR application-geoview-was implemented on a message passing architecture, and serves as an example throughout the paper.

关键词： Operating systems Load management Virtual reality Computer architecture Job shop scheduling Processor scheduling Pipelines Geometry parallel programming programming profession

来源：评论

学校读者我要写书评

暂无评论

Data flow analysis across tuplespace process boundaries

Data flow analysis across tuplespace process boundaries

引用

International Conference on Computer Languages

作者： J.B. Fenwick L.L. Pollock Department of Computer and Information Sciences University of Delaware Newark DE USA

A current limitation of compilers for shared memory parallel languages is their restricted use of traditional code-improving transformations, such as constant propagation and dead code elimination. A major problem lies in the lack of data flow analysis techniques for programs with user-specified parallelism. The authors demonstrate how data flow analysis remains quite viable in a compiler for shared memory parallel programs in a structured distributed shared memory environment, in which a shared space of tuples is accessed by properly synchronized methods. They demonstrate standard intraprocess data flow analysis performed in the midst of tuplespace communication statements, and present improvements to the precision of the analysis in the presence of these statements. They present a data flow system to compute reaching definitions across process boundaries, and a technique to improve the precision of this interprocess analysis. Lastly, some transformations enabled by this analysis are presented.

关键词： Data analysis Program processors Performance analysis parallel programming parallel processing Optimizing compilers parallel languages Message passing programming profession Testing

来源：评论

学校读者我要写书评

暂无评论

Executing dynamic data-graph computations deterministically using chromatic scheduling 14

Executing dynamic data-graph computations deterministically ...

引用

Proceedings of the 26th ACM symposium on parallelism in algorithms and architectures

作者： Tim Kaler William Hasenplaugh Tao B. Schardl Charles E. Leiserson MIT CSAIL Cambridge MA USA

ISBN: (纸本)9781450328210

A data-graph computation — popularized by such programming systems as Galois, Pregel, GraphLab, PowerGraph, and GraphChi — is an algorithm that performs local updates on the vertices of a graph. During each round of a data-graph computation, an update function atomically modifies the data associated with a vertex as a function of the vertex's prior data and that of adjacent vertices. A dynamic data-graph computation updates only an active subset of the vertices during a round, and those updates determine the set of active vertices for the next *** paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations. PRISM uses a vertex-coloring of the graph to coordinate updates performed in a round, precluding the need for mutual-exclusion locks or other nondeterministic data synchronization. A multibag data structure is used by PRISM to maintain a dynamic set of active vertices as an unordered set partitioned by color. We analyze PRISM using work-span analysis. Let G=(V,E) be a degree-Δ graph colored with Χ colors, and suppose that Q⊆V is the set of active vertices in a round. Define size(Q)=[Q] + Σv∈Qdeg(v), which is proportional to the space required to store the vertices of Q using a sparse-graph layout. We show that a P-processor execution of PRISM performs updates in Q using O(Χ(lg (Q/Χ)+lgΔ)+ lgP) span and Θ(size(Q)+Χ+P) work. These theoretical guarantees are matched by good empirical performance. We modified GraphLab to incorporate PRISM and studied seven application benchmarks on a 12-core multicore machine. PRISM executes the benchmarks 1.2–2.1 times faster than GraphLab's nondeterministic lock-based scheduler while providing deterministic *** paper also presents PRISM-R, a variation of PRISM that executes dynamic data-graph computations deterministically even when updates modify global variables with associative operations. PRISM-R satisfies the same theoretical bounds as PRISM, but its implementation is

关键词： determinism reducers multithreading parallel programming work stealing data-graph computations chromatic scheduling multicore

来源：评论

学校读者我要写书评

暂无评论

Analysis and Optimisation of PBS/TORQUE Fault Tolerance Tools

Analysis and Optimisation of PBS/TORQUE Fault Tolerance Tool...

引用

International Asian School-Seminar Optimization Problems of Complex Systems

作者： Alexandr V. Efimov Kirill V. Pavsky Computer systems department of SibSUTIS Computer systems laboratory of ISP SB RAS Computer systems laboratory of ISP SB RAS Computer systems department of SibSUTIS

This work is devoted to the problem of detecting and processing faults of computing nodes during execution of parallel programs on distributed computing systems. The fault tolerance tools of PBS/TORQUE are considered.... 详细信息

ISBN: (纸本)9781728129877

关键词： Distributed computing systems Fault tolerance Resource management PBS/TORQUE distributed computing system Fault tolerance management of resources FUNCTIONAL MODELS parallel programming faults

来源：评论

学校读者我要写书评

暂无评论

Divide and conquer skeleton on GPU

Divide and conquer skeleton on GPU

引用

International Congress on Technology, Communication and Knowledge (ICTCK)

作者： Fahimeh Baghayeri Hossein Deldari Davoud Bahrepour Department of Computer Engineering Mashhad Branch Islamic Azad University Mashhad Iran

parallelism is a suitable approach for speeding up the massive computations of applications, but parallel programming is difficult yet. Algorithmic skeleton is a parallel programming model that provides a high level of abstraction for programmers. This approach uses the pre-defined components to facilitate easier parallel programming. Divide and conquer (DC) is an appropriate parallel pattern for implementation as a skeleton. The solution of the original problem is obtained by dividing it into smaller sub-problems and solving them in parallel. Today, graphics processor unit (GPU) is an attractive computational processor for doing tasks in parallel, because it has a large number of process units. In this paper, divide and conquer skeleton on GPU has been proposed and named OC_***_GPU is a divide and conquer skeleton that is implemented on GPU that using a consistent programming interface in C++ for easier parallel programming. Performance of this skeleton has been evaluated by mergesort and sobeledge detection. The results show that obtained speedup at this skeleton is more than 2 on GPU.

关键词： Skeleton Graphics processing units parallel processing parallel programming Libraries Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Teaching and learning parallel processing through performance analysis using Prober

Teaching and learning parallel processing through performanc...

引用

Frontiers in Education (FIE) Conference

作者： L.E.S. Ramos L.F.W. Goes C.A.P.S. Martins Informatics Institute Pontifical Catholic University of Minas Gerais Belo Horizonte Minas Gerais Brazil Post Graduation Program in Electrical Engineering Informatics Institute Pontifical Catholic University of Minas Gerais Belo Horizonte Minas Gerais Brazil

In this paper we analyze the teaching and learning of parallel processing through performance analysis using a software tool called Prober. This tool is a functional and performance analyzer of parallel programs that we proposed and developed during an undergraduate research project. Our teaching and learning approach consists of a practical class where students receive explanations about some concepts of parallel processing and the use of the tool. They do some oriented and simple performance tests on parallel programs and analyze their results using Prober as a single aid tool. Finally, students answer a self-assessment questionnaire about their formation, their knowledge of parallel processing concepts and also about the usability of Prober. Our main goal is to show that students can learn concepts of parallel processing in a clearer, faster and more efficient way using our approach.

关键词： Education parallel processing Performance analysis Educational institutions Message passing parallel programming Informatics Workstations Hardware Libraries

来源：评论

学校读者我要写书评

暂无评论

A minimalistic approach for fast computation of geodesic distances on triangular meshes

arXiv

引用

arXiv 2018年

作者： Calla, Luciano A. Romero Perez, Lizeth J. Fuentes Montenegro, Anselmo A. University of Zurich Switzerland Institute of Computing Federal Fluminense University Niteroi Brazil IPRODAM3D Research Group La Salle University Arequipa Peru

The computation of geodesic distances is an important research topic in Geometry Processing and 3D Shape Analysis as it is a basic component of many methods used in these areas. In this work, we present a minimalistic parallel algorithm based on front propagation to compute approximate geodesic distances on meshes. Our method is practical and simple to implement, and does not require any heavy pre-processing. The convergence of our algorithm depends on the number of discrete level sets around the source points from which distance information propagates. To appropriately implement our method on GPUS taking into account memory coalescence problems, we take advantage of a graph representation based on a breadth-first search traversal that works harmoniously with our parallel front propagation approach. We report experiments that show how our method scales with the size of the problem. We compare the mean error and processing time obtained by our method with such measures computed using other methods. Our method produces results in competitive times with almost the same accuracy, especially for large meshes. We also demonstrate its use for solving two classical geometry processing problems: The regular sampling problem and the Voronoi tessellation on meshes. Copyright © 2018, The Authors. All rights reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Matrix bidiagonalization on the Trident processor

Matrix bidiagonalization on the Trident processor

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： M.I. Soliman S.G. Sedukhin Graduate School of Computer Science and Engineering University of Aizu Fukushima Japan

This paper discusses the implementation and evaluation of the reduction of a dense matrix to bidiagonal form on the Trident processor. The standard Golub and Kahan Householder bidiagonalization algorithm, which is rich in matrix-vector operations, and the LAPACK subroutine /spl ***/GEBRD, which is rich in a mixture of vector, matrix-vector, and matrix operations, are simulated on the Trident processor. We show how to use the Trident parallel execution units, ring, and communication registers to effectively perform vector, matrix-vector, and matrix operations needed for bidiagonalizing a matrix. The number of clock cycles per FLOP is used as a metric to evaluate the performance of the Trident processor. Our results show that increasing the number of the Trident lanes proportionally decreases the number of cycles needed per FLOP. On a 32 K/spl times/32 K matrix and 128 Trident lanes, the speedup of using matrix-vector operations on the standard Golub and Kahan algorithm is around 1.5 times over using vector operations. However, using matrix operations on the GEBRD subroutine gives speedup around 3 times over vector operations, and 2 times over using matrix-vector operations on the standard Golub and Kahan algorithm.

关键词： Registers Architecture Matrix decomposition parallel processing Algorithms Hardware parallel programming Computer science Cities and towns Clocks

来源：评论

学校读者我要写书评

暂无评论

A performance comparison between stop-the-world and multithreaded concurrent generational garbage collection for Java

A performance comparison between stop-the-world and multithr...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： C.-T.D. Lo W. Srisa-an J.M. Chang Department of Computer Science Illinois Institute of Technology Chicago IL USA

ISBN: (纸本)0780373715

The recent popularity of the Java programming language has brought automatic dynamic memory management (a.k.a., the garbage collection) into the mainstream. Traditional garbage collectors suffer from long garbage collection pauses (stop-the-world mark-sweep algorithm) or inability of collecting cyclic garbage (reference counting approach). Generational garbage collection, however, is based only on the weak generational hypothesis that most objects die young. In this paper, the performance evaluation of a new multithreaded concurrent generational garbage collector (MCGC) based on mark-sweep with the assistance of reference counting is reported. The MCGC can take advantage of multiple CPUs in an SMP system and the merits of lightweight processes. Furthermore, the long garbage collection pause can be reduced and the garbage collection efficiency can be enhanced. Measurement results indicate that the MCGC improves the garbage collection pause time up to 96.75% over the traditional stop-the-world mark-sweep garbage collector. Moreover, the MCGC receives minimal time and space penalties as shown in the report of the total execution time, the memory footprint and the sticky reference count rate.

关键词： Java Dynamic programming Memory management Object oriented programming parallel programming Virtual machining Computer science Computer languages Technology management Time measurement

来源：评论

学校读者我要写书评

暂无评论

ARV-based Array Grouping and Data Distribution in OpenMP/JIAJIA

ARV-based Array Grouping and Data Distribution in OpenMP/JIA...

引用

IEEE International Conference on parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Zeng Lifang Yang Xuejun H. Huangchun National Laboratory for Parallel and Distributed Processing China

In order to improve the performance of applications on OpenMP/JIAJIA, we present a new abstraction, Array Relation Vector (ARV), to describe the relation between the data elements of two consistent shared arrays accessed in one computation phase. Based on ARV, we use array grouping to eliminate the pseudo data distributing of small shared data and improve the page locality. Experimental results show that ARV-based array grouping can greatly improve the performance of applications with non-continuous data access and strict access affinity on OpenMP/JIAJIA cluster. For applications with small shared arrays, array grouping can improve the performance obviously when the processor number is small.

关键词： Phased arrays Concurrent computing Distributed computing Application software Laboratories Distributed processing parallel programming parallel architectures programming profession Emulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：