Schedulability Analysis for the Dynamic Segment of FlexRay: A Generalization to Slot Multiplexing
暂无分享,去创建一个
[1] Petru Eles,et al. On the quantification of sustainability and extensibility of FlexRay schedules , 2011, 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC).
[2] Klaus Jansen,et al. An asymptotic fully polynomial time approximation scheme for bin covering , 2002, Theor. Comput. Sci..
[3] Klaus Jansen,et al. Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function , 2002, IFIP TCS.
[4] Alan Burns,et al. Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised , 2007, Real-Time Systems.
[5] Gilbert Laporte,et al. An exact algorithm for the dual bin packing problem , 1995, Oper. Res. Lett..
[6] Samarjit Chakraborty,et al. Performance Analysis of FlexRay-based ECU Networks , 2007, 2007 44th ACM/IEEE Design Automation Conference.
[7] Petru Eles,et al. Timing analysis of the FlexRay communication protocol , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).
[8] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .
[9] Samarjit Chakraborty,et al. Optimized Schedule Synthesis under Real-Time Constraints for the Dynamic Segment of FlexRay , 2010, 2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.
[10] Haibo Zeng,et al. Timing Analysis and Optimization of FlexRay Dynamic Segment , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.
[11] Ece Guran Schmidt,et al. Schedulability Analysis and Message Schedule Computation for the Dynamic Segment of FlexRay , 2010, 2010 IEEE 72nd Vehicular Technology Conference - Fall.
[12] Philipp Birken,et al. Numerical Linear Algebra , 2011, Encyclopedia of Parallel Computing.
[13] Deeparnab Chakrabarty,et al. Knapsack Problems , 2008 .
[14] Leonid Khachiyan,et al. Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..