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

EVALUATION OF distributed FINITE-ELEMENT ALGORITHMS ON A WORKSTATION NETWORK

ENGINEERING WITH COMPUTERS 1994年第1期10卷 45-62页

作者： BAUGH, JW SHARMA, SK 1. Department of Civil Engineering North Carolina State University 27695 Raleigh North Carolina USA

This paper discusses the design, implementation and evaluation of linear finite element programs that distribute their computations over a network of workstations. We consider five different algorithms based on direct, iterative and hybrid equation solvers, each of which partitions and maps the model domain across conventional network hardware. A software architecture based on the client-server model distributes the computations and, at the language level, Berkeley sockets enable communication between processes. We evaluate and describe the performance of these algorithms in terms of execution time and speed-up, and we conclude that distributed solvers, particularly those based on substructuring and static condensation, can be effective even on high-latency communication networks.

关键词： CLIENT-SERVER COMPUTING COMPUTER NETWORKS distributed programming EQUATION SOLVING FINITE ELEMENT ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

The design of a multicore extension of the SPIN model checker

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2007年第10期33卷 659-674页

作者： Holzmann, Gerard J. Bosnacki, Dragan CALTECH Jet Prop Labs Lab Reliable Software Pasadena CA 91109 USA Eindhoven Univ Technol NL-5600 MB Eindhoven Netherlands

We describe an extension of the SPIN model checker for use on multicore shared-memory systems and report on its performance. We show how, with proper load balancing, the time requirements of a verification run can, in some cases, be reduced close to N-fold when N processing cores are used. We also analyze the types of verification problems for which multicore algorithms cannot provide relief. The extensions discussed here require only relatively small changes in the SPIN source code and are compatible with most existing verification modes such as partial order reduction, the verification of temporal logic formulas, bitstate hashing, and hash-compact compression.

关键词： software/program verification model checking models of computation logics and meanings of programs distributed programming

来源：评论

学校读者我要写书评

暂无评论

Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2006年第1期3卷 45-61页

作者： Badishi, G Keidar, I Sasson, A Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel IBM Labs Haifa Israel

We propose a framework and methodology for quantifying the effect of denial of service (DoS) attacks on a distributed system. We present a systematic study of the resistance of gossip-based multicast protocols to DoS attacks. We show that even distributed and randomized gossip-based protocols, which eliminate single points of failure, do not necessarily eliminate vulnerabilities to DoS attacks. We propose Drum - a simple gossip-based multicast protocol that eliminates such vulnerabilities. Drum was implemented in Java and tested on a large cluster. We show, using closed-form mathematical analysis, simulations, and empirical tests, that Drum survives severe DoS attacks.

关键词： distributed applications reliability availability serviceability distributed programming

来源：评论

学校读者我要写书评

暂无评论

ALGORITHMS FOR distributed TERMINATION DETECTION

引用

distributed COMPUTING 1987年第3期2卷 161-175页

作者： MATTERN, F 1. Department of Computer Science SFB124 University of Kaiserslautern P. O. Box 3049 D-6750 Kaiserslautern Federal Republic of Germany

The termination problem for distributed computations is analyzed in the general context of asynchronous communication. In the underlying computational model it is assumed that messages take an arbitrary but finite time and do not necessarily obey the FIFO rule. Time diagrams are used as a graphic means of representing the overall communication scheme, giving a clear insight into the difficulties involved (e.g., lack of global state or time, inconsistent time cuts) and suggesting possible solutions.

关键词： distributed termination Termination detection Asynchronous communication systems distributed programming Decentralized control Atomic model of computation Global snapshots Communication deadlock detection Global quiescence Diffusing computation

来源：评论

学校读者我要写书评

暂无评论

A METHODOLOGY FOR DEVELOPING distributed PROGRAMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第8期13卷 967-976页

作者： RAMESH, S MEHNDIRATTA, SL Department of Computer Science and Engineering Indian Institute of Technology

A methodology for constructing distributed programs is presented that is different from existing methodologies. It is based on the well-known notion of developing distributed programs via synchronous and centralized programs. The distinguishing features of the methodology are: 1. Specification includes process structure data, and distributed programs are developed taking this information into account. 2. A new class of programs, called programs with processes involving shared actions, is employed in the development process. 3. A transformational approach is suggested to solve the problems inherent in the method of developing distributed programs through synchronous and centralized programs. The proposed methodology has been applied to many standard problems and found to be very useful.

关键词： Program Transformation Communicating Processes Decentralization distributed programming programming Methodology

来源：评论

学校读者我要写书评

暂无评论

AErlang: Empowering Erlang with attribute-based communication

引用

SCIENCE OF COMPUTER programming 2018年 168卷 71-93页

作者： De Nicola, Rocco Duong, Tan Inverso, Omar Trubiani, Catia IMT Inst Adv Studies Lucca Lucca Italy Gran Sasso Sci Inst Laquila Italy

Attribute-based communication provides a novel mechanism to dynamically select groups of communicating entities by relying on predicates over their exposed attributes. This paradigm represents an interesting alternative to broadcasting and one-to-one communication, and has potential applications in modelling and analysing complex open-ended systems. In this paper, we study the impact of attribute-based communication by enriching a concurrency-oriented language, i.e., Erlang, with attribute-based primitives to obtain what we call AErlang. We also study the impact of using different implementation strategies for exchanging messages while evaluating the sending and receiving predicates. To evaluate our proposal, we consider two case studies and analyse them from the point of view of efficiency and scalability. The outcome shows that broadcasting is very inefficient and not suitable to handle large systems and that other implementation strategies, whose choice depends on the specific class of problems under consideration, are definitely preferable. We also use one of the case studies to compare AErlang's implementation with that of pure Erlang and X10. The experiments confirm that the overhead resulting from the new communication primitives is acceptable, and that our prototype successfully preserves Erlang's efficiency and scalability. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Attribute-based communication Erlang Concurrency distributed programming Collective adaptive systems Stable Marriage

来源：评论

学校读者我要写书评

暂无评论

Quatrain: Accelerating Data Aggregation between Multiple Layers

引用

IEEE TRANSACTIONS ON COMPUTERS 2014年第5期63卷 1207-1219页

作者： Ren, Jinglei Wu, Yongwei Zhu, Meiqi Zheng, Weimin Tsinghua Univ Dept Comp Sci & Technol Tsinghua Natl Lab Informat Sci & Technol TNLIST Beijing 100084 Peoples R China Tsinghua Univ Shenzhen Res Inst Shenzhen 518057 Peoples R China

Composition of multiple layers (or components/services) has been a dominant practice in building distributed systems, meanwhile aggregation has become a typical pattern of data flows nowadays. However, the efficiency of data aggregation is usually impaired by multiple layers due to amplified delay. Current solutions based on data/execution flow optimization mostly counteract flexibility, reusability, and isolation of layers abstraction. Otherwise, programmers have to do much error-prone manual programming to optimize communication, and it is complicated in a multithreaded environment. To resolve the dilemma, we propose a new style of inter-process communication that not only optimizes data aggregation but also retains the advantages of layered (or component-based/service-oriented) architecture. Our approach relaxes the traditional definition of procedure and allows a procedure to return multiple times. Specifically, we implement an extended remote procedure calling framework Quatrain to support the new multireturn paradigm. In this paper, we establish the importance of multiple returns, introduce our very simple semantics, and present a new synchronization protocol that frees programmers from multireturn-related thread coordination. Several practical applications are constructed with Quatrain, and the evaluation shows an average of 56% reduction of response time, compared with the traditional calling paradigm, in realistic environments.

关键词： distributed programming distributed systems data communications interfaces system integration and implementation asynchronous/synchronous operation client/server frameworks patterns procedures functions and subroutines

来源：评论

学校读者我要写书评

暂无评论

coreSNP: Parallel Processing of Microarray Data

引用

IEEE TRANSACTIONS ON COMPUTERS 2014年第12期63卷 2961-2974页

作者： Guzzi, Pietro Hiram Agapito, Giuseppe Cannataro, Mario Magna Graecia Univ Catanzaro Dept Med & Surg Sci Catanzaro Italy ICAR CNR Arcavacata Di Rende Italy

The availability of high-throughput technologies, such as next generation sequencing and microarray, and the diffusion of genomics studies to large populations are producing an increasing amount of experimental data. In particular, pharmacogenomics studies the impact of genetic variation on drug response in patients and correlates gene expression or single nucleotide polymorphisms (SNPs) with the toxicity or efficacy of a drug, with the aim to improve drug therapy with respect to the patients' genotype ensuring maximum efficacy with minimal adverse effects. However, the storage, preprocessing, and analysis of experimental data are becoming a main bottleneck in the pharmacogenomics analysis pipeline, due to the increasing number of genes and patients investigated. This paper presents a new parallel software tool named coreSNP for the parallel preprocessing and statistical analysis of DMET (Drug Metabolism Enzymes and Transporters) SNP microarray data produced by Affymetrix for pharmacogenomics studies. The scalable multi-threaded implementation of coreSNP allows to handle the huge volumes of experimental pharmacogenomics data in a very efficient way, while its easy to use graphical user interface and its ability to annotate significant SNPs allow biologists to interpret the results easily. Performance evaluation conducted using real datasets shows good speed-up and scalability and effective response times.

关键词： Bioinformatics (genome or protein) databases medical information systems health care healthcare distributed programming statistical software distributed systems

来源：评论

学校读者我要写书评

暂无评论

SIR: inter-program concurrency support for SR programs

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2002年第4期28卷 307-325页

作者： Fodor, EF Olsson, RA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

This paper presents synchronizing interoperable resources (SIR). SIR extends to multi-program environments the concurrent communication mechanisms in the SR concurrent programming language. This paper discusses design and implementation issues including implicit binding, a mechanism for providing seamless concurrent communication. It also examines some performance results of SIR as well as presenting qualitative analysis. This paper also compares SIR with CORBA and other systems that provide interoperability. (C) 2002 Elsevier Science Ltd. All rights reserved.

关键词： inter-program concurrent programming concurrent programming languages interoperability concurrent programming distributed programming

来源：评论

学校读者我要写书评

暂无评论

ASYNCHRONOUS distributed TERMINATION - PARALLEL AND SYMMETRIC-SOLUTIONS WITH ECHO ALGORITHMS

引用

ALGORITHMICA 1990年第3期5卷 325-340页

作者： MATTERN, F 1. Department of Computer Science University of Kaiserslautern P.O. Box 3049 D-6750 Kaiserslautern Federal Republic of Germany

The principle of message counting is used to detect termination of distributed computations which consist of processes asynchronously communicating over non-FIFO channels. The solution is symmetric and not based on a predefined communication structure. An efficient variant of the echo algorithm, which dynamically builds a spanning tree, allows a parallel and distributed evaluation of the termination predicate in time proportional to the diameter of the communication graph. Concurrent and repeated initiation of the detection algorithm by different processes is possible at any time without prior synchronization due to a subtle method of collision detection and wave extinction, which can be regarded as a distributed election scheme where the average message complexity increases only logarithmically with the number of concurrent initiators. Control messages have a small length and additional communication links are not required. Only a fixed number of simple variables is needed in every process, global knowledge such as the total number of processes or the structure of the network is not used, making the scheme useful for dynamic systems. Several variations of the basic principle are presented, important issues such as message complexity and fault-tolerance are discussed.

关键词： distributed termination Echo algorithm distributed programming Decentralized control distributed algorithm Election Symmetry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：