547 research outputs found

    Cluster Based Real Time Scheduling for Distributed System

    Get PDF
    Real time tasks scheduling on a distributed system is a complex problem. The existing real time tasks scheduling techniques are primarily based on partitioned and global scheduling. In partitioned based scheduling the tasks are assigned on a dedicated processor. The advantages of partitioned based approach is existing uni-processor scheduling techniques can be used; no migration overheads but task assignment is NP hard problem and optimal utilization of processing nodes is not possible. In global scheduling all tasks are maintained in a single tasks queue and allocated to multiple processing nodes. The advantage of global scheduling is optimal utilization of processing nodes but suffer from high migration and preemption overheads. This paper proposed cluster based real time tasks scheduling on a distributed system which is a hybrid scheduling approach where processing nodes group into cluster and scheduling using global scheduling. The simulation result shows that the proposed scheduling increases the tasks acceptance ratio, resource utilization as compared to partitioned and global scheduling and reduces migration as well as preemption overheads

    Proceedings of the 5th International Workshop on Reconfigurable Communication-centric Systems on Chip 2010 - ReCoSoC\u2710 - May 17-19, 2010 Karlsruhe, Germany. (KIT Scientific Reports ; 7551)

    Get PDF
    ReCoSoC is intended to be a periodic annual meeting to expose and discuss gathered expertise as well as state of the art research around SoC related topics through plenary invited papers and posters. The workshop aims to provide a prospective view of tomorrow\u27s challenges in the multibillion transistor era, taking into account the emerging techniques and architectures exploring the synergy between flexible on-chip communication and system reconfigurability

    ROS๊ธฐ๋ฐ˜์˜ ์˜คํ”ˆ์†Œ์Šค ์ž์œจ์ฃผํ–‰ ํ”Œ๋žซํผ ์‹œ์Šคํ…œ ์ตœ์ ํ™”

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ(์„์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ปดํ“จํ„ฐ๊ณตํ•™๋ถ€, 2022. 8. ์ด์ฐฝ๊ฑด.The open-source robot operating system(ROS) is being studied in complex system such as autonomous driving. Many studies have made efforts to port real-time to ROS for complex systems based on ROS. However, these methods are not user- friendly because they are dif๏ฌcult to use and require complicated procedures. This paper focused on the response time to improve ROS performance without modifying the ROS structure or adding other complicated procedures. We found that one of the characteristics of ROS causes response time delay. In this paper, we describe a method to improve response time with user convenience by using the characteristics of ROS. Finally, We show the performance of the method presented in this paper through several experiments.์˜คํ”ˆ์†Œ์Šค ๋กœ๋ด‡์šด์˜์ฒด์ œ(ROS)๋Š” ์ž์œจ์ฃผํ–‰๊ณผ ๊ฐ™์€ ๋ณต์žกํ•œ ์‹œ์Šคํ…œ์—์„œ ์—ฐ๊ตฌ๋˜๊ณ  ์žˆ๋‹ค. ROS๋ฅผ ๊ธฐ๋ฐ˜์œผ๋กœ ํ•˜๋Š” ๋ณต์žกํ•œ ์‹œ์Šคํ…œ์„ ์œ„ํ•ด ROS์— ์‹ค์‹œ๊ฐ„ ์ด์‹์„ ์œ„ํ•œ ๋งŽ์€ ์—ฐ๊ตฌ๊ฐ€ ์ด๋ฃจ์–ด์กŒ๋‹ค. ๊ทธ๋Ÿฌ๋‚˜ ์ด๋Ÿฌํ•œ ๋ฐฉ๋ฒ•์€ ์‚ฌ์šฉํ•˜๊ธฐ ์–ด๋ ต๊ณ  ๋ณต์žกํ•œ ์ ˆ์ฐจ๊ฐ€ ํ•„์š”ํ•˜๊ธฐ ๋•Œ๋ฌธ์— ์‚ฌ์šฉ์ž ์นœํ™”์ ์ด์ง€ ์•Š๋‹ค. ์ด๋ฅผ ์œ„ํ•ด ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ROS์˜ ๊ตฌ์กฐ๋ฅผ ์ˆ˜์ •ํ•˜๊ฑฐ๋‚˜ ๋‹ค๋ฅธ๋ณต์žกํ•œ ์ ˆ์ฐจ๋ฅผ ์ถ”๊ฐ€ํ•˜์ง€ ์•Š๊ณ  ROS์˜ ์„ฑ๋Šฅ์„ ๋†’์ด๊ธฐ ์œ„ํ•˜์—ฌ ์‘๋‹ต์‹œ๊ฐ„์— ์ฃผ๋ชฉํ•˜์˜€์œผ๋ฉฐ, ROS์˜ ํŠน์„ฑ ์ค‘ ํ•˜๋‚˜๊ฐ€ ์‘๋‹ต์‹œ๊ฐ„ ์ง€์—ฐ์„ ๋ฐœ์ƒ์‹œํ‚ค๋Š” ๊ฒƒ์„ ๋ฐœ๊ฒฌํ•˜์˜€๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ROS์˜ ํŠน์„ฑ์„ ์ด์šฉํ•˜์—ฌ ์‚ฌ์šฉ์ž์˜ ํŽธ์˜์„ฑ์„ ๊ฐ–์ถ˜ ์‘๋‹ต์‹œ๊ฐ„ ํ–ฅ์ƒ ๋ฐฉ๋ฒ•์„ ์„ค๋ช…ํ•œ๋‹ค. ๋งˆ์ง€๋ง‰์œผ๋กœ ๋ณธ ๋…ผ๋ฌธ์—์„œ ์ œ์‹œํ•˜๋Š” ๋ฐฉ๋ฒ•์˜ ์„ฑ๋Šฅ์„ ๋ช‡ ๊ฐ€์ง€ ์‹คํ—˜์„ ํ†ตํ•ด ๋ณด์ธ๋‹ค1 Introduction 1 2 Backgound 3 2.1 ROS Structure 4 2.2 Node 4 3 Problem Description 7 3.1 Critical Chain 7 3.2 Observation 9 4 Proposed Approach 12 4.1 Assumption 12 4.2 Objective Function 13 4.3 Proposed Algorithm 15 5 Evaluation 16 5.1 Objective Function Evaluation 16 5.2 Response Time Evaluation 17 5.3 Autonomous Driving Evaluation Setup 18 5.4 Autonomous Driving Evaluation Result 19 6 Conclusion 21 References 22์„

    Optimizing Sensor Network Reprogramming via In-situ Reconfigurable Components

    Get PDF
    International audienceWireless reprogramming of sensor nodes is a critical requirement in long-lived Wireless Sensor Networks (WSNs) for several concerns, such as fixing bugs, upgrading the operating system and applications, and adapting applications behavior according to the physical environment. In such resource-poor platforms, the ability to efficiently delimit and reconfigure the necessary portion of sensor software--instead of updating the full binary image--is of vital importance. However, most of existing approaches in this field have not been widely adopted to date due to the extensive use of WSN resources or lack of generality. In this article, we therefore consider WSN programming models and run-time reconfiguration models as two interrelated factors and we present an integrated approach for addressing efficient reprogramming in WSNs. The middleware solution we propose, RemoWare, is characterized by mitigating the cost of post-deployment software updates on sensor nodes via the notion of in-situ reconfigurability and providing a component-based programming abstraction to facilitate the development of dynamic WSN applications. Our evaluation results show that RemoWare imposes a very low energy overhead in code distribution and component reconfiguration, and consumes approximately 6% of the total code memory on a TelosB sensor platform
    • โ€ฆ
    corecore