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

35th ACM SIGMOD Conference

作者： Isard, Michael Yu, Yuan Microsoft Research Silicon Valley United States

ISBN: (纸本)9781605585543

The Dryad and DryadLINQ systems offer a new programming model for large scale data-parallel computing. They generalize previous execution environments such as SQL and Map Reduce in three ways: by providing a general-purpose distributed execution engine for data-parallel applications;by adopting an expressive data model of strongly typed .NET objects;and by supporting general-purpose imperative and declarative operations on datasets within a traditional high-level programming language. A DryadLINQ program is a sequential program composed of LINQ expressions performing arbitrary side-effect-free operations on datasets, and can be written and debugged using standard .NET development tools. The DryadLINQ system automatically and transparently translates the data-parallel portions of the program into a distributed execution plan which is passed to the Dryad execution platform. Dryad, which has been in continuous operation for several years on production clusters made up of thousands of computers, ensures efficient, reliable execution of this plan on a large compute cluster. This paper describes the programming model, provides a high-level overview of the design and implementation of the Dryad and DryadLINQ systems, and discusses the tradeoffs and connections to parallel and distributed databases.

关键词： distributed programming cloud computing concurrency

来源：评论

学校读者我要写书评

暂无评论

Acute: High-level programming language design for distributed computation 05

Acute: High-level programming language design for distribute...

引用

10th ACM SIGPLAN International Conference on Functional programming (ICFP)

作者： Sewell, Peter Leifer, James J. Wansbrough, Keith Nardelli, Francesco Zappa Allen-Williams, Mair Habouzit, Pierre Vafeiadis, Viktor Univ Cambridge Cambridge England INRIA Rocquencourt Le Chesnay France

ISBN: (纸本)9781595930644

Existing languages provide good support for typeful programming of stand-alone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper, we discuss programming-language support for such systems, focussing on their typing and naming issues. We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately built programs. The main features are (1) type-safe marshalling of arbitrary values;(2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system;(3) expression-level names generated to ensure that name equality tests suffice for type safety of associated values, for example, values carried on named channels;(4) controlled dynamic rebinding of marshalled values to local resources;and (5) thunkification of threads and mutexes to support computation mobility. These features are a large part of what is needed for typeful distributed programming. They are a relatively lightweight extension of ML, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. This disentangles the language run-time from communication intricacies. This paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

关键词： modules distributed programming programming languages marshalling version control serialisation ML abstract types type theory rebinding

来源：评论

学校读者我要写书评

暂无评论

UNIX based programming tools for locally distributed network applications.

UNIX based programming tools for locally distributed network...

引用

作者： Frank, William C. Naval Postgraduate School

学位级别：硕士

The Graphics and Video Laboratory of the Department of Computer Science has a growing need for easy to use programming tools in support of distributed processing applications. The most pressing need is for software on three UNIX-based workstations connected via Ethernet. The remote interprocess communication tools that UNIX provides for using Ethernet are effective but complicated to learn. This requires researchers to spend much of their time becoming proficient with them instead of concentrating on the distributed application at hand. This work presents the design and implementation of several programming tools that allow programmers to establish and experiment with distributed programs in the graphics laboratory environment. The tools allow a higher level of abstraction for remote interprocess communications and establish a straightforward method for implementing distributed programs. Additionally, they support code reuseability with software templates and are modularized to be both understandable and changeable. Recommendations are made for future research and management efforts that have been highlighted by these new tools.

关键词： distributed programming Local Network Tools UNIX IPC Tools

来源：评论

学校读者我要写书评

暂无评论

Acute: High-level programming language design for distributed computation

引用

ACM SIGPLAN NOTICES 2005年第9期40卷 15-26页

作者： Sewell, P Leifer, JJ Wansbrough, K Nardelli, FZ Allen-Williams, M Habouzit, P Vafeiadis, V Univ Cambridge Cambridge CB2 1TN England

Existing languages provide good support for typeful programming of standalone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper we discuss programming language support for such systems, focussing on their typing and naming issues. We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately-built programs. The main features are: (1) type-safe marshalling of arbitrary values;(2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system;(3) expression-level names generated to ensure that name equality tests suffice for type-safety of associated values, e.g. values carried on named channels;(4) controlled dynamic rebinding of marshalled values to local resources;and (5) thunkification of threads and mutexes to support computation mobility. These features are a large part of what is needed for typeful distributed programming. They are a relatively lightweight extension of M L, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. This disentangles the language runtime from communication intricacies. This paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

关键词： languages design programming languages distributed programming marshalling serialisation abstract types modules rebinding version control type theory ML

来源：评论

学校读者我要写书评

暂无评论

The eXchange Calculus (XC): A functional programming language design for distributed collective systems

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2024年 210卷

作者： Audrito, Giorgio Casadei, Roberto Damiani, Ferruccio Salvaneschi, Guido Viroli, Mirko Univ Turin Dipartimento Informat Turin Italy Alma Mater Studiorum Univ Bologna DISI Cesena Italy Univ St Gallen Inst Comp Sci St Gallen Switzerland

distributed collective systems are systems formed by homogeneous dynamic collections of devices acting in a shared environment to pursue a joint task or goal. Typical applications emerge in the context of wireless sensor networks, robot swarms, groups of wearable -augmented people, and computing infrastructures. programming such systems is notoriously hard, due to requirements of scalability, concurrency, faults, and difficulty in making desired collective behaviour ultimately emerge: ad -hoc languages and mechanisms have been proposed threads like spatial computing, macro -programming, and field -based coordination. In this paper we present the eXchange Calculus (XC), formalising a tiny set of key mechanisms, usable across many different languages and platforms, allowing to express the overall interactive behaviour of distributed collective systems in a declarative way. In this approach, computation (executed in asynchronous rounds), communication (which is neighbour -based), and state over time, are all expressed by a single declarative construct, called exchange. We provide a formalisation of XC in terms of syntax, device -level and network -level semantics, prove a number of properties of the calculus, and discuss applicability considering a smart city scenario. XC is implemented as a DSL in Scala and in C++, with different trade-offs in terms of productivity and platform targetting.

关键词： distributed programming Collective computing Core calculus Operational semantics Type soundness Scala DSL C plus plus DSL

来源：评论

学校读者我要写书评

暂无评论

An Elixir library for programming concurrent and distributed embedded systems 17

An Elixir library for programming concurrent and distributed...

引用

Companion Proceedings of the 1st International Conference on the Art, Science, and Engineering of programming

作者： Humberto Rodriguez Avila Elisa Gonzalez Boix Wolfgang De Meuter Vrije Universiteit Brussel Brussels Belgium

ISBN: (纸本)9781450348362

Development of embedded systems has been receiving in last decade a considerable attention for both academy and industry. Advances in hardware miniaturization, in particular, single-boards computers like Raspberry Pi, Beaglebone Black, allow for the use of high-level programming languages. Still, the greatest challenges when developing IoT applications are distribution and coordination. To date, mainstream languages (e.g. Java, JavaScript, Python) lack high- level abstractions to deal with distribution and coordination. For example, implementing standard leader election algorithms (e.g., Ring, Bully) with these languages, force developers to write code on top of low-level networking APIs. As a result, programmers need to write over and over, aspects like the discovery of peers, coordination, failure handling necessary for implementing distributed algorithms. Furthermore, craft and deploy such systems on embedded devices is also complex, due to hardware restrictions and software dependencies. In this demo, we show how a concurrent and distributed language with a rich macro system could in an easy and declarative way solve these problems. Our demo recreates a leader election algorithm between the nodes in an embedded environment by employing a Raspberry Pi cluster. The code for the leader election algorithm is built on top of a macro-based Elixir library which includes abstractions for distribution and coordination. Developers can use this library to translate core operations described by the Bully algorithm to declarative macro-constructs. This library also abstracts developers of communication and network concerns (e.g. service discovery and network monitoring). Furthermore, it includes an implementation of an Elixir behaviour (design pattern) to provide a base skeleton for developing leader-election applications.

关键词： Leader Election distributed programming Embedded systems Concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Comparison of database replication techniques based on total order broadcast

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2005年第4期17卷 551-566页

作者： Wiesmann, M Schiper, A European Org Nucl Res ATLAS TDAQ Div PH CH-1211 Geneva 23 Switzerland Fed Inst Technol Lausanne Distributed Syst Lab CH-1015 Lausanne Switzerland

In this paper, we present a performance comparison of database replication techniques based on total order broadcast. While the performance of total order broadcast-based replication techniques has been studied in previous papers, this paper presents many new contributions. First, it compares with each other techniques that were presented and evaluated separately, usually by comparing them to a classical replication scheme like distributed locking. Second, the evaluation is done using a finer network model than previous studies. Third, the paper compares techniques that offer the same consistency criterion (one-copy serializability) in the same environment using the same settings. The paper shows that, while networking performance has little influence in a LAN setting, the cost of synchronizing replicas is quite high. Because of this, total order broadcast-based techniques are very promising as they minimize synchronization between replicas.

关键词： distributed databases performance attributes distributed programming

来源：评论

学校读者我要写书评

暂无评论

TARIS: Scalable Incremental Processing of Time-Respecting Algorithms on Streaming Graphs

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2024年第12期35卷 2527-2544页

作者： Bhoot, Ruchi Ghanmode, Suved Sanjay Simmhan, Yogesh Indian Inst Sci Bangalore 560012 India

Temporal graphs change with time and have a lifespan associated with each vertex and edge. These graphs are suitable to process time-respecting algorithms where the traversed edges must have monotonic timestamps. Interval-centric Computing Model (ICM) is a distributed programming abstraction to design such temporal algorithms. There has been little work on supporting time-respecting algorithms at large scales for streaming graphs, which are updated continuously at high rates (Millions/s), such as in financial and social networks. In this article, we extend the windowed-variant of ICM for incremental computing over streaming graph updates. We formalize the properties of temporal graph algorithms and prove that our model of incremental computing over streaming updates is equivalent to batch execution of ICM. We design TARIS, a novel distributed graph platform that implements these incremental computing features. We use efficient data structures to reduce memory access and enhance locality during graph updates. We also propose scheduling strategies to interleave updates with computing, and streaming strategies to adapt the execution window for incremental computing to the variable input rates. Our detailed and rigorous evaluation of temporal algorithms on large-scale graphs with up to 2B edges show that TARIS out-performs contemporary baselines, Tink and Gradoop, by 3-4 orders of magnitude, and handles a high input rate of 83k-587 M Mutations/s with latencies in the order of seconds-minutes.

关键词： Social networking (online) Heuristic algorithms Topology Computational modeling Network topology Data structures Clustering algorithms Space exploration Roads COVID-19 Discrete Mathematics distributed programming distributed systems general graph algorithms graph theory information storage and retrieval information technology and systems mathematics of computing numerical analysis programming techniques parallel algorithms systems and software software/software engineering

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTING CONCURRENT ADA PROGRAMS BY SOURCE TRANSLATION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1987年第12期17卷 859-884页

作者： BISHOP, JM ADAMS, SR PRITCHARD, DJ UNIV SOUTHAMPTON DEPT PHYSSOUTHAMPTON SO9 5NHHANTSENGLAND

This paper tackles the practical aspects of obtaining a distributed version of an Ada program. It proposes the use of an adapter, which can be a methodology or an automatic translator. The adapter accepts source of a concurrent Ada program, adds communication and control tasks, and produces source for a single distributed Ada program, which can then be compiled and run on a multi-processor computer. The original program can consist of packages and tasks, and both of these can be classed as virtual nodes. The process of adaption does not alter the contents of any package in the original program, so that the method is directly applicable to systems that make use of library and generic packages. The communication between virtual nodes, which would normally reside as one per processor, is via messages on a ring, but the protocols are kept as simple as possible, and the messages are fully checked Ada types, rather than byte strings. The method has been applied to programs of the client-server model, and could be adapted for other rendezvous-based languages such as occam.

关键词： distributed programming Multi-microprocessors Virtual nodes Concurrency Ada tasking Transputers

来源：评论

学校读者我要写书评

暂无评论

Grading and predicting networked application behaviour

引用

COMPUTING & CONTROL ENGINEERING JOURNAL 2000年第2期11卷 65-72页

作者： Oliver, MA Bharadia, KR Phillips, IW Parish, DJ Loughborough Univ Technol Dept Elect & Elect Engn Loughborough LE11 3TU Leics England

The user-perceived quality of an application operating over a communication network has a considerable influence on the usefulness of that application. Intuitively, it may be assumed that this quality will be related to current network performance, but in practice the relationship is often complex and difficult to determine. A scheme has been developed whereby the performance of network applications can be assessed and empirically graded for various controlled network loading conditions. Given the current network loading conditions on an operational network and information generated by the grading process, it is possible to pr-edict the performance of the network application before the application is actually run. This has the potential for reducing the amount of traffic forced on a network as a consequence of aborted connections.

关键词： user-perceived quality controlled network loading conditions communication network networked application behaviour grading telecommunication traffic software quality Software engineering techniques Network performance aborted connections operational network networked application behaviour prediction distributed systems software distributed programming network performance application usefulness software performance evaluation network traffic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：