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

作者： Kolman, M. Kosec, G. Parallel and Distributed Systems Laboratory Jožef Stefan Institute Ljubljana Slovenia

This paper deals with the numerical determination of the stress and displacement distribution in a solid body subjected to the applied external force. The tackled solid mechanics problem is governed by the Navier-Cauchy equation that describes the deformation within the solid body through the displacement vector field. To obtain the solution, a coupled system of non-linear Partial Differential Equations (PDE) of second order has to be solved. In this paper, the problem is approached by a strong form Moving Least Squares (MLS) based numerical discretization also referred to as a Meshless Local Strong Form Method (MLSM). A generic C++ implementation of a MLSM is used for demonstration of parallel solution of a Point Contact problem on Intel® Xeon Phi™ multicore accelerator. All tests are executed on either the host machine with two Intel® Xeon® E5-2620 v3 6 core processors or offloaded to its 60 core Intel® Xeon Phi™ SE10/7120 series. The shared memory parallelization is implemented through an OpenMP API. © Civil-Comp Press, 2017.

关键词： Point contacts

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of restricted classes of global predicates 9th

Efficient detection of restricted classes of global predicat...

引用

9th International Workshop on distributed Algoriths, WDAG 1995

作者： Chase, Craig M. Garg, Vijay K. Parallel and Distributed Systems Laboratory Electrical and Computer Engineering Department The University of Texas at Austin United States

ISBN: (纸本)3540602747

We show that the problem of predicate detection in distributed systems is NP-complete. We introduce a class of predicates, linear predicates, such that for any linear predicate B there exists an efficient detection of the least cut satisfying B. The dual of linearity is post-linearity. These properties generalize several known properties of distributed systems, such as the set of consistent cuts forms a lattice, and the WCP and GCP predicate detection results given in earlier work. We define a more general class of predicates, semi-linear predicates, for which efficient algorithms are known to detect whether a predicate has occurred during an execution of a distributed program. However, these methods may not identify the least such cut. Any stable predicate is an example of a semi-linear predicate. In addition, we show that certain unstable predicates can also be semi-linear, such as mutual exclusion violation. Finally, we show application of max-flow to the predicate detection problem. This result solves a previously open problem in predicate detection, establishing the existence of an efficient algorithm to detect predicates of the form X1 + x2… +xn i are variables on different processes, k is some constant, and n is larger than 2. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Optimization of meshless based simulation for coupled transport phenomena 1

Optimization of meshless based simulation for coupled transp...

引用

1st International Conference on Engineering and Applied Sciences Optimization, OPT-i 2014

作者： Kosec, G. Parallel and Distributed Systems Laboratory Jožef Stefan Institute Jamova cesta 39 El Salvador

ISBN: (纸本)9789609999465

This work deals with an optimization of a coupled transport problem, more precisely a thermo-fluid transport in a closed cavity. The considered natural convection problem is governed by energy and momentum transport coupled with Boussinesq approximation. The governing equations are solved with a local explicit meshless method while the optimization is performed with Differential Evolutionary Multi objective Optimization (DEMO). The differentially heated cavity is partially covered with non-permeable obstacles that obstruct the natural convection flow. We seek the optimal position and shape of the obstacles to minimize the heat flux through the domain with the minimal cumulative size of the obstacles, i.e. we maximize insulation with minimal material needed. The results are presented in terms of velocity fields and temperature fields, and optimization Pareto fronts.

关键词： Natural convection

来源：评论

学校读者我要写书评

暂无评论

Rethinking benchmarking for NVM-based file systems 16

Rethinking benchmarking for NVM-based file systems

引用

7th ACM SIGOPS Asia-Pacific Workshop on systems, APSys 2016

作者： Dong, Mingkai Yu, Qianqian Zhou, Xiaozhou Hong, Yang Chen, Haibo Zang, Binyu Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450342650

Fast, byte-addressable NVM promises near-cache latency and near memory bus throughput for file systems, which is evident by recent development of a number of NVM file systems (NVMFS). However, a key approach to measuring their performance, file system benchmarks, remains unchanged as those for disk-based file systems (DFS). In this paper, we analyze the pitfalls of using DFS benchmarks to evaluate NVMFS and propose several changes to existing DFS benchmarks to better characterize the performance of NVMFS. © 2016 ACM.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

DrTM+B: Replication-Driven Live Reconfiguration for Fast and General distributed Transaction Processing

引用

IEEE Transactions on parallel and distributed systems 2022年第10期33卷 2628-2643页

作者： Shen, Sijie Wei, Xingda Chen, Rong Chen, Haibo Zang, Binyu Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Shanghai200240 China Shanghai200240 China Shanghai Artificial Intelligence Laboratory Shanghai200232 China

Recent in-memory database systems leverage advanced hardware features like RDMA to provide transaction processing at millions of transactions per second. distributed transaction processing systems can scale to even higher rates, especially for partitionable workloads. Unfortunately, it is challenging to sustain such high rates during live reconfiguration of partitions. In this article, we observe that state-of-the-art approaches would cause notable performance disruption under fast transaction processing. To this end, this article presents DrTM+B, a live reconfiguration approach that seamlessly repartitions data with little performance disruption to running transactions. DrTM+B uses a pre-copy-based mechanism to avoid excessive data transfer by leveraging common properties in recent transactional systems. DrTM+B's reconfiguration plans reduce data movement by preferring existing data replicas, while copying data from multiple replicas asynchronously and in parallel. It further reuses the log forwarding mechanism in primary-backup replication to seamlessly track and forward dirty database tuples and avoids iterative copying costs. To commit a reconfiguration plan in a transactional-safe way, DrTM+B designs a cooperative commit protocol for synchronization of data and state among replicas. To boost the performance during data migration, DrTM+B combines the pre-copy and post-copy schemes to propose a hybrid copy scheme. The live reconfiguration approach can also coexist with fault-tolerance mechanisms of primary-backup replication to provide high availability. Evaluation on a working system based on DrTM+R with 3-way replication using typical OLTP workloads like TPC-C and SmallBank shows that DrTM+B incurs only very small performance degradation during live reconfiguration and provides high availability. Both the reconfiguration time and the downtime are also minimal. © 1990-2012 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

NUMA-aware graph-structured analytics 2015

NUMA-aware graph-structured analytics

引用

20th ACM SIGPLAN Symposium on Principles and Practice of parallel Programming, PPoPP 2015

作者： Zhang, Kaiyuan Chen, Rong Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China

ISBN: (纸本)9781450332057

Graph-structured analytics has been widely adopted in a number of big data applications such as social computation, web-search and recommendation systems. Though much prior research focuses on scaling graph-analytics on distributed environments, the strong desire on performance per core, dollar and joule has generated considerable interests of processing large-scale graphs on a single server-class machine, which may have several terabytes of RAM and 80 or more cores. However, prior graph-analytics systems are largely neutral to NUMA characteristics and thus have suboptimal performance. This paper presents a detailed study of NUMA characteristics and their impact on the efficiency of graph-analytics. Our study uncovers two insights: 1) either random or interleaved allocation of graph data will significantly hamper data locality and parallelism;2) sequential inter-node (i.e., remote) memory accesses have much higher bandwidth than both intra- and inter-node random ones. Based on them, this paper describes Polymer, a NUMA-aware graph-analytics system on multicore with two key design decisions. First, Polymer differentially allocates and places topology data, application-defined data and mutable runtime states of a graph system according to their access patterns to minimize remote accesses. Second, for some remaining random accesses, Polymer carefully converts random remote accesses into sequential remote accesses, by using lightweight replication of vertices across NUMA nodes. To improve load balance and vertex convergence, Polymer is further built with a hierarchical barrier to boost parallelism and locality, an edge-oriented balanced partitioning for skewed graphs, and adaptive data structures according to the proportion of active vertices. A detailed evaluation on an 80-core machine shows that Polymer often outperforms the state-of-the-art single-machine graph-analytics systems, including Ligra, X-Stream and Galois, for a set of popular real-world and synthetic grap

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

Optimization of HPF programs with dynamic recompilation technique

Optimization of HPF programs with dynamic recompilation tech...

引用

4th International Symposium on High Performance Computing, ISHPC 2002

作者： Araki, Takuya Murai, Hitoshi Kamachi, Tsunehiko Seo, Yoshiki Parallel and Distributed Systems NEC Laboratory Real World Computing Partnership United States

ISBN: (纸本)354043674X

Optimizing compilers perform various optimizations in order to exploit the best performance from computer systems. However, some kinds of optimizations cannot be applied if values of variables or system parameters are not known at compilation time. To solve this problem, we designed and implemented a system which collects such information at run time, and dynamically recompiles part of the program based on it. In our system, recompilation and management of runtime information are carried out on processors other than those which execute user programs. Therefore, recompilation cost does not affect the program execution time, unlike other similar systems. The evaluation result shows that quite high speedup can be attained with this method. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

A group-theoretic approach to data and code partitioning 98

A group-theoretic approach to data and code partitioning

引用

1998 ACM Symposium on Applied Computing, SAC 1998

作者： Besch, Matthias Pohl, Hans Werner Parallel and Distributed Systems GMD Laboratory GMD FIRST Rudower Chaussee 5 BerlinD-12489 Germany

ISBN: (纸本)0897919696

We present a new approach to the problem of dependence-free partitioning of structured domains, also known as alignment. The proposed method is based on a unified description of data and dependence structures with the help of abelian groups, and considers alignment as a factorization problem automatically driven by given crossed-and auto-dependences. We develop a mathematical framework and give some empirical results. © 1998 ACM.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Grid application monitoring and debugging using the mercury monitoring system

Grid application monitoring and debugging using the mercury ...

引用

European Grid Conference on Advances in Grid Computing - EGC 2005

作者： Gombás, Gábor Marosi, Csaba Attila Balaton, Zoltán MTA SZTAKI Laboratory of Parallel and Distributed Systems P.O. Box 63 H-1518 Budapest Hungary

The Mercury Monitoring System is a generic GMA-compatible grid monitoring framework. In this paper we present how higher level application monitoring and debugging facilities can be built on top of Mercury. Currently two higher level application monitoring systems are implemented using Mercury: one is GRM/PROVE and the other is a stand-alone MPI wrapper library that can be used to learn about the communication patterns of MPI programs. Remote debugging of applications has also been implemented on top of Mercury by using the remote debugging facilities of gdb (the GNU Debugger) which is also presented in this paper. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Prefetching and caching for query scheduling in a special class of distributed applications 25

Prefetching and caching for query scheduling in a special cl...

引用

25th International Conference on parallel Processing, ICPP 1996

作者： Sinha, A. Chase, C. Parallel and Distributed Systems Laboratory Department of Electrical and Computer Engineering University of Texas AustinTX78712 United States

ISBN: (纸本)081867623X

We analyze the scheduling aspects of database queries submitted to an abstract model of a very large distributed system. The essential elements of this model are: (a) a finite number of identical processing nodes with limited storage capacity, (b) a finite number of queries to be serviced, (c) a very large read-only data set that is shared by all queries and (d) a fixed inter-node communication latency. This framework models an important class of applications that use distributed processing of very large data sets. Examples of these applications exist in the very large database and multimedia problem domains. To meet the objective of minimizing flow time of queries while exploiting inter-query locality, various heuristics are proposed and evaluated through extensive simulation. © 1996 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：