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

10th International Conference on Networked Systems (NETYS)

作者： Prosperi, Laurent Bouajjani, Ahmed Shapiro, Marc Sorbonne Univ CNRS Inria LIP6 Paris France Univ Paris Cite IRIF Paris France

ISBN: (纸本)9783031174360;9783031174353

A distributed system is made of interacting components. The current manual, ad-hoc approach to composing them cannot ensure that the composition is correct, and makes it difficult to control performance. The former issue requires reasoning over a high-level specification;the latter requires fine control over emergent run-time properties. To address this, we propose the Varda language (a work in progress) to formalize the architecture of a system, i.e., its components, their interface, and their orchestration logic. The Varda compiler checks the architecture description and emits glue code, which executes the orchestration logic and links to the components. The Varda system relies on a generic interception mechanism to act upon distribution-related system features in a transparent and uniform manner. Varda also takes into account important non-functional system properties, such as placement.

关键词： distributed programming Language distributed system Composition Orchestration Architecture

来源：评论

学校读者我要写书评

暂无评论

MASFENON: implementing a multi-agent simulation framework for interconnected networks with distributed programming

引用

Procedia Computer Science 2025年 255卷 73-82页

作者： Giorgio Locicero Antonio Di Maria Salvatore Alaimo Alfredo Pulvirenti Dept. of Physics and Astronomy Via Santa Sofia 64 Catania 95123 Italy Dept. of Clinical and Experimental Medicine c/o Dept. of Math and Comp. Science Via Santa Sofia 64 Catania 95123 Italy

The complexity of networked systems, particularly interconnected networks, necessitates advanced simulation frameworks to accurately emulate real-world dynamics, especially in the context of big data and high-performance computing. Most software used for simulation and temporal inference usually falls short in large data and optimization, since it is generally used in particular contexts, like simulating the dynamics of a specific group of entities, such as cellular and community interactions. We present ”Multi-Agent Adaptive Simulation Framework for Evolution in Networks of Networks” (MASFENON). MASFENON employs a temporal multi-layered approach to simulate and analyze dynamic processes in interconnected networks. The framework leverages parallel programming techniques for matrix and linear algebra operations and distributed and reactive programming for agent and environment communication, all implemented in C++ using the Message Passing Interface (MPI) standard. MASFENON has been validated against several common network models and could simulate the behavior of real systems in the context of epidemic simulations (See [ 4 ]). The framework demonstrates sublinear speedup and scalability with network size. The implementation is open source and available in a regularly updated GitHub repository1. MASFENON's integration of MPI and distributed programming techniques provides a powerful and versatile tool for modeling complex network interactions and dynamics. Its capabilities extend beyond traditional models, offering new insights and applications in network science.

关键词： Adaptive systems Multi-agent Temporal evolution distributed programming

来源：评论

学校读者我要写书评

暂无评论

distributed programming using Role-Parametric Session Types in Go

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2019年第POPL期3卷 1–30页

作者： Castro, David Hu, Raymond Jongmans, Sung-Shik Ng, Nicholas Yoshida, Nobuko Imperial Coll London Dept Comp London England Open Univ Netherlands Dept Comp Sci Heerlen Netherlands

This paper presents a framework for the static specification and safe programming of message passing protocols where the number and kinds of participants are dynamically instantiated. We develop the first theory of distributed multiparty session types (MPST) to support parameterised protocols with indexed roles-our framework statically infers the different kinds of participants induced by a protocol definition as role variants, and produces decoupled endpoint projections of the protocol onto each variant. This enables safe MPST-based programming of the parameterised endpoints in distributed settings: each endpoint can be implemented separately by different programmers, using different techniques (or languages). We prove the decidability of role variant inference and well-formedness checking, and the correctness of projection. We implement our theory as a toolchain for programming such role-parametric MPST protocols in Go. Our approach is to generate API families of lightweight, protocol- and variant-specific type wrappers for I/O. The APIs ensure a well-typed Go endpoint program (by native Go type checking) will perform only compliant I/O actions w.r.t. the source protocol. We leverage the abstractions of MPST to support the specification and implementation of Go applications involving multiple channels, possibly over mixed transports (e.g., Go channels, TCP), and channel passing via a unified programming interface. We evaluate the applicability and run-time performance of our generated APIs using microbenchmarks and real-world applications.

关键词： multiparty session types indexed roles distributed programming Go

来源：评论

学校读者我要写书评

暂无评论

Render Farm for Highly Realistic Images in a Beowulf Cluster using distributed programming Techniques

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2019年第11期10卷 407-411页

作者： Lee Huamani, Enrique Condori, Patricia Meneses-Claudio, Brian Roman-Gonzalez, Avid Univ Ciencias & Humanidades Image Proc Res Lab INTI Lab Lima Peru

Now-a-days, photorealistic images are demanded for the realization of scientific models, so we use rendering tools that convert three-dimensional models into highly realistic images. The problem of generating photorealistic images occurs when the three-dimensional model becomes larger and more complex, so the time to generate an image is much greater due to the limitations of hardware resources, about this problem is implemented the render farm, which consists in a set of computers interconnected by a high-speed network that provides a strip of the global image distributed in each participating computers with the intention of reducing the processing time of highly complex computational images. The research was implemented in a high-performance Beowulf group of the Universidad de Ciencias y Humanidades using a total of 18 computers. To demonstrate the efficiency of a rendering farm implementation, scalability tests were performed using a 360 degrees equirrectangular model with a total of 67 million pixels, the work is carried out to achieve highly complex renderings in less time to benefit the direction of the research.

关键词： distributed programming computational parallelism Beowulf cluster high-efficiency computing render farm

来源：评论

学校读者我要写书评

暂无评论

Characterizing Extracurricular Effort on Concurrent and distributed programming Learning 4

Characterizing Extracurricular Effort on Concurrent and Dist...

引用

4th Costa Rican Conference on Computing and Informatics Research (JoCICI)

作者： Hidalgo-Cespedes, Jeisson Univ Costa Rica ECCI CITIC San Jose Costa Rica

ISBN: (纸本)9781728147871

The importance of concurrent and distributed programming is increasing on Computer Science curricula. This exploratory research identifies additional notions required by the official topics of "Parallel and Concurrent programming" course, taught at the University of Costa Rica. This paper characterizes previous knowledge that students had about these notions and the extracurricular effort that they made to overcome the lack of notions. Findings show that students were able to overcome the lack of notions at expense of more extracurricular effort. Exploratory evidence indicates that students' election of professors in previous courses influenced their performance and extracurricular effort in the parallel programming course.

关键词： previous knowledge extracurricular effort course concurrent programming parallel programming distributed programming

来源：评论

学校读者我要写书评

暂无评论

Pardis: a process calculus for parallel and distributed programming in Haskell

引用

JOURNAL OF SUPERCOMPUTING 2018年第4期74卷 1473-1484页

作者： Bloecker, Christopher Hoffmann, Ulrich Univ Appl Sci FH Wedel Dept Comp Sci Wedel Germany

Parallel programming and distributed programming involve substantial amounts of boilerplate code for process management and data synchronisation. This leads to increased bug potential and often results in unintended non-deterministic program behaviour. Moreover, algorithmic details are mixed with technical details concerning parallelisation and distribution. Process calculi are formal models for parallel and distributed programming but often leave details open, causing a gap between formal model and implementation. We propose a fully deterministic process calculus for parallel and distributed programming and implement it as a domain-specific language in Haskell to address these problems. We eliminate boilerplate code by abstracting from the exact notion of parallelisation and encapsulating it in the implementation of our process combinators. Furthermore, we achieve correctness guarantees regarding process composition at compile time through Haskell's type system. Our result can be used as a high-level tool to implement parallel and distributed programs.

关键词： Process calculus Parallel programming distributed programming Domain-specific language Haskell

来源：评论

学校读者我要写书评

暂无评论

Characterizing Extracurricular Effort on Concurrent and distributed programming Learning

Characterizing Extracurricular Effort on Concurrent and Dist...

引用

Investigación en Computación e Informática (JoCICI), Jornadas Costarricenses de

作者： Jeisson Hidalgo-Céspedes ECCI-CITIC Universidad de Costa Rica San José Costa Rica

ISBN: (数字)9781728147871

ISBN: (纸本)9781728147888

关键词： previous knowledge extracurricular effort course concurrent programming parallel programming distributed programming Parallel programming distributed software Programmed Learning Costa Rica Students Teachers

来源：评论

学校读者我要写书评

暂无评论

A CAPable distributed programming Model

A CAPable Distributed Programming Model

引用

ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on programming and Software (Onward!)

作者： Myter, Florian Scholliers, Christophe De Meuter, Wolfgang Vrije Univ Brussel Brussels Belgium Univ Ghent Ghent Belgium

ISBN: (纸本)9781450360319

Developers of modern distributed systems continuously face the impossibility result proved by the CAP theorem. In a nutshell, the theorem states that a partition-tolerant system can either guarantee consistency or availability. Most distributed programming languages implicitly make the choice between consistency or availability in their designs and implementations. Concretely, distributed programming languages can be roughly divided into two categories. A first category of languages provide abstractions to implement the consistent parts of a distributed system. A second category of languages provide abstractions to implement the available parts of a distributed system. However, real-world distributed systems often require consistency for some parts while requiring availability for others. Programmers are therefore forced to implement the abstractions missing from their chosen distributed programming language themselves or rely on external libraries. In this paper we present a novel distributed programming model. This model introduces two object-oriented abstractions: consistents and availables. The former guarantees strong consistency by sacrificing availability. The latter guarantees availability, but only provides eventual consistency. Through these constructs programmers are able to implement the entirety of their distributed system within the same language. We present a prototypical implementation of the model as a TypeScript library called ***. To showcase the usefulness of our approach we implement a non-trivial example application. Moreover, we highlight both the functional as well as the performance characteristics of both language abstractions.

关键词： distributed programming CAP theorem data consistency

来源：评论

学校读者我要写书评

暂无评论

Pardis: A Process Calculus for Parallel and distributed programming in Haskell 12th

Pardis: A Process Calculus for Parallel and Distributed Prog...

引用

12th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Bloecker, Christopher Hoffmann, Ulrich Univ Appl Sci FH Wedel Dept Comp Sci Wedel Germany

ISBN: (纸本)9783319780542;9783319780535

Parallel and distributed programming involve substantial amounts of boilerplate code for process management and data synchronisation. This leads to increased bug potential and often results in unintended non-deterministic program behaviour. Moreover, algorithmic details are mixed with technical details concerning parallelisation and distribution. Process calculi are formal models for parallel and distributed programming but often leave details open, causing a gap between formal model and implementation. We propose a fully deterministic process calculus for parallel and distributed programming and implement it as a domain specific language in Haskell to address these problems. We eliminate boilerplate code by abstracting from the exact notion of parallelisation and encapsulating it in the implementation of our process combinators. Furthermore, we achieve correctness guarantees regarding process composition at compile time through Haskell's type system. Our result can be used as a high-level tool to implement parallel and distributed programs.

关键词： Process calculus Parallel programming distributed programming Domain specific language Haskell

来源：评论

学校读者我要写书评

暂无评论

Singly typed actors in Agda: An approach to distributed programming with dependent types

Singly typed actors in Agda: An approach to distributed prog...

引用

作者： PIERRE KRAFT CHALMERS UNIVERSITY OF TECHNOLOGY

学位级别：硕士

By requiring communication to take place using explicit message passing, the actor model has been shown to be an effective tool for building distributed systems. However, communication in the actor model has traditionally been untyped, i. e. any message can be sent to an actor, even though it most probably only handles specific ones. Singly typed actors have a single static type assigned to each actor, limiting messages to those that can be handled by the actor. We present M act, a formal model of singly typed actors, implemented as a shallow embedding in Agda. The shallow embedding allows for a minimal calculus that does not sacrifice usability, since programs are expressed using the full power of Agda- a deep embedding would not have allowed for the same experimental investigation without significantly more effort. We use this advantage to demonstrate how several common communication patterns can be expressed as abstractions inside the model. We implement and compare implementation strategies for out of order communication-the foundation of the abstractions we build. With out of order communication we are able to emulate local channels, which we use to implement synchronous calls and active objects. Like He (2014), we find that subtyping solves the problem of wide actor types when sending messages. However, the use of a single inbox per actor remains problematic when receiving messages, especially in the context of call-response patterns. Our emulation of local channels alleviates the problem of wide actor types, but we still propose extending the model with native support for multiple inboxes per actor as a better solution.

关键词： distributed programming Actors Dependent types Agda Selective receive

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：