000121637 001__ 121637
000121637 005__ 20190331192655.0
000121637 0247_ $$2doi$$a10.1109/RTCSA.2006.42|
000121637 037__ $$aCONF
000121637 245__ $$aMapping task-graphs on distributed ECU networks: Efficient algorithms for feasibility and optimality
000121637 269__ $$a2006
000121637 260__ $$c2006
000121637 336__ $$aConference Papers
000121637 520__ $$aThis mapping problem has to be solved in many application scenarios. In the automotive industry, for example, the implementation of car functions involves distributed task sets running on multiple electronic control units (ECU) with bus-based inter-task communication, a problem we consider in this paper. Our approach is based on mixed integer linear programming (MILP). MILP is concerned with optimizing a linear function subject to a set of linear constraints where some variables are required to be integer. The current state-of-the art method to solve integer programs is the branch-and-cut (B&C) algorithm and several industrial strength solvers are available. We describe a MILP-model for the mapping problem. Handling this model over to a general MILP-solver does not yield satisfactory results in terms of running time. To make the model more efficient we use the above ingredients: we incorporate a primal heuristic, strengthen the model with further inequalities and generate on-demand cutting planes, which violate the current fractional solution. These routines drastically speed up the solution time
000121637 700__ $$aDamm, Werner
000121637 700__ $$aMetzner, Alexander
000121637 700__ $$0240331$$g183121$$aEisenbrand, Friedrich
000121637 700__ $$aShmonin, Gennady
000121637 700__ $$aWilhelm, Reinhard
000121637 700__ $$aWinkel, Sebastian
000121637 773__ $$tProceedings - 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2006$$q87-90
000121637 909C0 $$xU11879$$0252111$$pDISOPT
000121637 909CO $$pconf$$pSB$$ooai:infoscience.tind.io:121637
000121637 937__ $$aDISOPT-CONF-2006-001
000121637 970__ $$a073110721878/DISOPT
000121637 973__ $$sPUBLISHED$$aOTHER
000121637 980__ $$aCONF