|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A Concept of Dynamically Reconfigurable Real-time Vision System for Autonomous Mobile Robotics显示文摘这篇论文描述被奉献在移动式机器人被嵌入的视觉系统的特定的限制。如果因为它的通用性,灵活性,性能,和费用,基于 PC 的硬件体系结构在这域里是方便的,当前的实时操作系统完全没被改编渴望与改变持续时间处理,并且它对经常必要太大保证设有自动保险装置的工作的系统。另外,和有更多的优先级的另外的机器的任务的相互作用是困难的处理。回答这个问题,我们发展了一动态地交换子可计算的视觉处理系统,基于有关安排和容错的 Cl é opatre 即时可适用的层的创新特征。这个框架允许定义紧急情况和可选的任务为机器人的另外的分系统保证最小的服务质量,当允许动态地改编处理链到的视觉时一在持续视觉过程或处理器超载上非凡。因此,它在单个硬件允许几个分系统的更好的同居,并且他们将为常规盒子并且不被设计开发不太昂贵却安全的系统,,稀罕的非凡的。最后,认为并且发展视觉系统带一个新方法,与一些求反运算符。 | Aymeric De Cabrol Thibault Garcia Patrick Bonnin Maryline Chetto | 2008 | International Journal of Automation and computing2008,5,2: | 3 |
| 2 | Dynamic scheduling of real-time tasks under precedence constraints显示文摘 | H. Chetto M. Silly T. Bouchentouf | 1990 | Real-Time Systems1990,,3: | 1 |
| 3 | Some results of the earliest deadline scheduling algorithm显示文摘 | Chetto H Chetto M | 1989 | IEEE Trans on Software Engineering1989,15,10: | 1 |
| 4 | Some results of the earliest deadline scheduling algorithm显示文摘 | Chetto H Chetto M | 1989 | IEEE Tram On Software Engineering1989,15,10: | 1 |
| 5 | Some results of the earliest deadline scheduling algorithm显示文摘 | Chetto H Chetto M | 1989 | IEEE Trans on Software Engineering1989,15,10: | 1 |
| 6 | Some results of the earliest deadline scheduling algorithm显示文摘 | Chetto H Chetto M | 1989 | IEEE Trans on Software Engineering1989,15,10: | 1 |
| 7 | Some result of the earliest deadline sc- heduling algorithm显示文摘 | Chetto H Chetto M | 1989 | IEEE Transactions on Software Engi- neering1989,15,10: | 1 |
| 8 | Some results of the earliest deadline scheduling algorithm显示文摘 | Chetto M | 1989 | IEEE Trans Software Eng1989,15,10: | 1 |
| 9 | Some result of the earliest deadline sche- duling algorithm 显示文摘 | CHETTO H CHETTO M | 1989 | IEEE Trans on Parallel and Distributed Systems1989,15,10: | 1 |
| 10 | Some results of the earliest deadline scheduling algorithm显示文摘 | CHETTO H CHETTO M | 1989 | IEEE Transaction on Software Engineering1989,15,10: | 1 |
| 11 | Some results of the earliest deadline scheduling algorithm 显示文摘 | Chetto H Chetto M | 1989 | IEEE Transactions on Software Engineering1989,15,10: | 1 |
| 12 | Some result of the earliest deadline scheduling algorithm显示文摘 | Chetto H Chetto M | 1989 | IEEE Transactions on Parallel and Distributed Systems1989,,: | 1 |
| 13 | Dynamic scheduling of realtime tasks under precedence constraints显示文摘 | Chetto H Silly M Bouchentouf T | 1990 | The Journal of RealTime Systems1990,2,: | 1 |
| 14 | Some result of the earliest deadline scheduling algorithm 显示文摘 | Chetto H Chetto M | 1959 | IEEE Trans on Parallel and Distributed Systems1959,15,10: | 1 |
| 15 | Characterization in Greenhouse Conditions of Two Salt Tolerant Citrumelo (Citrus paradisi Macf. x Poncirus trifoliata (L.) Raf.) Cultivars显示文摘 | Anas Fadli Ouiam Chetto Abdelhak Talha Rachid Benkirane Raphael Morillon Hamid Benyahia | 2014 | Journal of Life Sciences2014,8,12: | 0 |
| 16 | Energy Guarantee Scheme for Real-time Systems with Energy Harvesting Constraints显示文摘The growth of environmental energy harvesting has been explosive in wireless computing systems especially when replacing or recharging batteries manually is impracticable.This work investigates the scheduling of periodic weekly hard real-time tasks under energy constraints.Based on this motivation,we proposed a real-time scheduling algorithm,namely energy guarantee dynamic voltage and frequency scaling(EG-DVFS),that utilizes the earliest deadline-harvesting(ED-H)scheduling algorithm combined with dynamic voltage and frequency scaling.This one is qualified as real-time since tasks must satisfy their timing constraints.We assume that the preemptable tasks receive dynamic priorities according to the earliest deadline first(EDF)rule.EG-DVFS adjusts the processor's behavior by characterizing the properties of the energy source module,capacity of the stored energy as well as the harvested energy in a future duration.Specifically,tasks are executed at full processor speed if the amount of energy in the battery is enough to finish its execution.Otherwise,the processor slows down task execution to the lowest possible processor speed while still guaranteeing to meet all the timing constraints.EG-DVFS mainly depends on the on-line computation of the slack time and the slack energy with dynamic voltage and frequency selection in order to achieve an improved system performance.Experimental results show that EG-DVFS can achieve capacity savings up of up to 33%when compared to ED-H. | Hussein El Ghor Maryline Chetto | 2019 | International Journal of Automation and computing2019,16,3: | 0 |