https://www.mdu.se/

mdu.sePublications
Change search
Link to record
Permanent link

Direct link
Publications (10 of 56) Show all publications
Seceleanu, T., Xiong, N., Enoiu, E. P. & Seceleanu, C. (2024). Building a Digital Twin Framework for Dynamic and Robust Distributed Systems. In: Lect. Notes Comput. Sci.: . Paper presented at 8th International Conference on Engineering of Computer-Based Systems, ECBS 2023, Västerås, 16 October 2023 through 18 October 2023 (pp. 254-258). Springer Science and Business Media Deutschland GmbH
Open this publication in new window or tab >>Building a Digital Twin Framework for Dynamic and Robust Distributed Systems
2024 (English)In: Lect. Notes Comput. Sci., Springer Science and Business Media Deutschland GmbH , 2024, p. 254-258Conference paper, Published paper (Refereed)
Abstract [en]

Digital Twins (DTs) serve as the backbone of Industry 4.0, offering virtual representations of actual systems, enabling accurate simulations, analysis, and control. These representations help in predicting system behaviour, facilitating multiple real-time tests, and reducing risks and costs while identifying optimization areas. DTs meld cyber and physical realms, accelerating the design and modelling of sustainable innovations. Despite their potential, the complexity of DTs presents challenges in their industrial application. We sketch here an approach to build an adaptable and trustable framework for building and operating DT systems, which is the basis for the academia-industry project A Digital Twin Framework for Dynamic and Robust Distributed Systems (D-RODS). D-RODS aims to address the challenges above, aiming to advance industrial digitalization and targeting areas like system efficiency, incorporating AI and verification techniques with formal support. 

Place, publisher, year, edition, pages
Springer Science and Business Media Deutschland GmbH, 2024
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 14390 LNCS
Keywords
AI, digital twins, industrial automation, resource utilization, verification and validation, Actual system, Analysis and controls, Distributed systems, Resources utilizations, Simulation analysis, Simulation control, System behaviors, Verification-and-validation, Virtual representations, Artificial intelligence
National Category
Computer Sciences
Identifiers
urn:nbn:se:mdh:diva-65247 (URN)10.1007/978-3-031-49252-5_22 (DOI)2-s2.0-85180149728 (Scopus ID)9783031492518 (ISBN)
Conference
8th International Conference on Engineering of Computer-Based Systems, ECBS 2023, Västerås, 16 October 2023 through 18 October 2023
Available from: 2024-01-03 Created: 2024-01-03 Last updated: 2024-01-03Bibliographically approved
Sprang, F. & Seceleanu, T. (2024). FPGA-Based Encryption for Peer-to-Peer Industrial Network Links. In: Lecture Notes in Computer Science: . Paper presented at 8th International Conference on Engineering of Computer-Based Systems, ECBS 2023, Västerås 16 October 2023 through 18 October 2023 (pp. 97-114). Springer Science and Business Media Deutschland GmbH
Open this publication in new window or tab >>FPGA-Based Encryption for Peer-to-Peer Industrial Network Links
2024 (English)In: Lecture Notes in Computer Science, Springer Science and Business Media Deutschland GmbH , 2024, p. 97-114Conference paper, Published paper (Refereed)
Abstract [en]

Securing company networks has become a critical aspect of modern industrial environments. With the recent rise of Industry 4.0 concepts, it became essential to extend IT security across increasingly connected factories. However, in the highly specialised field of operations technology and embedded systems, not every device can run additional security measures, as they are old or designed with sparse resources. We introduce here the concept of a “universal” encryption device that enables the securing of communication links in a direct peer-to-peer industrial setting by using the AES-128 encryption standard. We propose a design of such an encryption device by developing a modular system architecture with decoupled communication and cryptography. The resulting architecture is implemented as a proof of concept for Ethernet communication and tested through simulation as well as on an FPGA device. The impact of the encryption device is briefly investigated in a lab setup, followed by conclusions on system stability and performance.

Place, publisher, year, edition, pages
Springer Science and Business Media Deutschland GmbH, 2024
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 14390 LNCS
Keywords
AES-128, encryption, FPGA, industrial communication, Cryptography, Embedded systems, Network architecture, Peer to peer networks, Security of data, System stability, Company network, Encryption devices, Industrial communications, Industrial environments, Industrial networks, IT security, Network links, Peer to peer, Technology system, Field programmable gate arrays (FPGA)
National Category
Computer Sciences
Identifiers
urn:nbn:se:mdh:diva-65248 (URN)10.1007/978-3-031-49252-5_9 (DOI)2-s2.0-85180147922 (Scopus ID)9783031492518 (ISBN)
Conference
8th International Conference on Engineering of Computer-Based Systems, ECBS 2023, Västerås 16 October 2023 through 18 October 2023
Available from: 2024-01-03 Created: 2024-01-03 Last updated: 2024-01-03Bibliographically approved
Halilovic, A., Zaimovic, N., Seceleanu, T. & Feyzmahdavian, H. (2023). Multi-constrained Network Occupancy Optimization. Computer Science and Information Systems, 29(1), 251-276
Open this publication in new window or tab >>Multi-constrained Network Occupancy Optimization
2023 (English)In: Computer Science and Information Systems, ISSN 1820-0214, Vol. 29, no 1, p. 251-276Article in journal (Refereed) Published
Abstract [en]

The greater the number of devices on a network, the higher load in the network, the more chance of a collision occurring, and the longer it takes to transmit a message. The size of load can be identified by measuring the network occupancy, hence it is desirable to minimize the latter. In this paper, we present an approach for network occupancy minimization by optimizing the packing process while satisfy-ing multiple constraints. We formulate the minimization problem as a bin packing problem and we implement a modification of the Best-Fit Decreasing algorithm to find the optimal solution. The approach considers grouping signals that are sent to different destinations in the same package. The analysis is done on a medium-sized plant model, and different topologies are tested. The results show that the proposed solution lowers the network occupancy compared to a reference case. 

Place, publisher, year, edition, pages
ComSIS Consortium, 2023
Keywords
industrial control networking, network performance, packing algorithms
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:mdh:diva-62096 (URN)10.2298/CSIS211001008H (DOI)000935481500017 ()2-s2.0-85149101919 (Scopus ID)
Available from: 2023-03-15 Created: 2023-03-15 Last updated: 2023-03-22Bibliographically approved
Makila, A., Friebe, A., Enblom, L., Strandberg, P. E. & Seceleanu, T. (2022). A Generic Software Architecture for PoE Power Sourcing Equipment. In: Proceedings - 2022 IEEE 46th Annual Computers, Software, and Applications Conference, COMPSAC 2022: . Paper presented at 46th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2022, Virtual Online, 27 June 2022 through 1 July 2022 (pp. 1375-1380). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>A Generic Software Architecture for PoE Power Sourcing Equipment
Show others...
2022 (English)In: Proceedings - 2022 IEEE 46th Annual Computers, Software, and Applications Conference, COMPSAC 2022, Institute of Electrical and Electronics Engineers Inc. , 2022, p. 1375-1380Conference paper, Published paper (Refereed)
Abstract [en]

Many hardware solutions for Power over Ethernet (PoE) Power Sourcing Equipment (PSE) exist, with slightly varying feature sets. A software solution is needed for interaction with the PSEs, and for managing a power budget across several PSEs. A generic interface is desirable, as well as generic software components that can be used in support of several PSE solutions. In this paper we present a union of features and real-time requirements for three hardware solutions, and the development of a generic software architecture.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2022
Keywords
power over Ethernet, real-time requirements, software architecture, Budget control, Ethernet, Features sets, Generic interfaces, Generic softwares, Hardware solutions, Power budgets, Power over ethernets, Power-sourcing equipments, Real time requirement, Software solution, Software-component
National Category
Computer Systems
Identifiers
urn:nbn:se:mdh:diva-59944 (URN)10.1109/COMPSAC54236.2022.00217 (DOI)000855983300209 ()2-s2.0-85136916988 (Scopus ID)9781665488105 (ISBN)
Conference
46th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2022, Virtual Online, 27 June 2022 through 1 July 2022
Available from: 2022-09-14 Created: 2022-09-14 Last updated: 2022-11-08Bibliographically approved
Danielsson, J., Seceleanu, T., Marcus, J., Behnam, M. & Sjödin, M. (2021). Automatic Quality of Service Control in Multi-core Systems using Cache Partitioning. In: : . Paper presented at Emerging Technologies and Factory Automation (ETFA), 2021. Västerås: Institute of Electrical and Electronics Engineers (IEEE)
Open this publication in new window or tab >>Automatic Quality of Service Control in Multi-core Systems using Cache Partitioning
Show others...
2021 (English)Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we present a last-level cache partitioning controller for multi-core systems. Our objective is to control the Quality of Service (QoS) of applications in multi-core systems by monitoring run-time performance and continuously re-sizing cache partition sizes according to the applications' needs. We discuss two different use-cases; one that promotes application fairness and another one that prioritizes applications according to the system engineers' desired execution behavior. We display the performance drawbacks of maintaining a fair schedule for all system tasks and its performance implications for system applications. We, therefore, implement a second control algorithm that enforces cache partition assignments according to user-defined priorities rather than system fairness. Our experiments reveal that it is possible, with non-instrusive (0.3-0.7\% CPU utilization) cache controlling measures, to increase performance according to setpoints and maintain the QoS for specific applications in an over-saturated system.

Place, publisher, year, edition, pages
Västerås: Institute of Electrical and Electronics Engineers (IEEE), 2021
National Category
Computer Sciences
Identifiers
urn:nbn:se:mdh:diva-56070 (URN)10.1109/ETFA45728.2021.9613641 (DOI)000766992600219 ()2-s2.0-85122957047 (Scopus ID)9781728129891 (ISBN)
Conference
Emerging Technologies and Factory Automation (ETFA), 2021
Available from: 2021-10-01 Created: 2021-10-01 Last updated: 2022-06-07Bibliographically approved
Seceleanu, T., Xiong, N. & Seceleanu, C. (2021). Control as a service - Intelligent networking. In: Proceedings - 2021 IEEE 45th Annual Computers, Software, and Applications Conference, COMPSAC 2021: . Paper presented at 45th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2021, 12 July 2021 through 16 July 2021 (pp. 1887-1892). Institute of Electrical and Electronics Engineers Inc.
Open this publication in new window or tab >>Control as a service - Intelligent networking
2021 (English)In: Proceedings - 2021 IEEE 45th Annual Computers, Software, and Applications Conference, COMPSAC 2021, Institute of Electrical and Electronics Engineers Inc. , 2021, p. 1887-1892Conference paper, Published paper (Refereed)
Abstract [en]

The paper introduces elements of a service based perspective of a scalable and dynamic automation system architecture. The approach is based on potentially multi-role devices (implementing node management, processing and networking functionalities) hosting a set of services requested by input nodes. In addition, artificial intelligence support is described to provide means of reaching deployment optimality and reliability. Formal approaches are deemed necessary for both verification of the artificial intelligence approach and of the resulting solutions. A model-based design path is complementary considered in order to lead to an increased efficiency in resource utilization, to lowering design efforts, and ensure a formally correct allocation of services, according to system requirements and constraints.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2021
Keywords
Dynamic systems, Networked automation systems, Service oriented architectures, Application programs, Automation, Intelligent networks, Automation systems, Design effort, Formal approach, Intelligent networking, Model- based designs, Node management, Resource utilizations, System requirements, Artificial intelligence
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:mdh:diva-56129 (URN)10.1109/COMPSAC51774.2021.00285 (DOI)000706529000274 ()2-s2.0-85115884209 (Scopus ID)9781665424639 (ISBN)
Conference
45th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2021, 12 July 2021 through 16 July 2021
Available from: 2021-10-07 Created: 2021-10-07 Last updated: 2021-11-11Bibliographically approved
Danielsson, J., Seceleanu, T., Marcus, J., Behnam, M. & Sjödin, M. (2021). LLM-shark -- A Tool for Automatic Resource-boundness Analysis and Cache Partitioning Setup. In: 45th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2021: . Paper presented at COMPSAC 2021 (pp. 49-58).
Open this publication in new window or tab >>LLM-shark -- A Tool for Automatic Resource-boundness Analysis and Cache Partitioning Setup
Show others...
2021 (English)In: 45th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2021, 2021, p. 49-58Conference paper, Published paper (Refereed)
Abstract [en]

We present LLM-shark, a tool for automatic hardware resource-boundness detection and cache-partitioning. Our tool has three primary objectives: First, it determines the hardware resource-boundness of a given application. Secondly, it estimates the initial cache partition size to ensure that the application performance is conserved and not affected by other processes competing for cache utilization. Thirdly, it continuously monitors that the application performance is maintained over time and, if necessary, change the cache partition size. We demonstrate LLM-shark's functionality through a series of tests using six different applications, including a set of feature detection algorithms and two synthetic applications. Our tests reveal that it is possible to determine an application's resource-boundness using a Pearson-correlation scheme implemented in LLM-shark. We propose a scheme to size cache partitions based on the correlation coefficient applications depending on their resource boundness.

National Category
Computer Sciences
Identifiers
urn:nbn:se:mdh:diva-56074 (URN)10.1109/COMPSAC51774.2021.00019 (DOI)000706529000008 ()2-s2.0-85115835802 (Scopus ID)978-1-6654-2463-9 (ISBN)
Conference
COMPSAC 2021
Available from: 2021-10-01 Created: 2021-10-01 Last updated: 2021-11-11Bibliographically approved
Danielsson, J., Janne, S., Marcus, J., Seceleanu, T., Behnam, M. & Sjödin, M. (2021). Modelling Application Cache Behavior using Regression Models. In: IEEE (Ed.), : . Paper presented at The 11th IEEE International Workshop on Industrial Experience in Embedded Systems Design (IEESD 2021). Västerås
Open this publication in new window or tab >>Modelling Application Cache Behavior using Regression Models
Show others...
2021 (English)In: / [ed] IEEE, Västerås, 2021Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we describe the creation of resource usage forecasts for applications with unknown execution characteristics, by evaluating different regression processes, including autoregressive, multivariate adaptive regression splines, exponential smoothing, etc. We utilize Performance Monitor Units (PMU) and generate hardware resource usage models for the L-2-cache and the L-3-cache using nine different regression processes. The measurement strategy and regression process methodology are general and applicable to any given hardware resource when performance counters are available. We use three benchmark applications: the SIFT feature detection algorithm, a standard matrix multiplication, and a version of Bubblesort. Our evaluation shows that Multi Adaptive Regressive Spline (MARS) models generate the best resource usage forecasts among the considered models, followed by Single Exponential Splines (SES) and Triple Exponential Splines (TES).

Place, publisher, year, edition, pages
Västerås: , 2021
National Category
Computer Sciences
Identifiers
urn:nbn:se:mdh:diva-56073 (URN)10.1109/COMPSAC51774.2021.00284 (DOI)000706529000273 ()2-s2.0-85115859046 (Scopus ID)978-1-6654-2463-9 (ISBN)
Conference
The 11th IEEE International Workshop on Industrial Experience in Embedded Systems Design (IEESD 2021)
Available from: 2021-10-01 Created: 2021-10-01 Last updated: 2021-11-11Bibliographically approved
Salimi, M., Majd, A., Loni, M., Seceleanu, T., Seceleanu, C., Sirjani, M., . . . Troubitsyna, E. (2020). Multi-objective optimization of real-time task scheduling problem for distributed environments. In: PROCEEDINGS OF THE 6TH CONFERENCE ON THE ENGINEERING OF COMPUTER BASED SYSTEMS (ECBS 2019): . Paper presented at 6th Conference on the Engineering of Computer-Based Systems, ECBS 2019, 2 September 2019 through 3 September 2019. Association for Computing Machinery, Article ID a13.
Open this publication in new window or tab >>Multi-objective optimization of real-time task scheduling problem for distributed environments
Show others...
2020 (English)In: PROCEEDINGS OF THE 6TH CONFERENCE ON THE ENGINEERING OF COMPUTER BASED SYSTEMS (ECBS 2019), Association for Computing Machinery , 2020, article id a13Conference paper, Published paper (Refereed)
Abstract [en]

Real-world applications are composed of multiple tasks which usually have intricate data dependencies. To exploit distributed processing platforms, task allocation and scheduling, that is assigning tasks to processing units and ordering inter-processing unit data transfers, plays a vital role. However, optimally scheduling tasks on processing units and finding an optimized network topology is an NP-complete problem. The problem becomes more complicated when the tasks have real-time deadlines for termination. Exploring the whole search space in order to find the optimal solution is not feasible in a reasonable amount of time, therefore meta-heuristics are often used to find a near-optimal solution. We propose here a multi-population evolutionary approach for near-optimal scheduling optimization, that guarantees end-to-end deadlines of tasks in distributed processing environments. We analyze two different exploration scenarios including single and multi-objective exploration. The main goal of the single objective exploration algorithm is to achieve the minimal number of processing units for all the tasks, whereas a multi-objective optimization tries to optimize two conflicting objectives simultaneously considering the total number of processing units and end-to-end finishing time for all the jobs. The potential of the proposed approach is demonstrated by experiments based on a use case for mapping a number of jobs covering industrial automation systems, where each of the jobs consists of a number of tasks in a distributed environment.

Place, publisher, year, edition, pages
Association for Computing Machinery, 2020
Keywords
Distributed Task Scheduling, Evolutionary Computing, Multi-Objective Optimization, Real-Time Processing, Automation, Computational complexity, Data handling, Data transfer, Finishing, Image coding, Job shop scheduling, Multitasking, Optimal systems, Scheduling, Scheduling algorithms, Conflicting objectives, Distributed environments, Distributed processing, Distributed tasks, Industrial automation system, Realtime processing, Task allocation and scheduling, Multiobjective optimization
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:mdh:diva-46527 (URN)10.1145/3352700.3352713 (DOI)000525376600013 ()2-s2.0-85075887884 (Scopus ID)9781450376365 (ISBN)
Conference
6th Conference on the Engineering of Computer-Based Systems, ECBS 2019, 2 September 2019 through 3 September 2019
Available from: 2019-12-17 Created: 2019-12-17 Last updated: 2022-11-08Bibliographically approved
Danielsson, J., Seceleanu, T., Marcus, J., Behnam, M. & Nolin, M. (2020). Resource Depedency Analysis in Multi-Core Systems. In: Proceedings - 2020 IEEE 44th Annual Computers, Software, and Applications Conference, COMPSAC 2020: . Paper presented at 44th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2020, Virtual, Madrid; Spain; 13 July 2020 through 17 July 2020 (pp. 87-94). Institute of Electrical and Electronics Engineers Inc., Article ID 9202484.
Open this publication in new window or tab >>Resource Depedency Analysis in Multi-Core Systems
Show others...
2020 (English)In: Proceedings - 2020 IEEE 44th Annual Computers, Software, and Applications Conference, COMPSAC 2020, Institute of Electrical and Electronics Engineers Inc. , 2020, p. 87-94, article id 9202484Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we evaluate different methods for statistical determination of application resource dependency in multi-core systems. We measure the performance counters of an application during run-time and create a system resource usage profile. We then use the resource profile to evaluate the application dependency on the specific resource. We discuss and evaluate two methods to process the data, including moving average filter and partitioning the data into smaller segments in order to interpret data for correlation calculations. Our aim with this study is to evaluate and create a generalizeable methods for automatic determination of resource dependencies. The final outcome of the methods used in this study is the answer to the question: 'To what resources is this application dependent on?'. The recommendation of this tool will be used in conjunction with our last-level cache partitioning controller (LLC-PC), to make decision if an application should receive last-level cache partition slices.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc., 2020
Keywords
Multi core, Performance counters, Resource boundess, Critical path analysis, Automatic determination, Last-level caches, Moving average filter, Multi-core systems, Resource dependencies, Resource profile, System resources, Application programs
National Category
Embedded Systems
Identifiers
urn:nbn:se:mdh:diva-52391 (URN)10.1109/COMPSAC48688.2020.00021 (DOI)000629086600013 ()2-s2.0-85094161162 (Scopus ID)9781728173030 (ISBN)
Conference
44th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2020, Virtual, Madrid; Spain; 13 July 2020 through 17 July 2020
Projects
DPACXPRES
Available from: 2020-11-10 Created: 2020-11-10 Last updated: 2022-11-08Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-1996-1234

Search in DiVA

Show all publications