A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary

A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary

A virtual channels scheduling algorithm with broad applicability based on movable boundary is proposed. According to the types of date sources, transmission time slots are divided into synchronous ones and asynchronous ones with a movable boundary between them. During the synchronous time slots, the...

Full description

Bibliographic Details
Main Authors: Ye Tian, Qingfan Li, Yongxin Feng, Xiaoling Gao
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2013/391493
id doaj-41a21566b959441c85f51cd1373b9868
record_format Article
spelling doaj-41a21566b959441c85f51cd1373b98682020-11-25T01:06:28ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472013-01-01201310.1155/2013/391493391493A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable BoundaryYe Tian0Qingfan Li1Yongxin Feng2Xiaoling Gao3School of Information Science and Engineering, Shenyang Ligong University, ShenYang 110159, ChinaSchool of Information Science and Engineering, Shenyang Ligong University, ShenYang 110159, ChinaSchool of Information Science and Engineering, Shenyang Ligong University, ShenYang 110159, ChinaSchool of Information Science and Engineering, Shenyang Ligong University, ShenYang 110159, ChinaA virtual channels scheduling algorithm with broad applicability based on movable boundary is proposed. According to the types of date sources, transmission time slots are divided into synchronous ones and asynchronous ones with a movable boundary between them. During the synchronous time slots, the virtual channels are scheduled with a polling algorithm; during the asynchronous time slots, the virtual channels are scheduled with an algorithm based on virtual channel urgency and frame urgency. If there are no valid frames in the corresponding VC at a certain synchronous time slot, a frame of the other synchronous VCs or asynchronous VCs will be transmitted through the physical channel. Only when there are no valid frames in all VCs would an idle frame be generated and transmitted. Experiments show that the proposed algorithm yields much lower scheduling delay and higher channel utilization ratio than those based on unmovable boundary or virtual channel urgency in many kinds of sources. Therefore, broad applicability can be achieved by the proposed algorithm.http://dx.doi.org/10.1155/2013/391493
collection DOAJ
language English
format Article
sources DOAJ
author Ye Tian
Qingfan Li
Yongxin Feng
Xiaoling Gao
spellingShingle Ye Tian
Qingfan Li
Yongxin Feng
Xiaoling Gao
A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary
Mathematical Problems in Engineering
author_facet Ye Tian
Qingfan Li
Yongxin Feng
Xiaoling Gao
author_sort Ye Tian
title A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary
title_short A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary
title_full A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary
title_fullStr A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary
title_full_unstemmed A Virtual Channels Scheduling Algorithm with Broad Applicability Based on Movable Boundary
title_sort virtual channels scheduling algorithm with broad applicability based on movable boundary
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2013-01-01
description A virtual channels scheduling algorithm with broad applicability based on movable boundary is proposed. According to the types of date sources, transmission time slots are divided into synchronous ones and asynchronous ones with a movable boundary between them. During the synchronous time slots, the virtual channels are scheduled with a polling algorithm; during the asynchronous time slots, the virtual channels are scheduled with an algorithm based on virtual channel urgency and frame urgency. If there are no valid frames in the corresponding VC at a certain synchronous time slot, a frame of the other synchronous VCs or asynchronous VCs will be transmitted through the physical channel. Only when there are no valid frames in all VCs would an idle frame be generated and transmitted. Experiments show that the proposed algorithm yields much lower scheduling delay and higher channel utilization ratio than those based on unmovable boundary or virtual channel urgency in many kinds of sources. Therefore, broad applicability can be achieved by the proposed algorithm.
url http://dx.doi.org/10.1155/2013/391493
work_keys_str_mv AT yetian avirtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
AT qingfanli avirtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
AT yongxinfeng avirtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
AT xiaolinggao avirtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
AT yetian virtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
AT qingfanli virtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
AT yongxinfeng virtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
AT xiaolinggao virtualchannelsschedulingalgorithmwithbroadapplicabilitybasedonmovableboundary
_version_ 1725190102330638336

Similar Items