| 1. |
- Bennulf, Mattias, 1992-, et al.
(författare)
-
Identification of resources and parts in a Plug and Produce system using OPC UA
- 2019
-
Ingår i: Procedia Manufacturing. - : Elsevier BV. - 2351-9789. ; 38, s. 858-865
-
Tidskriftsartikel (refereegranskat)abstract
- This paper describes a method together with an implementation for automating the detection, identification and configuration of newly added resources and parts in a Plug and Produce system using OPC UA. In a Plug and Produce system, resources and parts are usually controlled by agents, forming a multi-agent system of collaborating resources. Hence, when a resource or part is connected to the system, a corresponding agent must be instantiated and associated with that specific device. In order to automate this, the system needs information about newly connected devices. This information could, for example, be positional data describing where the device is connected. Some devices like tools and parts to be processed have no own network connection, but still, they should get an agent with correct configuration instantiated. In this work, OPC UA is used for communication between devices and the corresponding agents. All agents and their communication are handled by an Agent Handling System, consisting of an OPC UA HUB together with functions for device detection and agent instantiation. The HUB is used for transferring data between devices and their agents in the network by OPC UA protocols. When a device is connected to the network, it is detected, and a connection is automatically created to the HUB that becomes configured for transmitting data between the device and its corresponding agent. © 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
|
|
| 2. |
- Svensson, Bo, 1959-, et al.
(författare)
-
Improving Performance in Flexible Manufacturing by a P-sop Approach
- 2014
-
Ingår i: Proceedings of the 6th International Swedish Production Symposium 2014. - 9789198097412 ; , s. 1-8
-
Konferensbidrag (refereegranskat)abstract
- This paper present a Part oriented Sequence of Operation (P-SOP) approach that address flexibility, robustness and deployment in manufacturing cells up to plant level. A P-SOP description language has been formulated where the control strategy based on actual circumstances easily can be defined. Furthermore, a P-SOP multi-agent generator has been created that compiles the strategy description to multi-agents that control the manufacturing. Deadlock free IEC 61131-3 PLC code are directly generated from the description language. The code is not optimised for a specific scenario since the general description contains all possible routing paths and all resources available.
|
|
| 3. |
- Gustavsson Christiernin, Linn, 1979-
(författare)
-
How to describe interaction with a collaborative robot
- 2017
-
Ingår i: HRI '17 Proceedings of the Companion of the 2017 ACM/IEEE International Conference on Human-Robot Interaction. - New York, NY, USA : ACM. - 9781450348850 ; , s. 93-94
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we describe early work on a classification model on how to interact with industrial and other types of robots. We suggest a classification for how to describe different scenarios within Human-Robot Interaction. The idea with this model is to help when identifying the gap between where a company is and where they would like to be when it comes to collaborative automation. © 2017 Author.
|
|
| 4. |
- de Blanche, Andreas, 1975-, et al.
(författare)
-
Availability of Unused Computational Resources in an Ordinary Office Environment
- 2010
-
Ingår i: Journal of Circuits, Systems and Computers. - 0218-1266. ; 19:3, s. 557-572
-
Tidskriftsartikel (refereegranskat)abstract
- The study presented in this paper highlights an important issue that was subject for discussionsand research about a decade ago and now have gained new interest with the current advances ofgrid computing and desktop grids. New techniques are being invented on how to utilize desktopcomputers for computational tasks but no other study, to our knowledge, has explored theavailability of the said resources. The general assumption has been that there are resources andthat they are available. The study is based on a survey on the availability of resources in anordinary o±ce environment. The aim of the study was to determine if there are truly usableunder-utilized networked desktop computers available for non-desktop tasks during the off-hours. We found that in more than 96% of the cases the computers in the current investigationwas available for the formation of part-time (night and weekend) computer clusters. Finally wecompare the performance of a full time and a metamorphosic cluster, based on one hypotheticallinear scalable application and a real world welding simulation.
|
|
| 5. |
|
|
| 6. |
- Amoson, Jonas, 1973-, et al.
(författare)
-
A light-weigh non-hierarchical file system navigation extension
- 2012
-
Ingår i: Proceedings of the 7th International Workshop on Plan 9. - Dublin, Ireland. ; , s. 11-13
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Drawbacks in organising and finding files in hierarchies have led researchers to explorenon-hierarchical and search-based filesystems, where file identity and belonging is pred-icated by tagging files to categories. We have implemented a chdir() shell extension en-abling navigation to a directory using a search expression. Our extension is light-weightand avoids modifying the file system to guarantee backwards compatibility for applicationsrelying on normal hierarchical file namespaces.
|
|
| 7. |
|
|
| 8. |
- de Blanche, Andreas, 1975-, et al.
(författare)
-
A methodology for estimating co-scheduling slowdowns due to memory bus contention on multicore nodes
- 2014
-
Ingår i: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2014. - : ACTA Press. - 9780889869677 - 9780889869653 ; , s. 216-223
-
Konferensbidrag (refereegranskat)abstract
- When two or more programs are co-scheduled on the same multicore computer they might experience a slowdown due to the limited off-chip memory bandwidth. According to our measurements, this slowdown does not depend on the total bandwidth use in a simple way. One thing we observe is that a higher memory bandwidth usage will not always lead to a larger slowdown. This means that relying on bandwidth usage as input to a job scheduler might cause non-optimal scheduling of processes on multicore nodes in clusters, clouds, and grids. To guide scheduling decisions, we instead propose a slowdown based characterization approach. Real slowdowns are complex to measure due to the exponential number of experiments needed. Thus, we present a novel method for estimating the slowdown programs will experience when co-scheduled on the same computer. We evaluate the method by comparing the predictions made with real slowdown data and the often used memory bandwidth based method. This study show that a scheduler relying on slowdown based categorization makes fewer incorrect co-scheduling choices and the negative impact on program execution times is less than when using a bandwidth based categorization method.
|
|
| 9. |
- de Blanche, Andreas, 1975-, et al.
(författare)
-
Addressing characterization methods for memory contention aware co-scheduling
- 2015
-
Ingår i: Journal of Supercomputing. - : Springer Science and Business Media LLC. - 0920-8542 .- 1573-0484. ; 71:4, s. 1451-1483
-
Tidskriftsartikel (refereegranskat)abstract
- The ability to precisely predict how memory contention degrades performance when co-scheduling programs is critical for reaching high performance levels in cluster, grid and cloud environments. In this paper we present an overview and compare the performance of state-of-the-art characterization methods for memory aware (co-)scheduling. We evaluate the prediction accuracy and co-scheduling performance of four methods: one slowdown-based, two cache-contention based and one based on memory bandwidth usage. Both our regression analysis and scheduling simulations find that the slowdown based method, represented by Memgen, performs better than the other methods. The linear correlation coefficient (Formula presented.) of Memgen's prediction is 0.890. Memgen's preferred schedules reached 99.53 % of the obtainable performance on average. Also, the memory bandwidth usage method performed almost as well as the slowdown based method. Furthermore, while most prior work promote characterization based on cache miss rate we found it to be on par with random scheduling of programs and highly unreliable.
|
|
| 10. |
- de Blanche, Andreas, 1975-, et al.
(författare)
-
Method for Experimental Measurement of an Applications Memory Bus Usage
- 2010
-
Ingår i: <em> </em>. - : CSREA Press.
-
Konferensbidrag (refereegranskat)abstract
- The disproportion between processor and memory bus capacities has increased constantly during the last decades. With the introduction of multi-core processors the memory bus capacity is divided between the simultaneously executing processes (cores). The memory bus capacity directly affects the number of applications that can be executed simultaneously at its full potential. Thus, against this backdrop it becomes important to estimate how the limitation of the memory bus effects the applications performance. Towards this end we introduce a method and a tool for experimental estimation of an applications memory requirement as well as the impact of sharing the memory bus has on the execution times. The tool enables black-box approximate profiling of an applications memory bus usage during execution. It executes entirely in user-space and does not require access to the application code, only the binary.
|
|
