Optimized Frame Packing for Embedded Systems

Pölzlbauer, Florian; Bate, Iain; Brenner, Eugen

doi:10.1109/les.2012.2208094

Cited by 23 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To ensure that available payload is not unnecessarily wasted, transactions common to a slave may be merged in many cases, with the smallest period inherited. An efficient algorithm to pack signals into transactions while respecting maximum payload size can be found in [27]. Finally, it can be noted that if the model proposed in this paper is unduly restrictive for a given application, then other more complex general models for real-time scheduling a multiple-hop wireless link can be found in the literature [28].…”

Section: Remarksmentioning

confidence: 99%

Eligible earliest deadline first: Server-based scheduling for master-slave industrial wireless networks

Short

2017

Computers & Electrical Engineering

View full text Add to dashboard Cite

Industrial automation and control systems are increasingly deployed using wireless networks in masterslave, star-type configurations that employ a slotted timeline schedule. In this paper, the scheduling of (re)transmissions to meet real-time constraints in the presence of non-uniform interference in such networks is considered. As packet losses often occur in correlated bursts, it is often useful to insert gaps before attempting retransmissions. In this paper, a quantum Earliest Deadline First (EDF) scheduling framework entitled 'Eligible EDF' is suggested for assigning (re)transmissions to available timeline slots by the master node. A simple but effective server strategy is introduced to reclaim unused channel utilization and replenish failed slave transmissions, a strategy which prevents cascading failures and naturally introduces retransmission gaps. Analysis and examples illustrate the effectiveness of the proposed method. Specifically, the proposed framework gives a timely throughput of 99.81% of the timely throughput that is optimally achievable using a clairvoyant scheduler.

show abstract

Section: Remarksmentioning

confidence: 99%

Eligible earliest deadline first: Server-based scheduling for master-slave industrial wireless networks

Short

2017

Computers & Electrical Engineering

View full text Add to dashboard Cite

show abstract

“…W i k is the CAN FD frame size of the kth type of frame corresponding to a packed frame f i . CAN FD allows payloads of 1,2,3,4,5,6,7,8,12,16,20,24,32,48 or 64 bytes. Therefore, W i k refers to one value of the above bytes, and k ∈ [1,15].…”

Section: Formulation Of Frame Packing Problemmentioning

confidence: 99%

“…• Step1: The one-point crossover [6] is performed at the crossing point k ∈ [1, N − 1], and partial array variables of the parents are exchanged mutually. After the crossover operation, two individuals are obtained as the children.…”

Section: Crossover Operationmentioning

confidence: 99%

“…7. As a result, we can obtain two new frames denoted by f 2 = {s 1 , s 2 , s 6 , s 4 , s 7 }, and f 3 = {s 3 , s 5 , s 8 , s 10 , s 9 }, and finally rename them to f 1 = {s 1 , s 2 , s 6 , s 4 , s 7 }, f 2 = {s 3 , s 5 , s 8 , s 10 , s 9 } as the mutation results.…”

Section: Mutation Operationmentioning

confidence: 99%

“…In contrast, Saket and Navet [8] sort the signals by their bandwidth utilization and try to pack the signals with similar periods in the same frame. Polzlbauer et al [6] also presented a heuristic based on the next-fit decreasing algorithm, and proposed an additional standard for assessing whether to add a signal to an existing frame according to its impact on bandwidth utilization. Recently, Bordoloi and Samii [2] proposed a two-stage framework for CAN FD Frame Selection (CaFeS) problem and schedulability verification of packed frames.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Genetic Algorithm for Packing CAN FD Frame with Real-Time Constraints

Ding

Zeng

Kurachi

et al. 2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYAs a next-generation CAN (Controller Area Network), CAN FD (CAN with flexible data rate) has attracted much attention recently. However, how to use the improved bus bandwidth efficiently in CAN FD is still an issue. Contrasting with existing methods using greedy approximate algorithms, this paper proposes a genetic algorithm for CAN FD frame packing. It tries to minimize the bandwidth utilization by considering the different periods of signals when packing them in the same frame. Moreover, it also checks the schedulability of packed frames to guarantee the real-time constraints of each frame and proposed a merging algorithm to improve the schedulability for signal set with high bus load. Experimental results validate that the proposed algorithm can achieve significantly less bandwidth utilization and improved schedulability than existing methods for a given set of signals.

show abstract