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

A COMPARISON OF 2 PARADIGMS FOR distributed SHARED MEMORY

SOFTWARE-PRACTICE & EXPERIENCE 1992年第11期22卷 985-1010页

作者： LEVELT, WG KAASHOEK, MF BAL, HE TANENBAUM, AS Department of Mathematics and Computer Science Vrije Universiteit De Boelelaan 1081a 1081 HV Amsterdam The Netherlands

Two paradigms for distributed shared memory on loosely-coupled computing systems are compared: the shared data-object model as used in Orca, a programming language specially designed for loosely-coupled computing systems, and the shared virtual memory model. For both paradigms two systems are described, one using only point-to-point messages, the other using broadcasting as well. The two paradigms and their implementations are described briefly. Their performances are compared on four applications: the travelling-salesman problem, alpha-beta search, matrix multiplication and the all-pairs shortest-paths problem. Measurements were obtained on a system consisting of 10 MC68020 processors connected by an Ethernet. For comparison purposes, the applications have also been run on a system with physical shared memory. In addition, the paper gives measurements for the first two applications above when remote procedure call is used as the communication mechanism. The measurements show that both paradigms can be used efficiently for programming large-grain parallel applications, with significant speed-ups. The structured shared data-object model achieves the highest speed-ups and is easiest to program and to debug.

关键词： AMEBA distributed SHARED MEMORY distributed programming ORCA SHARED-DATA OBJECTS SHARED VIRTUAL MEMORY

来源：评论

学校读者我要写书评

暂无评论

How to Use Google App Engine for Free Computing

引用

IEEE INTERNET COMPUTING 2013年第1期17卷 50-59页

作者： Malawski, Maciej Kuzniar, Maciej Wojcik, Piotr Bubak, Marian AGH University of Science and Technology

Can the Google App Engine cloud service be used, free of charge, to execute parameter study problems? That question drove this research, which is founded on the App Engine's newly developed Task Queue API. The authors created a simple and extensible framework implementing the master-worker model to enable usage of the App Engine application servers as computational nodes. This article presents and discusses the results of the feasibility study, as well as compares the solution with EC2, Amazon's free cloud offering.

关键词： Search Engines Google Cloud Computing Monte Carlo Methods Servers Monitoring Internet Computing distributed programming Cloud Computing Economic And Other Policies

来源：评论

学校读者我要写书评

暂无评论

Special Section: DAPSYS, workshop on distributed and parallel systems

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE 2010年第3期26卷 471-472页

作者： Nemeth, Zsolt Fahringer, Thomas Kacsuk, Peter MTA SZTAKI Comp & Automat Res Inst H-1518 Budapest Hungary Univ Innsbruck Inst Comp Sci A-6020 Innsbruck Austria

The July 2009 special issue of Future Generation Computer Systems presents selected articles of DAPSYS, Austrian-Hungarian Workshop on distributed and Parallel Systems, an international biannual conference series dedicated to all aspects of distributed and parallel computing. The article by Augusto Ciuffoletti proposes a soft mutual exclusion algorithm for distributed computing. Thara Angskun and co-researchers investigate self-healing capabilities of scalable fault tolerant distributed environments. Louis Gesbert and co-workers introduce a parallel extension of the ML functional language, the Bulk Synchronous ML (BSML). Boguslaw Butrylo presents a classic parallel programming challenge, a comparative analysis of a matrix solver, a cluster based with message passing and a dynamically reconfigurable shared memory cluster based with communication on the fly. József Kovács and colleagues focus on parallel checkpointing issues.

关键词： Parallel programming distributed programming distributed systems Parallel algorithms distributed applications

来源：评论

学校读者我要写书评

暂无评论

distributed dynamic slicing of Java programs

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2006年第12期79卷 1661-1678页

作者： Mohapatra, Durga P. Kumar, Rajeev Mall, Rajib Kumar, D. S. Bhasin, Mayank Natl Inst Technol Dept Comp Sci & Engn Rourkela 769008 Orissa India Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

We propose a novel dynamic slicing technique for distributed Java programs. We first construct the intermediate representation of a distributed Java program in the form of a set of distributed program Dependence Graphs (DPDG). We mark and unmark the edges of the DPDG appropriately as and when dependencies arise and cease during run-time. Our algorithm can run parallely on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. Our approach does not require any trace files to be maintained. Another advantage of our approach is that a slice is available even before a request for a slice is made. This appreciably reduces the response time of slicing commands. We have implemented the algorithm in a distributed environment. The results obtained from our experiments show promise. (C) 2006 Elsevier Inc. All rights reserved.

关键词： program slicing dynamic slicing program dependence graph debugging object-oriented program multithreading Java distributed programming

来源：评论

学校读者我要写书评

暂无评论

Mobile agent security

引用

ELECTRONICS & COMMUNICATION ENGINEERING JOURNAL 2002年第5期14卷 211-218页

作者： Borselius, N Univ London Royal Holloway & Bedford New Coll Informat Secur Grp Egham TW20 0EX Surrey England

The agent paradigm is currently attracting much research. A mobile agent is a particular type of agent with the ability to migrate from one host to another, where it can resume its execution. In this paper we consider security issues that need to be addressed before multi-agent systems in general, and mobile agents in particular, can be a viable solution for a broad range of commercial applications. This is done by considering the implications of the characteristics given to agents and the general properties of open multi-agent systems. The paper then looks in some more detail at security technology and methods applicable to mobile agent systems.

关键词： distributed programming software agents security of data telecommunicationsecurity multi-agent systems mobile radio mobile agent security agent paradigm multi-agentsystems commercial applications open multi-agent systems security technol

来源：评论

学校读者我要写书评

暂无评论

Web computing framework

引用

JOURNAL OF SYSTEMS ARCHITECTURE 1999年第15期45卷 1293-1306页

作者： Serbedzija, NB GMD FIRST D-12489 Berlin Germany

In this paper an approach to provide Web-based framework for distributed execution of collaborative applications is presented. The work is part of a wider on-going project whose aim is to make computing resources, both hardware and software, available to Web users. The core of the system is the Web computing skeleton constructed from prefabricated Web-enabled components with the ability to open and maintain Internet connections and provide collaboration over the World Wide Web. A number of examples illustrate how Web presentation can be enriched with collaborative software using the Web computing framework. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： web-based computing distributed programming middleware

来源：评论

学校读者我要写书评

暂无评论

DisGCo: A Compiler for distributed Graph Analytics

引用

ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION 2020年第4期17卷 1–26页

作者： Rajendran, Anchu Nandivada, V. Krishna Indian Inst Technol Madras Chennai Tamil Nadu India IIT Madras Dept CSE Chennai 600036 Tamil Nadu India

Graph algorithms are widely used in various applications. Their programmability and performance have garnered a lot of interest among the researchers. Being able to run these graph analytics programs on distributed systems is an important requirement. Green-Marl is a popular Domain Specific Language (DSL) for coding graph algorithms and is known for its simplicity. However, the existing Green-Marl compiler for distributed systems (Green-Marl to Pregel) can only compile limited types of Green-Marl programs (in Pregel canonical form). This severely restricts the types of parallel Green-Marl programs that can be executed on distributed systems. We present DisGCo, the first compiler to translate any general Green-Marl program to equivalent MPI program that can run on distributed systems. Translating Green-Marl programs to MPI (SPMD/MPMD style of computation, distributed memory) presents many other exciting challenges, besides the issues related to differences in syntax, as Green-Marl gives the programmer a unified view of the whole memory and allows the parallel and serial code to be intermixed. We first present the set of challenges involved in translating Green-Marl programs to MPI and then present a systematic approach to do the translation. We also present a few optimization techniques to improve the performance of our generated programs. DisGCo is the first graph DSL compiler that can handle all syntactic capabilities of a practical graph DSL like Green-Marl and generate code that can run on distributed systems. Our preliminary evaluation of DisGCo shows that our generated programs are scalable. Further, compared to the state-of-the-art DH-Falcon compiler that translates a subset of Falcon programs to MPI, our generated codes exhibit a geomean speedup of 17.32x.

关键词： Graph analytics distributed programming GreenMarl

来源：评论

学校读者我要写书评

暂无评论

Tiered algorithm for distributed process quiescence and termination detection

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2007年第11期18卷 1529-1538页

作者： DeMara, Ronald F. Tseng, Yili Ejnioui, Abdel Univ Cent Florida Sch Elect Engn & Comp Sci Orlando FL 32816 USA Auricular Med Int Res & Training Ctr Fern Pk FL 32730 USA Univ S Florida Dept Informat Technol Lakeland FL 33863 USA

The Tiered Algorithm is presented for time- efficient and message- efficient detection of process termination. It employs a global invariant of equality between process production and consumption at each level of process nesting to detect termination, regardless of execution interleaving order and network transit time. Correctness is validated for arbitrary process launching hierarchies, including launch- in- transit hazards, where processes are created dynamically based on runtime conditions for remote execution. The performance of the Tiered Algorithm is compared to three existing schemes with comparable capabilities, namely, the Chandrasekaran and Venkatesan ( CV), Lai, Tseng, and Dong ( LTD), and Credit termination detection algorithms. For synchronization of T tasks terminating in E epochs of idle processing, the Tiered Algorithm is shown to incur O(E) message count complexity and O(T lg T) message bit complexity while incurring detection latency corresponding to only integer addition and comparison. The synchronization performance in terms of message overhead, detection operations, and storage requirements are evaluated and compared across numerous task creation and termination hierarchies.

关键词： synchronization multitasking distributed architectures distributed programming parallel processing

来源：评论

学校读者我要写书评

暂无评论

EARLY EXPERIENCE WITH THE VISUAL PROGRAMMERS WORKBENCH

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1990年第10期16卷 1107-1121页

作者： RUBIN, RV WALKER, J GOLIN, EJ UNIV ILLINOIS DEPT COMP SCI URBANA IL 61801 USA

Diagrams play a central role in software engineering. They are used for specifying design elements such as requirements, concurrent systems, database models and interactive systems. Families of diagrams form visual languages, and creating such diagrams constitutes visual programming. The Visual Programmer's WorkBench (VPW) addresses the rapid synthesis of programming environments for the specification, analysis, and execution of visual programs. A language-based environment for a specific visual language is generated in VPW from a specification of the syntactic structure, the abstract structure, the static semantics and the dynamic semantics of the language. VPW is built around a model of distributed processing based on shared distributed memory. This framework is used both in defining the architecture of the environment and for the execution model of visual languages. The Visual Programmer's WorkBench has been used to experiment with visual programming environments for several visual languages. This paper describes the design of the Visual Programmer's WorkBench and our experience using it to generate a distributed programming environment for a concurrent visual language. [ABSTRACT FROM AUTHOR]

关键词： distributed programming program specification programming environments visual languages and semantics

来源：评论

学校读者我要写书评

暂无评论

Characterizing communication channel deadlocks in sequence diagrams

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2008年第3期34卷 305-320页

作者： Mitchell, Bill Univ Surrey Dept Comp Guildford GU2 7XH Surrey England

UML sequence diagrams (SDs) are a mainstay of requirements specifications for communication protocols. Mauw and Reniers' algebraic (MRA) semantics formally specifies a behavior for these SDs that guarantees deadlock-free processes. Practitioners commonly use communication semantics that differ from MRA, which may result in deadlocks, for example, FIFO, token ring, etc. We define a process algebra that is an extension of the MRA semantics for regular SDs. Our algebra can describe several commonly used communication semantics. Regular SDs are constructed from concurrent message flows via iteration, branching, and sequential composition. Their behavior is defined in terms of a set of partial orders on the events in the SD. Such partial orders are known as causal orders. We define partial order theoretic properties of a causal order that are particular kinds of race condition. We prove that any of the common communication semantics that we list either guarantees deadlock-free SDs or can result in a deadlock if and only if a causal order of an SD contains one of these types of race condition. This describes a complete classification of deadlocks as specific types of race condition.

关键词： requirements analysis formal methods distributed programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：