کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1712887 | 1519807 | 2008 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Research of improving the dynamic scheduling algorithm in the CAN bus control networks
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Currently, the article analyzes the CAN bus's rule of priority's arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority's messages will be delayed considerably more, even some data will be lost when the bus's bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model's rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Systems Engineering and Electronics - Volume 19, Issue 6, December 2008, Pages 1250-1257
Journal: Journal of Systems Engineering and Electronics - Volume 19, Issue 6, December 2008, Pages 1250-1257
نویسندگان
Wang Liming, Shao Ying, Wang Mingzhe, Shan Yong,