Making the Distribution Subsystem Secure

This report presents how the Distribution Subsystem is made secure. A set of different security threats to a shared data programming system are identifed. The report presents the extensions nessesary to the DSS in order to cope with the identified security threats by maintaining reference security. A reference to a shared data structure cannot be forged or guessed; only by proper delegation can a thread acquire access to data originating at remote processes. Referential security is a requirement for secure distributed applications. By programmatically restricting access to distributed data to trusted nodes, a distributed application can be made secure. However, for this to be true, referential security must be supported on the level of the implementation

Evaluation of different Distributed Garbage Collection Algorithms in the Mozart

Language b

A Generic Middleware for Intra-Language Transparent Distribution

This document presents the philosophy and design of our language independent middleware, the Distribution Subsystem(DSS). A notion of abstract entity types enables the DSS to offer distribution support for virtually any high level programming language. A novel framework for entity consistency protocols is presented. The framework greatly simplifies the development of new protocols, indicated by the numerous protocols provided by the DSS implementation. A roadmap of how to couple a programming system to the DSS is also give

The design and evaluation of a middleware library for distribution of language entities

The paper presents a modular design of a distribution middleware that supports the wide variety of entities that exist in high level languages. Such entities are classified into mutables, immutables and transients. The design is factorized in order to allow multiple consistency protocols for the same entity type, and multiple coordination strategies for implementing the protocols that differ in their failure behavior. The design is implemented and evaluated. It shows a very competitive performance

Distance vs. Improvement based parameter adaptation in SHADE

This work studied a relationship between optimization qualities of Success-History based Adaptive Differential Evolution algorithm (SHADE) and its self-adaptive parameter strategy. Original SHADE with improvement based adaptation is compared to the SHADE with Distance based parameter adaptation (Db_SHADE) on the basis of the CEC2015 benchmark set for continuous optimization and a novel approach combining both distance and improvement adaptation (DIb_SHADE) is presented and tested as a trade-off between both approaches. © 2019, Springer International Publishing AG, part of Springer Nature.IC1406, COST, European Cooperation in Science and Technology; CA15140, COST, European Cooperation in Science and Technology; IGA/CebiaTech/2018/003; MSMT-7778/2014, MŠMT, Ministerstvo Školství, Mládeže a Tělovýchovy; LO1303, MŠMT, Ministerstvo Školství, Mládeže a Tělovýchovy; COST, European Cooperation in Science and Technology; CZ.1.05/2.1.00/03.0089, FEDER, European Regional Development FundMinistry of Education, Youth and Sports of the Czech Republic [LO1303 (MSMT-7778/2014)]; European Regional Development Fund under the Project CEBIA-Tech [CZ.1.05/2.1.00/03.0089]; Internal Grant Agency of Tomas Bata University [IGA/CebiaTech/2018/003]; COST (European Cooperation in Science Technology) [CA15140, IC1406]; A.I. Lab at the Faculty of Applied Informatics, Tomas Bata University in Zli