Optimal scheduling of switched FlexRay networks

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2011, Pages 926-931

  Schenkelaars, Thijs ^a   Vermeulen, Bart ^b   Goossens, Kees ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b NXP SEMICONDUCTORS   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH EFFICIENCY; BRANCH-AND-PRICE ALGORITHMS; DATA-COMMUNICATION; FLEXRAY; NETWORK BANDWIDTH; NETWORK TOPOLOGY; OPTIMAL SCHEDULE; OPTIMAL SCHEDULING; PROTOCOL SPECIFICATIONS; REPETITION RATE; STAR COUPLERS;

BANDWIDTH; ELECTRIC NETWORK TOPOLOGY; MULTIPLEXING; OPTIMIZATION; SCHEDULING ALGORITHMS; TELECOMMUNICATION SYSTEMS;

SWITCHING CIRCUITS;

EID: 79957566992     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Protocol specification Version 3.0, FlexRay Consortium, Dec. 2009. [Online]. Available: http://www.flexray.com
2. P. Milbredt, B. Vermeulen, G. Tabanoglu, and M. Lukasiewycz, "Switched FlexRay: Increasing the Effective Bandwidth and Safety of FlexRay Networks," IEEE ETFA, 2010.
3. M. Grenier, L. Havet, and N. Navet, "Configuring the communication on flexray - the case of the static segment," in ERTS, 2008.
4. S. Ding, N. Murakami, H. Tomiyama, and H. Takada, "A GA-based scheduling method for FlexRay systems," in EMSOFT: conference on embedded software. ACM, 2005, pp. 110-113.
5. K. Schmidt and E. Schmidt, "Message scheduling for the FlexRay protocol: The static segment," IEEE Trans. Veh. Technol., vol. 58, no. 5, pp. 2170-2179, 2009.
6. M. Lukasiewycz, M. Glaß, J. Teich, and P. Milbredt, "Flexray schedule optimization of the static segment," in CODES+ISSS, 2009.
7. G. Tabanoglu, "Synchronous Switched Scheduling with Heterogeneous Cycle Configurations for Efficient Bandwidth Usage in a FlexRay Cluster," 2010.
8. G. B. Dantzig and P. Wolfe, "Decomposition principle for linear programs," Operations Research, vol. 8, no. 1, pp. 101-111, 1960.
9. P. H. Vance, C. Barnhart, E. L. Johnson, and G. L. Nemhauser, "Solving binary cutting stock problems by column generation and branch-and-bound," Comput. Optim. Appl., vol. 3, no. 2, pp. 111-130, 1994.
10. C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance, "Branch-and-price: Column generation for solving huge integer programs," Operations Research, vol. 46, no. 3, pp. 316-329, 1998.
11. E. Johnson, G. Nemhauser, and M. Savelsbergh, "Progress in linear programming-based algorithms for integer programming: An exposition," INFORMS Journal on Computing, vol. 12, no. 1, pp. 2-23, 2000.
12. F. S. Hillier, G. J. Lieberman, F. Hillier, and G. Lieberman, Introduction to Operations Research. McGraw-Hill, July 2004.
13. "Coin-or branch and cut solver, version 2.4.0," http://www.coin-or.org/, COIN-OR: Common Optimization Interface for Operations Research.