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

Proceedings of the ISAT International Scientific School 2001年 214-220页

作者： Orzechowski, Tomasz Marcin Department of Telecommunications University of Mining and Metallurgy Cracow Poland

The main aim of this article is to present results of comparison efficiency for two different techniques that could be used in distributed programming such as: RMI and JavaIDL (implementation of CORBA standard). These techniques were chosen because they are both included and distributed with the most popular Sun JDK. My results could help in choosing the best technique for specific tasks in distributed programming.

关键词： CORBA distributed programming Efficiency tests JDK RMI

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Based Verification of Concatenative programming Patterns Inspired by Natural Language for Resource-Constrained Embedded Devices

引用

SENSORS 2021年第1期21卷 107-107页

作者： Gaglio, Salvatore Lo Re, Giuseppe Martorella, Gloria Peri, Daniele Univ Palermo Dept Engn Viale SciEd 6 I-90128 Palermo Italy CNR Natl Res Council Inst High Performance Comp & Networking ICAR Via Ugo La Malfa 153 I-90146 Palermo Italy

We propose a methodology to verify applications developed following programming patterns inspired by natural language that interact with physical environments and run on resource-constrained interconnected devices. Natural language patterns allow for the reduction of intermediate abstraction layers to map physical domain concepts into executable code avoiding the recourse to ontologies, which would need to be shared, kept up to date, and synchronized across a set of devices. Moreover, the computational paradigm we use for effective distributed execution of symbolic code on resource-constrained devices encourages the adoption of such patterns. The methodology is supported by a rule-based system that permits runtime verification of Software Under Test (SUT) on board the target devices through automated oracle and test case generation. Moreover, verification extends from syntactic and semantic checks to the evaluation of the effects of SUT execution on target hardware. Additionally, by exploiting rules tying sensors and actuators to physical quantities, the effects of code execution on the physical environment can be verified. The system is also able to build test code to highlight software issues that may arise during repeated SUT execution on the target hardware.

关键词： embedded systems wireless sensor networks internet of things symbolic programming distributed programming concatenative languages forth

来源：评论

学校读者我要写书评

暂无评论

A Subtyping Scheme for Nominal and Structural Types Based on Class Graph Equivalence 2021

A Subtyping Scheme for Nominal and Structural Types Based on...

引用

2021 4th International Conference on Blockchain Technology and Applications

作者： Wei Ke Ka-Hou Chan School of Applied Sciences Macao Polytechnic Institute Macao

ISBN: (纸本)9781450387460

Subtyping and multiple inheritance are the essential features of oo and component-based programming languages, in particular with the presence of interfaces and contracts. More general, the composability of these constructs admitting the subtype relation powers the reusability, modular, flexibility and reliability of oo-based systems. While nominal classes allow annotation of user intention to the types, operations on interfaces and contracts naturally result structural constructs. Structural types are also necessary if we need the types to have value-semantics, so that they can be transferred around in distributed systems. Building a type system that allows the coexistence of nominal and structural classes, while maintaining the usual subtype relation is critical and challenging. We present a subtyping scheme that encodes a class to a directed and edge-labeled graph, which has the convenience to handle recursive types. The names of a class and its superclasses are encoded as tags to label the edges of the graph, turning the nominal construct into a structural one. This encoding allows us to unify the handling of class relations into graph relations. We define the class representation, canonical form, value-identity and subtype relation in the notion of graphs, and justify our subtyping scheme in the cases of multiple inheritance, class intersection and union. Our scheme is general, easy to implement and compatible with most of the existing oo type systems, providing a solid base for further oo language and tool development.

关键词： nominal subtyping recursive type class graph type equivalence intersection type distributed programming structural subtyping union type object-oriented language subtyping multiple inheritance

来源：评论

学校读者我要写书评

暂无评论

Create distributed Application with Java RMI to Manipulate BLOBs

Create Distributed Application with Java RMI to Manipulate B...

引用

2004 International Symposium on distributed Computing and Applications to Business, Engineering and Science

作者： Wang Jingyang,Wang Jianxia,Zhang Xiaoming,Qin Min,Fu Dong College of Information Science & Engineering,Hebei University of Science and Technology Shijiazhuang Hebei 050054,China

This article introduces Java Remote Method Invocation(RMI) architecture,principle and the main steps of developing distributed Java programs with *** present a method of creating distributed programming with Java RMI based on JDBC(Java Database Connectivity) to manipulate BLOBs (Binary Large Objects) stored in database,illustrate the working principle and working process of the method,and provide an example manipulating BLOBs stored in Oracle's LONG RAW field.

关键词： Java RMI Manuscript distributed programming BLOBs JDBC

来源：评论

学校读者我要写书评

暂无评论

Dynamic rebinding for marshalling and update, with destruct-time ? 03

Dynamic rebinding for marshalling and update, with destruct-...

引用

Proceedings of the eighth ACM SIGPLAN international conference on Functional programming

作者： Gavin Bierman Michael Hicks Peter Sewell Gareth Stoyle Keith Wansbrough University of Cambridge University of Maryland College Park

ISBN: (纸本)9781581137569

Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises, for example when a marshalled value is received from the network, containing identifiers that must be rebound to local resources. Typically it is provided only by ad-hoc mechanisms that lack clean *** this paper we adopt a foundational approach, developing core dynamic rebinding mechanisms as extensions to simply-typed call-by-value ? -calculus. To do so we must first explore refinements of the call-by-value reduction strategy that delay instantiation, to ensure computations make use of the most recent versions of rebound definitions. We introduce redex-time and destruct-time strategies. The latter forms the basis for a ?marsh calculus that supports dynamic rebinding of marshalled values, while remaining as far as possible statically-typed. We sketch an extension of ? marsh with concurrency and communication, giving examples showing how wrappers for encapsulating untrusted code can be expressed. Finally, we show that a high-level semantics for dynamic updating can also be based on the destruct-time strategy, defining a ?marsh calculus with simple primitives to provide type-safe updating of running code. We thereby establish primitives and a common semantic foundation for a variety of real-world dynamic rebinding requirements.

关键词： dynamic binding programming languages dynamic update distributed programming marshalling serialisation lambda calculus

来源：评论

学校读者我要写书评

暂无评论

Tempo-toolkit: Tempo to Java Translation Module

Tempo-toolkit: Tempo to Java Translation Module

引用

IEEE International Symposium on Network Computing and Applications

作者： Chryssis Georgiou Peter M. Musial Christos Ploutarchou University of Cyprus MIT-CSAIL

ISBN: (纸本)9781479906055

TIOA is a formal language for modeling distributed, concurrent, and timed/untimed systems as collections of interacting state machines, called Timed Input/Output Automata. TIOA provide natural mathematical notations for describing systems, their intended properties, and the relationships between their descriptions at varying levels of abstraction. The Tempo toolkit is an implementation of the TIOA language and a suite of tools that supports a range of validation methods for description of systems and their properties, including static analysis, simulation, and machine-checked proofs. The tools are implemented as Eclipse plugins. In this paper we introduce a new plugin of the toolkit, the Tempo-to-Java compiler, which automatically translates high-level Tempo specification into executable Java code for various distributed platforms. The translation process is verified to preserve the formal properties of the source specification, hence leading to generated code which is correct by construction.

关键词： Design tools and techniques Automatic code generation distributed programming Verifiable translation

来源：评论

学校读者我要写书评

暂无评论

Parallel distributed productivity-aware tree-search using Chapel

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2023年第27期35卷

作者： Helbecque, Guillaume Gmys, Jan Melab, Nouredine Carneiro, Tiago Bouvry, Pascal Univ Lille Ctr Inria Univ Lille CNRS CRIStAL UMR 9189 Lille France Univ Luxembourg FSTM Luxembourg City Luxembourg Univ Luxembourg DCS FSTM SnT Luxembourg City Luxembourg

With the recent arrival of the exascale era, modern supercomputers are increasingly big making their programming much more complex. In addition to performance, software productivity is a major concern to choose a programming language, such as Chapel, designed for exascale computing. In this paper, we investigate the design of a parallel distributed tree-search algorithm, namely P3D-DFS, and its implementation using Chapel. The design is based on the Chapel's DistBag data structure, revisited by: (1) redefining the data structure for Depth-First tree-Search (DFS), henceforth renamed DistBag-DFS;(2) redesigning the underlying load balancing mechanism. In addition, we propose two instantiations of P3D-DFS considering the Branch-and-Bound (B & B) and Unbalanced Tree Search (UTS) algorithms. In order to evaluate how much performance is traded for productivity, we compare the Chapel-based implementations of B & B and UTS to their best-known counterparts based on traditional OpenMP (intra-node) and MPI+X (inter-node). For experimental validation using 4096 processing cores, we consider the permutation flow-shop scheduling problem for B & B and synthetic literature benchmarks for UTS. The reported results show that P3D-DFS competes with its OpenMP baselines for coarser-grained shared-memory scenarios, and with its MPI+X counterparts for distributed-memory settings, considering both performance and productivity-awareness. In the context of this work, this makes Chapel an alternative to OpenMP/MPI+X for exascale programming.

关键词： Branch-and-Bound Chapel distributed programming productivity-awareness unbalanced tree-search

来源：评论

学校读者我要写书评

暂无评论

Sharing incremental approaches for adding parallelism to CS curricula (abstract only) 12

Sharing incremental approaches for adding parallelism to CS ...

引用

Proceedings of the 43rd ACM technical symposium on Computer Science Education

作者： Richard A. Brown Elizabeth Shoop Joel C. Adams David P. Bunde Jens Mache Paul F. Steinberg Matthew Wolf Michael Wrinn St. Olaf College Northfield MN USA Macalester College St. Paul MN USA Calvin College Grand Rapids MI USA Knox College Galesburg IL USA Lewis & Clark College Portland OR USA Intel Corporation Portland OR USA Georgia Tech Atlanta GA USA

ISBN: (纸本)9781450310987

Recent industry changes, including multi-core processors, cloud computing, and GPU programming, increase the need to teach parallelism to CS undergraduates. But few CS programs can afford to add new courses or greatly alter syllabi, and the large parallelism body of knowledge relates to many courses. Participants in this BOF will share incremental approaches for adding parallelism to undergraduate CS curricula, where students study parallel computing in brief units. This networking event/ brainstorming session/ swap meet will bring together: " people with sharable parallelism expository readings, hands-on exercises, tech support ideas, etc.; "people wishing to include such materials in their courses; and" people curious about incremental approaches to teaching parallel computing.

关键词： map-reduce CS education accelerators education GPGPU distributed computing scalability curriculum. parallel programming distributed programming multicore data-intensive parallelism cloud computing beowulf clusters parallel computing

来源：评论

学校读者我要写书评

暂无评论

Thinking parallel: the process of learning concurrency 99

Thinking parallel: the process of learning concurrency

引用

Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education

作者： Mordechai Ben-Ari Yifat Ben-David Kolikant Department of Science Teaching Weizmann Institute of Science Rehovot 76100 Israel

ISBN: (纸本)9781581130874

This paper describes a course in concurrent and distributed computing for high school students and empirical research that was done to study students' conceptions and attitudes. We found that both their conceptions and their work methods evolved during course to the point that they were able to successfully develop algorithms and to prove their correctness. Students initially found the course extremely challenging but eventually came to appreciate its relevance and its contribution to improving their cognitive skills.

关键词： concurrency distributed programming mental models

来源：评论

学校读者我要写书评

暂无评论

Implementing distribution and persistence aspects with aspectJ 02

Implementing distribution and persistence aspects with aspec...

引用

Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

作者： Sergio Soares Eduardo Laureano Paulo Borba Federal University of Pernambuco Recife Pernambuco Brazil

ISBN: (纸本)9781581134711

This paper reports our experience using AspectJ, a general-purpose aspect-oriented extension to Java, to implement distribution and persistence aspects in a web-based information system. This system was originally implemented in Java and restructured with AspectJ. Our main contribution is to show that AspectJ is useful for implementing several persistence and distribution concerns in the application considered, and other similar applications. We have also identified a few drawbacks in the language and suggest some minor modifications that could significantly improve similar implementations. Despite the drawbacks, we argue that the AspectJ implementation is superior to the pure Java implementation. Some of the aspects implemented in our experiment are abstract and constitute a simple aspect framework. The other aspects are application specific but we suggest that different implementations might follow the same aspect pattern. The framework and the pattern allow us to propose architecture-specific guidelines that provide practical advice for both restructuring and implementing certain kinds of persistent and distributed applications with AspectJ.

关键词： aspectJ object persistence distributed programming aspect-oriented programming separation of concerns

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：