647 research outputs found

    Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems

    Get PDF

    Schedulability-Driven Frame Packing for Multi-Cluster Distributed Embedded Systems

    Get PDF
    We present an approach to frame packing for multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways. In our approach, the application messages are packed into frames such that the application is schedulable. Thus, we have also proposed a schedulability analysis for applications consisting of mixed event-triggered and time-triggered processes and messages, and a worst case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic. Optimization heuristics for frame packing aiming at producing a schedulable system have been proposed. Extensive experiments and a real-life example show the efficiency of our frame-packing approach

    ์‚ฌ๋ฌผ์ธํ„ฐ๋„ท ์• ํ”Œ๋ฆฌ์ผ€์ด์…˜์˜ ์ ์‘ํ˜• ๋™์  ์Šค์ผ€์ค„๋ง ๊ธฐ๋ฒ•

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (์„์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ปดํ“จํ„ฐ๊ณตํ•™๋ถ€, 2019. 2. ํ•˜์ˆœํšŒ.IoT์‹œ์Šคํ…œ์€๋งค์šฐ๋‹ค๋ฅธ์„ฑ๋Šฅ๊ณผ๊ธฐ๋Šฅ์„๊ฐ€์ง„์ด๊ธฐ์ข…์Šค๋งˆํŠธ์žฅ์น˜๋กœ๊ตฌ์„ฑ๋œ๋ถ„์‚ฐ์ž„๋ฒ ๋””๋“œ์‹œ์Šคํ…œ์ด๋‹ค. IoT์‹œ์Šคํ…œ์—์„œ์ผ๋ฐ˜์ ์œผ๋กœ๋ฆฌ์†Œ์Šค์š”๊ตฌ์‚ฌํ•ญ๊ณผ์‹ค์‹œ๊ฐ„์š”๊ตฌ์‚ฌํ•ญ์ด์„œ๋กœ ๋‹ค๋ฅธ ๋งŽ์€ IoT ์• ํ”Œ๋ฆฌ์ผ€์ด์…˜๋“ค์ด ๋™์‹œ์— ์‹คํ–‰๋œ๋‹ค. ๋˜ํ•œ, ์ „๋ ฅ ์†Œ๋น„ ๋ฐ ์žฅ์น˜ ์ˆ˜๋ช…๊ณผ ๊ฐ™์€ ๋น„ ๊ธฐ๋Šฅ์  ํŠน์„ฑ์ด ์ค‘์š”ํ•˜๊ฒŒ ๊ณ ๋ ค๋œ๋‹ค. IoT ์• ํ”Œ๋ฆฌ์ผ€์ด์…˜์€ ์–ธ์ œ๋“ ์ง€ ์ถ”๊ฐ€๋˜๊ฑฐ๋‚˜ ์ œ๊ฑฐ ๋  ์ˆ˜ ์žˆ์œผ๋ฉฐ ๋Ÿฐํƒ€์ž„์— ๋””๋ฐ”์ด์Šค ์ƒํƒœ๊ฐ€ ๋ณ€๊ฒฝ ๋  ์ˆ˜ ์žˆ๋‹ค. ์ด ๊ฐ™์ด ์‹œ์Šคํ…œ์€ ๋™์  ํŠน์„ฑ์„ ๊ฐ–๊ธฐ ๋•Œ๋ฌธ์— IoT ์• ํ”Œ๋ฆฌ์ผ€์ด์…˜์„ ์Šค๋งˆํŠธ ๋””๋ฐ”์ด์Šค์— ๋งคํ•‘/์Šค์ผ€์ค„๋ง ํ•˜๋Š” ๊ฒƒ์€ ๋งค์šฐ๊นŒ๋‹ค๋กœ์šด๋ฌธ์ œ์ด๋‹ค.์ด๋ฌธ์ œ๋ฅผํ•ด๊ฒฐํ•˜๊ธฐ์œ„ํ•ด์ ์ง„์ ๋งคํ•‘๋ฐ๊ธ€๋กœ๋ฒŒ์žฌ๋งคํ•‘์˜๋‘ ๊ฐ€์ง€ ์Šค์ผ€์ค„๋ง ๊ธฐ๋ฒ•์œผ๋กœ ๊ตฌ์„ฑ๋œ ์ƒˆ๋กœ์šด ์ ์‘์  ์Šค์ผ€์ค„๋ง ๊ธฐ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. ๋™์  ํ™˜๊ฒฝ ๋ณ€ํ™”์— ๋Œ€ํ•œ ๋น ๋ฅธ ์‘๋‹ต์„ ์ œ๊ณตํ•˜๊ธฐ ์œ„ํ•ด ์ ์ง„์  ๋งคํ•‘ ๋ฐฉ๋ฒ•์„ ์ œ์•ˆํ•˜๋ฉฐ, ์ •์  ์ƒํƒœ์—์„œ ๋น„ ๊ธฐ๋Šฅ์  ํŠน์„ฑ์— ๊ธฐ์ดˆํ•˜์—ฌ ์ฃผ์–ด์ง„ ๋ชฉ์  ํ•จ์ˆ˜๋ฅผ ์ตœ์ ํ™”ํ•˜๊ธฐ ์œ„ํ•ด ์ฃผ๊ธฐ์ ์œผ๋กœ IoT ์• ํ”Œ๋ฆฌ์ผ€์ด์…˜์˜ ์ „์ฒด ํƒœ์Šคํฌ๋ฅผ ๋ชจ๋‘ ๋‹ค์‹œ ์Šค์ผ€์ค„๋ง ํ•˜๋Š” ์œ ์ „ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๊ธฐ๋ฐ˜ ๊ธ€๋กœ๋ฒŒ ์žฌ ๋งคํ•‘ ๋ฐฉ๋ฒ•์€ ์ œ์•ˆํ•œ๋‹ค. ์ œ์•ˆ ๋œ ์Šค์ผ€์ค„๋ง ๋ฐฉ๋ฒ•์˜ ๋‘ ๊ฐ€์ง€ ์„ฑ๋Šฅ ์ง€ํ‘œ๋กœ ์• ํ”Œ๋ฆฌ์ผ€์ด์…˜ ์ˆ˜์šฉ ๋น„์œจ ๋ฐ ์—๋„ˆ์ง€ ์†Œ๋น„๋Ÿ‰์„ ์‚ฌ์šฉํ•˜์˜€์œผ๋ฉฐ, ์„ฑ๋Šฅ ๋ฐ ์‹ค์šฉ์„ฑ์€ ๋ฌด์ž‘์œ„๋กœ ์ƒ์„ฑ ๋œ ์‹œ๋‚˜๋ฆฌ์˜ค๋ฅผ ์‚ฌ์šฉํ•œ ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ํ™˜๊ฒฝ์„ ํ†ตํ•ด ๊ฒ€์ฆํ•œ๋‹ค.An IoT system can be regarded as a distributed embedded system that is composed of heterogeneous smart devices with very different performance and functions. Also many IoT applications that have different resource requirements and real-time requirements will run concurrently in the IoT system. In addition, non-functional properties such as power consumption and device lifetime are considered important. Since an IoT application can be added or removed anytime and the device status may change at run-time, the system is unprecedentedly dynamic in its configuration, which brings up a challenging scheduling problem of IoT applications onto the smart devices. To tackle this problem, we propose a novel adaptive scheduling technique that consists of two scheduling techniques, incremental and global. An incremental heuristic method is proposed to provide fast responsiveness to dynamically changing configuration. During the steady-state operation, a GA-based method is applied to perform global rescheduling of IoT applications periodically to optimize a given objective function based on non-functional properties. We use the acceptance ratio of new applications and energy consumption as two performance metrics of the proposed scheduling method. The viability of the proposed approach is verified by extensive simulations with randomly generated scenarios.Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v List of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. Problem Description . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.1 Target IoT system . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Motivational Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Problem Definition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3. Schedulability Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1 Transformation of a Task Graphs to Independent Tasks . . . . . . . . . . 10 3.2 Schedulability Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4. Proposed Mapping Technique . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.1 Incremental Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.2 Global Re-mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 5. Experiments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 5.1 Benchmarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 5.2 Experiment 1 (Incremental Mapping) . . . . . . . . . . . . . . . . . . . 23 5.3 Experiment 2 (Global Re-mapping) . . . . . . . . . . . . . . . . . . . . 25 5.4 Experiment 3 (Sensitivity Analysis) . . . . . . . . . . . . . . . . . . . . 27 6. RelatedWork . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 7. Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ์š” ์•ฝ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35Maste

    Exploring Alternatives to use Master/Slave Full Duplex Switched Ethernet for Avionics Embedded Applications

    Get PDF
    The complexity of distributed real-time systems, including military embedded applications, is increasing due to an increasing number of nodes, their functionality and higher amounts of exchanged data. This higher complexity imposes major development challenges when nonfunctional properties must be enforced. On the other hand, the current military communication networks are a generation old and are no longer effective in facing such increasingly complex requirements. A new communication network, based on Full Duplex Switched Ethernet and Master/slave approach, has been proposed previously. However, this initial approach is not efficient in terms of network bandwidth utilization. In this paper we propose two new alternative approaches that can use the network bandwidth more efficiently. In addition we provide a preliminary qualitative assessment of the three approaches concerning different factors such as performance, scalability, complexity and flexibility
    • โ€ฆ
    corecore