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

18th IFIP WG 6.1 international conference on Coordination Models and Languages, COORDINATION 2016 and Held as Part of the 11th international Federated conference on distributed computing Techniques, DisCoTec 2016

18th IFIP WG 6.1 International Conference on Coordination Mo...

引用

18th IFIP WG 6.1 international conference on Coordination Models and Languages, COORDINATION 2016 and Held as Part of the 11th international Federated conference on distributed computing Techniques, DisCoTec 2016

ISBN: (纸本)9783319395180

the proceedings contain 16 papers. the special focus in this conference is on Coordination Models and Languages. the topics include: Multilevel transitive and intransitive non-interference, causally;a game interpretation of retractable contracts;tuple spaces implementations and their efficiency;on-the-fly mean-field model-checking for attribute-based coordination;scheduling games for concurrent systems;an asynchronous parallel abstraction for speculative pipeline computations;modelling ambulance deployment with CARMA;on synchronous and asynchronous compatibility of communicating components;a formal analysis of the global sequence protocol;improving gossip dynamics through overlapping replicates;from modelling to systematic deployment of distributed active objects;an interference-free programming model for network objects and on sessions and infinite data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A case of electrical circuit switched interconnection network for parallel computers 18

A case of electrical circuit switched interconnection networ...

引用

18th international conference on parallel and distributed computing, Applications and Technologies, PDCAT 2017

作者： Hu, Yao Kudoh, Tomohiro Koibuchi, Michihiro National Institute of Informatics 2-1-2 Hitotsubashi Chiyoda-ku Tokyo101-8430 Japan University of Tokyo 2-11-16 Yayoi Bunkyo-ku Tokyo113-8658 Japan

ISBN: (纸本)9781538631515

Circuit switching is a way to minimize network latency and maximize network bandwidth when a limited number of source-and-destination pairs exchange messages which are predictable. Although there are a large number of studies of optical circuit switching (OCS) on HPC systems and datacenters, it is still not mature. In this context, we explore the use of electrical circuit switching (ECS) for the low-latency purpose on HPC systems and datacenters. ECS has the same link bandwidth as existing electrical packet switched networks, and inherits quick update of input-and-output connections from electrical switches. We develop a network topology generator for ECS to minimize the number of time slots optimized to target applications whose traffic patterns are predictable. By performing a quantitative discrete-event simulation, we present that an ideal ECS network outperforms counterpart EPS networks. Evaluation results show that the minimum necessary number of slots (MNNS) can be reduced to a small number in a generated topology while keeping resource amount less than that in a standard mesh network. © 2017 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Safe Shared State in Dataflow systems 18

Safe Shared State in Dataflow Systems

引用

18th international conference on distributed and Event-Based systems (DEBS)

作者： De Martini, Luca Margara, Alessandro Politecn Milan Milan Italy

ISBN: (纸本)9798400704437

the complexity of implementing scalable data processing tasks in parallel and distributed computing environments has pushed the adoption of restricted programming models that simplify expressing such tasks. In this context, the dataflow model has emerged as the standard for building distributed data processing systems. the key insight of this model is to express computations as sequences of operations that do not share any state and can thus be deployed and executed independently on the same or on different machines. however entirely excluding state sharing may be detrimental for performance, as it prevents operations executed on the same machine from accessing common resources. the effects of these limitations become more and more evident as the computational and memory resources of individual hosts increase, and even large-scale data analysis tasks can be performed with few well-equipped machines. Moving from this observation, in this paper we present an extension to the classic dataflow model that enables disciplined state sharing across operators to improve performance. We implement the model in Renoir, a dataflow system written in Rust, and we exploit the characteristics of this programming language to ensure sate access to shared state by design. We present several use cases where our model may be beneficial, and we use them to evaluate the proposed model in terms of performance and code complexity. We show that our model empowers developers to better exploit the resources of machines, resulting in substantial performance improvements in several use cases. Programs written with our extended model may even be more concise and simpler than in the classic dataflow model.

关键词： dataflow shared state distributed programming Rust memory safety data processing

来源：评论

学校读者我要写书评

暂无评论

Communication benchmarking and performance modelling of MPI programs on cluster computers

引用

JOURNAL OF SUPERcomputing 2005年第2期34卷 201-217页

作者： Grove, DA Coddington, PD Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia

this paper gives an overview of two related tools that we have developed to provide more accurate measurement and modelling of the performance of message-passing communication and application programs on distributed memory parallel computers. MPIBench uses a very precise, globally synchronised clock to measure the performance of MPI communication routines. It can generate probability distributions of communication times, not just the average values produced by other MPI benchmarks. this allows useful insights to be made into the MPI communication performance of parallel computers, and in particular how performance is affected by network contention. the Performance Evaluating Virtual parallel Machine (PEVPM) provides a simple, fast and accurate technique for modelling and predicting the performance of message-passing parallel programs. It uses a virtual parallel machine to simulate the execution of the parallel program. the effects of network contention can be accurately modelled by sampling from the probability distributions generated by MPIBench. these tools are particularly useful on clusters with commodity Ethernet networks, where relatively high latencies, network congestion and TCP problems can significantly affect communication performance, which is difficult to model accurately using other tools. Experiments with example parallel programs demonstrate that PEVPM gives accurate performance predictions on commodity clusters. We also show that modelling communication performance using average times rather than sampling from probability distributions can give misleading results, particularly for programs running on a large number of processors.

关键词： parallel computing cluster computing performance modelling

来源：评论

学校读者我要写书评

暂无评论

Influence of Facial Expression and Viewpoint Variations on Face Recognition Accuracy by Different Face Recognition Algorithms 18

Influence of Facial Expression and Viewpoint Variations on F...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Phankokkruad, Manop Jaturawat, Phichaya King Mongkuts Inst Technol Ladkrabang Fac Informat Technol Bangkok 10520 Thailand

ISBN: (纸本)9781509055043

Face recognition is a personal identification method using biometrics that is gaining the attention in this research field. the face recognition process can be done without the human and devices interaction, so it can be applied in several applications. In additions, the face recognition systems are typically implemented at different places in unconstrained environments. Hence, the study of the factors that impact the face recognition accuracy is an interesting and challenging topic. In the class attendance checking system using face recognition, there are variations of three factors that possibly affect the accuracy of the system;facial expressions, and face viewpoints. this study intends to compare facial recognition accuracy of three well-known algorithms namely Eigenfaces, Fisherfaces, and LBPH. the experiments conducted in the respects of the variation of facial expressions, and face viewpoints in the actual classroom. the results of the experiment demonstrated that LBPH is the most precise algorithm which achieves 81.67% of accuracy in still-image-based testing. the facial expression that has the most impact on accuracy is the grin, and face viewpoints that affect accuracy are looking down and tilting left, and right respectively. therefore, LBPH is the most suitable algorithm to apply in a class attendance checking system after considering the accuracy.

关键词： Face Recognition Fisherfaces Eigenfaces LBPH Class Attendance Facial Expression Face Viewpoint Computer Vision

来源：评论

学校读者我要写书评

暂无评论

Evaluation of cluster interconnects for a distributed Shared Memory 18

Evaluation of cluster interconnects for a Distributed Shared...

引用

18th IEEE international Performance, computing and Communications conference

作者： Roy, S Chaudhary, V Wayne State Univ Parallel & Distributed Comp Lab Detroit MI 48202 USA

ISBN: (纸本)0780352580;0780352599

Clusters of Symmetrical Multiprocessors (SMPs) have recently become popular as low-cost, high-performance computing solutions, the type of interconnection hardware used in these clusters can become a deciding factor in their overall performance. this paper evaluates the performance of three different communication systems, 10 Mbps Ethernet, 100 Mbps FastEthernet and 155 Mbps ATM, using a multithreaded distributed Shared Memory system, Strings. the raw performance of each network is first measured using netperf Ten different applications are then used for performance evaluation, including programs from the SPLASH-2 benchmarks, a medical computing application, and some computational kernels. It is found that half of the programs tested are not significantly affected by changes in the bandwidth. though the ATM network provides the highest overall bandwidth, the remaining applications show that the increase in latency compared to FastEthernet prevents any performance improvement. On the other hand, applications that require only moderately high bandwidths perform substantially better with FastEthernet.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Towards Robust Resource Allocations via Performance Modeling with Stochastic Process Algebra 18

Towards Robust Resource Allocations via Performance Modeling...

引用

18th IEEE international conference on Computational Science and Engineering (CSE)

作者： Banicescu, Ioana Srivastava, Srishti Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS 39762 USA

ISBN: (纸本)9781467382977

Recent developments in the field of parallel and distributed computing have led to a proliferation in solving large and computationally intensive mathematical, science, or engineering problems, which consist of several parallelizable parts and several non-parallelizable (sequential) parts. However, such computational environments are often prone to unpredictable variations due to problem, algorithm, and system characteristics. therefore, a robustness study of resource allocations and application scheduling is required to guarantee a desired level of performance. Given an initial workload, a mapping of applications to resources is considered to be robust if that mapping optimizes the execution performance and guarantees a desired level of performance in the presence of unpredictable perturbations at runtime. In this research, a stochastic process algebra, Performance Evaluation Process Algebra (PEPA), is used for obtaining performance of various resource allocations via a numerical analysis of performance modeling of the parallel execution of applications on parallel computing resources. the PEPA performance model is translated into an underlying mathematical Markov chain model for obtaining performance measures. Further, a robustness analysis of various allocations is performed for finding a robust mapping from a set of initial mapping schemes. the numerical results obtained from this performance modeling of resource allocations have been validated by the simulation results of earlier research which were made available in the existing literature, thus underscoring the significance and benefits of using stochastic process algebra models and the related numerical analysis in providing a cost effective and low overhead analysis of robustness.

关键词： Performance modeling Performance evaluation Robustness analysis parallel computing Process algebra Stochastic computing environment

来源：评论

学校读者我要写书评

暂无评论

Numerical P systems with thresholds and Petri Nets 18th

Numerical P Systems with Thresholds and Petri Nets

引用

18th international conference on Bio-Inspired computing: theories and Applications (BIC-TA)

作者： Zhang, Luping Zhang, Zhimeng East China Univ Technol Jiangxi Engn Technol Res Ctr Nucl Geosci Data Sci Sch Informat Engn Jiangxi Engn Lab Radioact Geosci & Big Data Techn Nanchang 330013 Jiangxi Peoples R China

ISBN: (纸本)9789819722716;9789819722723

Membrane computing provides efficient computing devices for broad applications due to its distributed storage and the parallel processing. As computing devices in membrane computing, numerical P systems with thresholds (NPT systems) are proven to be Turing universal, and their computational and operational semantics need to be further investigated. In this work, the intrinsic relationship between NPT systems and Petri nets is concerned. the ingredients of Petri nets are associated with the elements of numerical variables in NPT systems, and the operations of Petri nets are associated with the evolutions of NPT systems. the results on the boundedness and reachability of NPT systems are obtained by using the relationship between NPT systems and Petri nets.

关键词： Membrane computing Numerical P systems threshold Petri net

来源：评论

学校读者我要写书评

暂无评论

HPGraph: A High parallel Graph Processing System Based on Flash Array

HPGraph: A High Parallel Graph Processing System Based on Fl...

引用

18th IEEE international conference on High Performance computing and Communications, 14th IEEE international conference on Smart City and 2nd IEEE international conference on Data Science and systems, HPCC/SmartCity/DSS 2016

作者： Xing, Yuxuan Feng, Ya Yu, Songping Chen, Zhengguo Liu, Fang Xiao, Nong State Key Lab. of High Performance Comput. Nat. Univ. of Defense Technol. Changsha China School of Data and Computer Science Sun Yat-sun University Guangzhou China

ISBN: (纸本)9781509042968

Large graphs analytics has been an important aspect of many big data applications, such as web search, social networks and recommendation systems. Many research focuses on processing large scale graphs using distributed system over past few years. And numbers of studies turn to construct graph processing system on a single server-class machine in consideration of cost, usability and maintainability. HPGraph is a high parallel graph processing system which adopts the edge-centric model, our contributions are as follows: (1) designing an efficient data allocation and access strategy for NUMA machine, and providing tasks scheduling to keep load balance, (2) raising a fine-grained edge-block filtering mechanism to avoid accessing unnecessary edge data, (3) constructing a high-speed flash array as the second storage. We made a detailed evaluation on a 16-core machine using asset of popular real word and synthetic data sets, and the results show that HPGraph always outperforms the state-of-the-art single machine graph processing systems-GridGraph. And HPGraph can achieve 1.27X faster than GridGraph for specific application. Our source code is available at https://***/xinghuan1990/HPGraph. © 2016 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A general performance model of structured and unstructured mesh particle transport computations

引用

JOURNAL OF SUPERcomputing 2005年第2期34卷 181-199页

作者： Mathis, MM Kerbyson, DJ Los Alamos Natl Lab PAL Los Alamos NM 87545 USA

the performance of unstructured mesh applications presents a number of complexities and subtleties that do not arise for dense structured meshes. From a programming point of view, the handling of unstructured meshes has an increased complexity in order to manage the necessary data structures and interactions between mesh-cells. From a performance point of view, there are added difficulties in understanding both the processing time on a single processor and the scaling characteristics when using large-scale parallel systems. In this work we present a general performance model for the calculation of deterministic S-N transport on unstructured meshes that is also applicable to structured meshes. the model captures the key processing characteristics of the calculation and is parametric using both system performance data (latency, bandwidth, processing rate etc.) and application data (mesh size etc.) as input. A single formulation of the model is used to predict the performance of two quite different implementations of the same calculation. It is validated on two clusters (an HP AlphaServer and an Itanium-2 system) showing high prediction accuracy.

关键词： performance modeling performance analysis high performance computing SN transport unstructured meshes parallel processing large-scale systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：