57,264 Hits in 4.8 sec

Multi-Variant Execution at the Edge [article]

Javier Cabrera Arteaga, Pierre Laperdrix, Martin Monperrus, Benoit Baudry
2022 arXiv   pre-print
a safe execution at the edge.  ...  Given a service tobe deployed at the edge, we automatically synthesize functionally equivalent variants for the functions that implement the service.All the variants are then wrapped into a single multivariant  ...  The traces are collected from all edge nodes in order to assess MVE at a worldwide scale. RQ4: What is the impact of the proposed multi-version execution on timing side-channels?  ... 
arXiv:2108.08125v2 fatcat:nxpqvpfklzg4rmtjiegjomfhi4

Multischedule Synthesis for Variant Management in Automotive Time-Triggered Systems

Florian Sagstetter, Peter Waszecki, Sebastian Steinhorst, Martin Lukasiewycz, Samarjit Chakraborty
2016 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
We propose a multi-schedule synthesis approach that determines the common parts of multiple variants and generates a schedule that exploits this commonality.  ...  Hence, a multi-schedule defines individual variant schedules with an identical schedule for applications common to different variants.  ...  Constraint (11) ensures that two processes in the same variant specification are not executed at the same point in time if both are mapped to the same resource, and therefore finish execution before  ... 
doi:10.1109/tcad.2015.2488480 fatcat:6o272rwdlzh6xe45n2hggcqgiq

Discovering Hierarchical Consolidated Models from Process Families [chapter]

Nour Assy, Boudewijn F. van Dongen, Wil M. P. van der Aalst
2017 Lecture Notes in Computer Science  
The causal graphs are merged into a multi-causal graph. Edges in the multi causal graph have different identities according to the causal graph from which they originate.  ...  For instance, given F 2 in Fig. 3 , we would like to see that the variants of both L 1 and L 3 start with executing c and d; both execute the fragment represented by e and h and end with the execution  ... 
doi:10.1007/978-3-319-59536-8_20 fatcat:2virbfjm6beyxnxlaqvjuj2tfy

A Generic and Highly Efficient Parallel Variant of Boruvka's Algorithm

Cristiano da Silva Sousa, Artur Mariano, Alberto Proenca
2015 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing  
The core of our variant is an effective and explicit contraction of the graph.  ...  Our multi-core CPU implementation scales linearly up to 8 threads, whereas the GPU implementation performs considerably better than the optimal number of threads running on the CPU.  ...  Cong for providing the implementation shown in [11] , and R. Nasre and F. Correia for insightful discussions.  ... 
doi:10.1109/pdp.2015.72 dblp:conf/pdp/SousaMP15 fatcat:d7ui5esqrvfibi2comgq7chbae

Extending single- to multi-variant model transformations by trace-based propagation of variability annotations

Bernhard Westfechtel, Sandra Greiner
2020 Journal of Software and Systems Modeling  
Single-variant transformations are extended into multi-variant transformations by trace-based propagation: after executing a single-variant transformation, the resulting single-variant target model is  ...  Furthermore, we assume that single-variant transformations create traces, which comprise the steps executed in order to derive target models from source models.  ...  The authors greatly appreciate the constructive comments of the unknown reviewers.  ... 
doi:10.1007/s10270-020-00791-9 fatcat:bza6uc7vbnetjnmmjamcdr7lwe

Automatic algorithm transformation for efficient multi-snapshot analytics on temporal graphs

Manuel Then, Timo Kersten, Stephan Günnemann, Alfons Kemper, Thomas Neumann
2017 Proceedings of the VLDB Endowment  
Our measurements show that in multi-snapshot analyses, SAMS offers runtime improvements of up to two orders of magnitude over traditional snapshot-at-a-time execution.  ...  The automatic transformation interleaves algorithm executions on multiple snapshots, synergistically shares their graph accesses and traversals, and optimizes the algorithm's data layout.  ...  dashed vertex v2 and edge b are added at t2.  ... 
doi:10.14778/3090163.3090166 fatcat:oegznfd75va2pjad4dfedmbpxa

A Rich-Variant Architecture for a User-Aware multi-tenant SaaS approach [article]

Houda Kriouile, Bouchra El Asri
2018 Zenodo   pre-print
The present paper present the architecture of our user-aware multi-tenancy SaaS approach based on the use of rich-variant components.  ...  execution framework.  ...  It is sought to realize a multi-rental application optimized for the operator and the tenant at the same time.  ... 
doi:10.5281/zenodo.1346047 arXiv:1812.08253v1 fatcat:rvlqfvaxj5cmjeqtjhjuwiidlq

Program integration for languages with procedure calls

David Binkley, Susan Horwitz, Thomas Reps
1995 ACM Transactions on Software Engineering and Methodology  
Bricker for their role in the implementation of Integrate S as part of the Wisconsin Program Integration System.  ...  In addition, we wish to acknowledge Genevieve Rosay for devising the Type III interference test, which replaces a related, but more complicated test presented in [2] .  ...  Consequently, meeting-point vertices and edges are added to the SDG for variant A at both call-sites on P.  ... 
doi:10.1145/201055.201056 fatcat:q6ivgumlnrfyndefrkntdj6s3e

Dealing with Hardware Faults in Energy-Efficient Static Schedules of Multi-Variant Programs on Heterogeneous Platforms

Christoph Kessler, Jörg Keller
2019 Zenodo  
We investigate the energy-efficient execution of programs with a sequence of program parts, each part executable by multiple variants on different execution units.  ...  or more program variants cannot be used anymore from some execution point on, due to failure of the underlying execution unit(s).  ...  While, in principle, several variants could use the same execution resource, we assume in the following that each task has at most one variant for each execution resource, where variant 0 runs on the master  ... 
doi:10.5281/zenodo.3716286 fatcat:uh73m7ufbbfthgpdgi7inemdpi

Discovering process models through relational disjunctive patterns mining

Corrado Loglisci, Michelangelo Ceci, Annalisa Appice, Donato Malerba
2011 2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)  
the process executions.  ...  The effectiveness of using relational patterns with disjunctions to describe process models with variants is assessed on real logs of process executions.  ...  ACKNOWLEDGMENT This work is in partial fulfillment of the research objectives of the FAR project "DM19410: Laboratorio di Bioinformatica per la Biodiversità Molecolare" funded by the MIUR.  ... 
doi:10.1109/cidm.2011.5949299 dblp:conf/cidm/LoglisciCAM11 fatcat:3bj6plfcfjgidicjnhovhcdz2y

Scheduling of Graph Queries: Controlling Intra- and Inter-query Parallelism for a High System Throughput [article]

Matthias Hauck
2021 arXiv   pre-print
Typical applications utilizing such data either execute one or a few complex queries or many small queries at the same time interactively or as batch jobs.  ...  of vertices and edges, respectively.  ...  For multi-query execution we showed that the system is able to efficiently handle multiple queries at the same time.  ... 
arXiv:2110.10797v1 fatcat:nhsvflt7j5elvallxsrinzww34

Solution to Travelling Salesman Problem by Nature Inspired Algorithm

Sarita Rai, Rajkumar Sharma
2015 International Journal of Computer Applications  
All the implementations are compared in terms of communication overhead and execution time.  ...  It is found that multi colony based approach in which all colonies are independent is most efficient in terms of communication overhead and execution time.  ...  There are many variants of ACO discussed in this paper and multi colony and single colony approaches exists in every variant. We have applied max min ant system on TSP.  ... 
doi:10.5120/ijca2015905818 fatcat:dtcgw4thizaunncle4hco4xm7a

GRapid: A compilation and runtime framework for rapid prototyping of graph applications on many-core processors

Da Li, Srimat Chakradhar, Michela Becchi
2014 2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)  
code variants for the target platform.  ...  Many-core devices offer higher peak performance than multi-core devices; however, many-core programming is still a specialized skill.  ...  ., edge-oriented storage), graph-aware buffer schemes and multi-GPU execution. These mechanisms, however, can be incorporated in our framework.  ... 
doi:10.1109/padsw.2014.7097806 dblp:conf/icpads/LiCB14 fatcat:getyhmefjfdlzbfsy4uawh46au

A Multi-objective Version of the Lin-Kernighan Heuristic for the Traveling Salesman Problem

Emerson Bezerra De Carvalho, Elizabeth Ferreira Gouvêa Goldbarg, Marco Cesar Goldbarg
2018 Revista de Informática Teórica e Aplicada  
The results showed that the proposed algorithmic variants obtained better results than a state-of-the-art algorithm.  ...  Although many algorithms for the TSP were extended to the multi-objective version of the problem (MTSP), the Lin and Kernighan's algorithm was still not fully explored.  ...  Acknowledgements The research reported in this paper was partially supported by CAPES, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, and CNPq, Conselho Nacional de Desenvolvimento Científico  ... 
doi:10.22456/2175-2745.76452 fatcat:lnkaaax5lra6vjiab3ehqeds5m


A. B. Borisenko, M. Haidl, S. Gorlatch
2015 Vestnik Tambovskogo gosudarstvennogo tehnicheskogo universiteta  
The developed implementation is used for solving a real-world problem -the optimal selection of the chemical equipment for multi-product batch plants.  ...  We report experimental results about the speedup of our GPU-based implementations as compared to the sequential CPU version.  ...  Each level of the tree corresponds to one processing stage of the CES, each edge corresponds to a selected equipment variant taken from set , i X where i X is the set of possible variants at stage i of  ... 
doi:10.17277/vestnik.2015.03.pp.406-412 fatcat:27hitl4aavdrdh6njuskl5v764
« Previous Showing results 1 — 15 out of 57,264 results