Number of functions = 11 The number of iterations = 500 The initial_task_set_file_name is ../initial_tasks_set.xmlv3 The scheduler is RM The second fitness function is sum_lax xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:2:9: No DTD defined for this document, at ../initial_tasks_set.xmlv3:2:9) xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:4:14: [VC] No attribute allowed for element core_unit, at ../initial_tasks_set.xmlv3:4:14) xml_generic_parsers-architecture.adb:1152:Add core unit core1 id_22 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:22:18: [VC] No attribute allowed for element address_space, at ../initial_tasks_set.xmlv3:22:18) xml_generic_parsers-architecture.adb:984:Add address space addr1 id_21 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:44:24: [VC] No attribute allowed for element mono_core_processor, at ../initial_tasks_set.xmlv3:44:24) xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:49:10: [VC] No attribute allowed for element core, at ../initial_tasks_set.xmlv3:49:10) xml_generic_parsers-architecture.adb:1187:Add monocore processor processor1 id_23 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:54:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:54:18) xml_generic_parsers-architecture.adb:875:Add task Task1 id_26 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:74:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:74:18) xml_generic_parsers-architecture.adb:875:Add task Task2 id_27 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:94:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:94:18) xml_generic_parsers-architecture.adb:875:Add task Task3 id_28 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:114:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:114:18) xml_generic_parsers-architecture.adb:875:Add task Task4 id_29 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:134:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:134:18) xml_generic_parsers-architecture.adb:875:Add task Task5 id_30 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:154:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:154:18) xml_generic_parsers-architecture.adb:875:Add task Task6 id_31 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:174:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:174:18) xml_generic_parsers-architecture.adb:875:Add task Task7 id_32 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:194:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:194:18) xml_generic_parsers-architecture.adb:875:Add task Task8 id_33 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:214:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:214:18) xml_generic_parsers-architecture.adb:875:Add task Task9 id_34 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:234:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:234:18) xml_generic_parsers-architecture.adb:875:Add task Task10 id_35 xml_generic_parsers.adb:170:Xml parser non fatal error (../initial_tasks_set.xmlv3:254:18: [VC] No attribute allowed for element periodic_task, at ../initial_tasks_set.xmlv3:254:18) xml_generic_parsers-architecture.adb:875:Add task Task11 id_36 The initial tasks set is schedulable Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 C 1 = 2 T 1 = 60 D 1 = 60 C 2 = 10 T 2 = 110 D 2 = 110 C 3 = 8 T 3 = 120 D 3 = 120 C 4 = 1 T 4 = 30 D 4 = 30 C 5 = 15 T 5 = 120 D 5 = 120 C 6 = 2 T 6 = 110 D 6 = 110 C 7 = 2 T 7 = 60 D 7 = 60 C 8 = 3 T 8 = 120 D 8 = 120 C 9 = 4 T 9 = 60 D 9 = 60 C 10 = 1 T 10 = 100 D 10 = 100 C 11 = 2 T 11 = 90 D 11 = 90 The actual processor utilization is : 0.52464646 The hyperperiod of the initial task set = 19800 1 2 3 4 5 6 7 8 9 10 11 Z1_anti_ideal = 2.63000E+02 Z2_anti_ideal = 1.90240E+04 263 19024 arclength = 1 The genetic material in the archive is now... 263 19024 --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- ------------------ iteration = 1 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 11 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 1 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 1 is : Z1_anti_ideal = 2.63000E+02 Z2_anti_ideal = 1.91150E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- ------------------ iteration = 2 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 8 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 2 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 2 is : Z1_anti_ideal = 2.63000E+02 Z2_anti_ideal = 1.92080E+04 Objectives of the mutated solution : 243 19208 Comparing 243 19115 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- ------------------ iteration = 3 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 3 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 273 sum_lax = 601 Min_lax = 11 The mutated normalized solution of iteration 3 : 1 2 3 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 3 is : Z1_anti_ideal = 2.73000E+02 Z2_anti_ideal = 1.92080E+04 Objectives of the mutated solution : 273 19199 Comparing 243 19115 and 273 19199 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- ------------------ iteration = 4 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 8 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 580 Min_lax = 27 The mutated normalized solution of iteration 4 : 1 2 3 4 5 6 7 1 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 4 is : Z1_anti_ideal = 2.73000E+02 Z2_anti_ideal = 1.92200E+04 Objectives of the mutated solution : 243 19220 Comparing 243 19115 and 243 19220 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- ------------------ iteration = 5 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 5 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 5 is : Z1_anti_ideal = 2.73000E+02 Z2_anti_ideal = 1.92200E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- ------------------ iteration = 6 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 8 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 6 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 6 is : Z1_anti_ideal = 2.81000E+02 Z2_anti_ideal = 1.92200E+04 Objectives of the mutated solution : 281 19147 Comparing 243 19115 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- ------------------ iteration = 7 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 1 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 7 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 7 is : Z1_anti_ideal = 2.81000E+02 Z2_anti_ideal = 1.92710E+04 Objectives of the mutated solution : 231 19271 Comparing 243 19115 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 8 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 4 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 3 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 405 sum_lax = 303 Min_lax = 13 The mutated normalized solution of iteration 8 : 1 2 3 3 1 4 5 6 7 8 3 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 8 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 405 19497 Comparing 231 19271 and 405 19497 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 9 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 3 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 285 sum_lax = 610 Min_lax = 27 The mutated normalized solution of iteration 9 : 1 2 3 4 3 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 9 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 285 19190 Comparing 231 19271 and 285 19190 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 10 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 3 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 3 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 315 sum_lax = 564 Min_lax = 27 The mutated normalized solution of iteration 10 : 1 2 1 3 4 5 6 7 8 9 3 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 10 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 315 19236 Comparing 231 19271 and 315 19236 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 11 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 8 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 11 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 11 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 231 19271 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 12 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 460 Min_lax = 23 The mutated normalized solution of iteration 12 : 1 2 3 4 1 5 6 7 4 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 12 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19340 Comparing 231 19271 and 255 19340 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 13 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 3 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 273 sum_lax = 454 Min_lax = 27 The mutated normalized solution of iteration 13 : 1 2 3 4 1 5 6 3 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 13 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 273 19346 Comparing 231 19271 and 273 19346 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 14 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 7 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 14 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 14 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 231 19271 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 15 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 7 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 15 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 15 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 231 19271 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 16 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 16 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 16 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 17 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 1 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 626 Min_lax = 25 The mutated normalized solution of iteration 17 : 1 2 3 1 4 5 6 7 8 9 1 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 17 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19174 Comparing 231 19271 and 267 19174 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 18 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 460 Min_lax = 23 The mutated normalized solution of iteration 18 : 1 2 3 4 1 5 6 7 4 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 18 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19340 Comparing 231 19271 and 255 19340 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 19 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 634 Min_lax = 27 The mutated normalized solution of iteration 19 : 1 2 3 4 5 6 1 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 19 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19166 Comparing 231 19271 and 243 19166 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 20 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 8 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 3 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 393 sum_lax = 407 Min_lax = 23 The mutated normalized solution of iteration 20 : 1 2 3 4 1 5 6 7 3 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 20 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 393 19393 Comparing 231 19271 and 393 19393 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 21 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 634 Min_lax = 27 The mutated normalized solution of iteration 21 : 1 2 3 4 5 6 1 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 21 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19166 Comparing 231 19271 and 243 19166 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- ------------------ iteration = 22 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 1 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 439 Min_lax = 27 The mutated normalized solution of iteration 22 : 1 2 3 4 1 5 6 1 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 22 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19361 Comparing 231 19271 and 198 19361 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 23 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 3 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 3 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 328 Min_lax = 20 The mutated normalized solution of iteration 23 : 1 2 3 4 1 5 6 1 3 7 4 The hyperperiod of the candidate task set is : 3300 The Anti-Ideal point in the iteration 23 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19472 Comparing 198 19361 and 360 19472 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 24 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 3 2 3 4 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 1 3 4 5 6 4 7 8 3 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 315 sum_lax = 482 Min_lax = 27 The mutated normalized solution of iteration 24 : 1 2 1 3 4 5 6 4 7 8 3 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 24 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 315 19318 Comparing 198 19361 and 315 19318 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 25 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 7 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 4 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 4 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 222 sum_lax = 378 Min_lax = 25 The mutated normalized solution of iteration 25 : 1 2 3 4 1 5 4 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 25 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 222 19422 Comparing 198 19361 and 222 19422 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 26 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 7 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 386 Min_lax = 27 The mutated normalized solution of iteration 26 : 1 2 3 4 1 5 6 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 26 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19414 Comparing 198 19361 and 198 19414 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 27 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 1 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 1 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 388 Min_lax = 27 The mutated normalized solution of iteration 27 : 1 2 3 4 1 5 1 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 27 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19412 Comparing 198 19361 and 198 19412 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 28 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 The mutated solution is : 1 2 3 1 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 1 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 9 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 580 Min_lax = 27 The mutated normalized solution of iteration 28 : 1 2 3 4 5 6 7 1 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 28 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19220 Comparing 198 19361 and 243 19220 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 29 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 6 2 3 4 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 5 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 541 Min_lax = 27 The mutated normalized solution of iteration 29 : 1 2 3 4 5 6 1 5 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 29 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19259 Comparing 198 19361 and 243 19259 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 30 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 4 2 3 4 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 1 4 5 6 4 7 8 1 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 533 Min_lax = 25 The mutated normalized solution of iteration 30 : 1 2 3 1 4 5 6 4 7 8 1 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 30 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19267 Comparing 198 19361 and 267 19267 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 31 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 6 7 The mutated solution is : 1 2 3 3 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 3 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 338 Min_lax = 16 The mutated normalized solution of iteration 31 : 1 2 3 3 1 4 5 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 31 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19462 Comparing 198 19361 and 360 19462 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 32 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 6 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 5 6 5 1 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 424 Min_lax = 27 The mutated normalized solution of iteration 32 : 1 2 3 4 5 6 5 1 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 32 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19376 Comparing 198 19361 and 198 19376 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 33 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 364 Min_lax = 27 The mutated normalized solution of iteration 33 : 1 2 3 4 1 2 5 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 33 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19436 Comparing 198 19361 and 198 19436 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 34 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 364 Min_lax = 27 The mutated normalized solution of iteration 34 : 1 2 3 4 1 2 5 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 34 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19436 Comparing 198 19361 and 198 19436 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 35 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 364 Min_lax = 27 The mutated normalized solution of iteration 35 : 1 2 3 4 1 2 5 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 35 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19436 Comparing 198 19361 and 198 19436 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 36 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 9 2 3 4 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 36 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 36 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 198 19361 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 37 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 364 Min_lax = 27 The mutated normalized solution of iteration 37 : 1 2 3 4 1 2 5 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 37 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19436 Comparing 198 19361 and 198 19436 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 38 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 1 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 1 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 388 Min_lax = 27 The mutated normalized solution of iteration 38 : 1 2 3 4 1 5 1 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 38 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19412 Comparing 198 19361 and 198 19412 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 39 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 7 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 386 Min_lax = 27 The mutated normalized solution of iteration 39 : 1 2 3 4 1 5 6 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 39 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19414 Comparing 198 19361 and 198 19414 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 40 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 The mutated solution is : 1 2 3 1 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 1 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 6 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 386 Min_lax = 27 The mutated normalized solution of iteration 40 : 1 2 3 4 1 5 6 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 40 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19414 Comparing 198 19361 and 198 19414 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 41 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 7 4 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 3 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 328 Min_lax = 20 The mutated normalized solution of iteration 41 : 1 2 3 4 1 5 6 1 3 7 4 The hyperperiod of the candidate task set is : 3300 The Anti-Ideal point in the iteration 41 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19472 Comparing 198 19361 and 360 19472 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 42 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 364 Min_lax = 27 The mutated normalized solution of iteration 42 : 1 2 3 4 1 2 5 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 42 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19436 Comparing 198 19361 and 198 19436 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 43 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 4 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 4 5 6 1 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 364 Min_lax = 27 The mutated normalized solution of iteration 43 : 1 2 3 4 1 2 5 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 43 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19436 Comparing 198 19361 and 198 19436 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 44 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 6 7 The mutated solution is : 1 2 3 3 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 3 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 338 Min_lax = 16 The mutated normalized solution of iteration 44 : 1 2 3 3 1 4 5 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 44 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19462 Comparing 198 19361 and 360 19462 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- ------------------ iteration = 45 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 514 Min_lax = 29 The mutated normalized solution of iteration 45 : 1 2 3 4 1 5 6 1 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 45 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19286 Comparing 198 19361 and 205 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 46 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 6 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 3 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 368 sum_lax = 394 Min_lax = 24 The mutated normalized solution of iteration 46 : 1 2 3 4 1 5 3 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 46 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 368 19406 Comparing 205 19286 and 368 19406 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 47 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 3 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 1 3 4 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 278 sum_lax = 565 Min_lax = 29 The mutated normalized solution of iteration 47 : 1 2 1 3 4 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 47 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 278 19235 Comparing 205 19286 and 278 19235 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 48 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 9 The mutated solution is : 1 2 3 4 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 439 Min_lax = 27 The mutated normalized solution of iteration 48 : 1 2 3 4 1 5 6 1 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 48 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19361 Comparing 205 19286 and 198 19361 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 49 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 7 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 433 Min_lax = 27 The mutated normalized solution of iteration 49 : 1 2 3 4 1 5 6 7 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 49 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19367 Comparing 198 19361 and 198 19367 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 50 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 4 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 222 sum_lax = 370 Min_lax = 23 The mutated normalized solution of iteration 50 : 1 2 3 4 1 5 6 1 4 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 50 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 222 19430 Comparing 198 19361 and 222 19430 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 51 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 4 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 222 sum_lax = 370 Min_lax = 23 The mutated normalized solution of iteration 51 : 1 2 3 4 1 5 6 1 4 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 51 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 222 19430 Comparing 198 19361 and 222 19430 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 52 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 9 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 52 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 52 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 198 19361 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 53 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 1 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 626 Min_lax = 25 The mutated normalized solution of iteration 53 : 1 2 3 1 4 5 6 7 8 9 1 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 53 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19174 Comparing 231 19271 and 267 19174 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 54 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 54 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 54 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 55 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 55 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 55 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 56 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 634 Min_lax = 27 The mutated normalized solution of iteration 56 : 1 2 3 4 5 6 1 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 56 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19166 Comparing 231 19271 and 243 19166 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 57 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 634 Min_lax = 27 The mutated normalized solution of iteration 57 : 1 2 3 4 5 6 1 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 57 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19166 Comparing 231 19271 and 243 19166 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- ------------------ iteration = 58 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 58 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 58 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 231 19271 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 59 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 59 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 59 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 60 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 3 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 60 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 60 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 61 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 61 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 61 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 62 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 7 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 62 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 62 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 234 19193 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 63 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 3 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 699 Min_lax = 21 The mutated normalized solution of iteration 63 : 1 2 3 4 3 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 63 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19101 Comparing 234 19193 and 284 19101 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 64 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 4 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 414 Min_lax = 19 The mutated normalized solution of iteration 64 : 1 2 3 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 64 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19386 Comparing 234 19193 and 360 19386 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 65 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 3 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 414 Min_lax = 19 The mutated normalized solution of iteration 65 : 1 2 3 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 65 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19386 Comparing 234 19193 and 360 19386 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 66 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 66 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 66 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 67 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 8 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 67 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 67 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 68 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 68 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 68 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 69 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 6 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 69 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 69 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 234 19193 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 70 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 70 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 70 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 71 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 7 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 71 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 71 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 72 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 8 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 552 Min_lax = 29 The mutated normalized solution of iteration 72 : 1 2 3 4 1 5 6 7 6 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 72 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19248 Comparing 234 19193 and 234 19248 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 73 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 4 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 249 sum_lax = 544 Min_lax = 27 The mutated normalized solution of iteration 73 : 1 2 3 4 1 5 4 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 73 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 249 19256 Comparing 234 19193 and 249 19256 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 74 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 7 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 74 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 74 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 75 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 3 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 699 Min_lax = 21 The mutated normalized solution of iteration 75 : 1 2 3 4 3 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 75 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19101 Comparing 234 19193 and 284 19101 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 76 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 76 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 76 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 77 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 1 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 6 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 511 Min_lax = 29 The mutated normalized solution of iteration 77 : 1 2 3 4 1 5 6 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 77 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19289 Comparing 234 19193 and 205 19289 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 78 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 7 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 78 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 78 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 79 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 3 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 699 Min_lax = 21 The mutated normalized solution of iteration 79 : 1 2 3 4 3 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 79 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19101 Comparing 234 19193 and 284 19101 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 80 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 80 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 80 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 81 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 81 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 81 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 234 19193 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 82 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 11 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 82 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 82 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 83 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 3 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 83 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 83 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 263 19024 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 84 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 1 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 725 Min_lax = 21 The mutated normalized solution of iteration 84 : 1 2 3 4 5 6 7 8 1 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 84 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19075 Comparing 263 19024 and 263 19075 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 85 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 85 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 85 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 86 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 86 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 86 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 87 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 87 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 87 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 88 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 3 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 3 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 641 Min_lax = 15 The mutated normalized solution of iteration 88 : 1 2 3 4 5 6 3 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 88 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19159 Comparing 263 19024 and 256 19159 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 89 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 11 are: 4 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 9 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 662 Min_lax = 21 The mutated normalized solution of iteration 89 : 1 2 3 4 5 6 7 8 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 89 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19138 Comparing 263 19024 and 255 19138 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 90 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 9 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 594 Min_lax = 21 The mutated normalized solution of iteration 90 : 1 2 3 4 5 6 7 8 5 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 90 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19206 Comparing 263 19024 and 234 19206 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 91 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 3 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 91 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 91 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 92 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 92 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 92 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 93 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 5 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 594 Min_lax = 21 The mutated normalized solution of iteration 93 : 1 2 3 4 5 6 7 8 5 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 93 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19206 Comparing 263 19024 and 234 19206 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 94 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 5 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 94 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 94 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 263 19024 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 95 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 95 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 95 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 96 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 96 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 96 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 234 19193 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 97 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 6 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 249 sum_lax = 544 Min_lax = 27 The mutated normalized solution of iteration 97 : 1 2 3 4 1 5 4 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 97 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 249 19256 Comparing 234 19193 and 249 19256 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 98 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 4 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 98 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 98 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 234 19193 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 99 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 3 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 699 Min_lax = 21 The mutated normalized solution of iteration 99 : 1 2 3 4 3 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 99 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19101 Comparing 234 19193 and 284 19101 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 100 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 6 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 249 sum_lax = 544 Min_lax = 27 The mutated normalized solution of iteration 100 : 1 2 3 4 1 5 4 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 100 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 249 19256 Comparing 234 19193 and 249 19256 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 101 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 6 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 249 sum_lax = 544 Min_lax = 27 The mutated normalized solution of iteration 101 : 1 2 3 4 1 5 4 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 101 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 249 19256 Comparing 234 19193 and 249 19256 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 102 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 3 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 102 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 102 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 103 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 6 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 103 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 103 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 234 19193 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 104 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 104 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 104 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 105 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 105 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 105 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 106 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 106 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 106 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 107 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 8 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 107 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 107 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 108 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 8 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 108 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 108 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 109 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 8 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 109 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 109 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 110 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 110 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 110 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 111 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 1 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 1 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 556 Min_lax = 29 The mutated normalized solution of iteration 111 : 1 2 3 4 1 5 6 7 1 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 111 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19244 Comparing 234 19193 and 234 19244 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 112 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 7 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 112 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 112 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 234 19193 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 113 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 4 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 113 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 113 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 234 19193 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 114 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 114 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 114 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 115 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 11 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 115 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 115 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 116 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 9 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 662 Min_lax = 21 The mutated normalized solution of iteration 116 : 1 2 3 4 5 6 7 8 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 116 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19138 Comparing 263 19024 and 255 19138 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 117 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 9 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 662 Min_lax = 21 The mutated normalized solution of iteration 117 : 1 2 3 4 5 6 7 8 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 117 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19138 Comparing 263 19024 and 255 19138 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 118 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 8 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 118 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 118 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 263 19024 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 119 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 1 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 119 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 119 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 263 19024 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 120 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 9 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 120 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 120 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 121 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 121 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 121 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 122 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 1 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 122 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 122 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 263 19024 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 123 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 3 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 123 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 123 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 234 19193 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 124 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 1 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 514 Min_lax = 29 The mutated normalized solution of iteration 124 : 1 2 3 4 1 5 6 1 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 124 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19286 Comparing 234 19193 and 205 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 125 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 1 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 1 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 461 Min_lax = 29 The mutated normalized solution of iteration 125 : 1 2 3 4 1 5 1 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 125 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19339 Comparing 205 19286 and 205 19339 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 126 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 1 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 1 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 461 Min_lax = 29 The mutated normalized solution of iteration 126 : 1 2 3 4 1 5 1 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 126 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19339 Comparing 205 19286 and 205 19339 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 127 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 127 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 127 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 128 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 10 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 128 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 128 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 205 19286 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 129 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 4 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 3 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 338 Min_lax = 16 The mutated normalized solution of iteration 129 : 1 2 3 3 1 4 5 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 129 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19462 Comparing 205 19286 and 360 19462 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 130 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 10 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 130 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 130 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 205 19286 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 131 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 3 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 131 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 131 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 132 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 132 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 132 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 133 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 1 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 1 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 556 Min_lax = 29 The mutated normalized solution of iteration 133 : 1 2 3 4 1 5 6 7 1 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 133 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19244 Comparing 234 19193 and 234 19244 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 134 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 134 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 134 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 135 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 135 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 135 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 136 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 1 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 514 Min_lax = 29 The mutated normalized solution of iteration 136 : 1 2 3 4 1 5 6 1 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 136 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19286 Comparing 234 19193 and 205 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 137 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 6 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 511 Min_lax = 29 The mutated normalized solution of iteration 137 : 1 2 3 4 1 5 6 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 137 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19289 Comparing 205 19286 and 205 19289 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 138 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 7 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 7 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 459 Min_lax = 29 The mutated normalized solution of iteration 138 : 1 2 3 4 1 5 6 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 138 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19341 Comparing 205 19286 and 205 19341 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 139 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 4 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 236 sum_lax = 443 Min_lax = 25 The mutated normalized solution of iteration 139 : 1 2 3 4 1 5 6 1 4 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 139 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 236 19357 Comparing 205 19286 and 236 19357 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 140 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 4 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 236 sum_lax = 443 Min_lax = 25 The mutated normalized solution of iteration 140 : 1 2 3 4 1 5 6 1 4 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 140 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 236 19357 Comparing 205 19286 and 236 19357 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 141 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 141 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 141 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 142 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 142 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 142 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 143 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 6 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 3 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 368 sum_lax = 394 Min_lax = 24 The mutated normalized solution of iteration 143 : 1 2 3 4 1 5 3 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 143 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 368 19406 Comparing 205 19286 and 368 19406 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 144 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 9 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 6 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 459 Min_lax = 29 The mutated normalized solution of iteration 144 : 1 2 3 4 1 5 6 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 144 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19341 Comparing 205 19286 and 205 19341 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 145 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 7 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 459 Min_lax = 29 The mutated normalized solution of iteration 145 : 1 2 3 4 1 5 6 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 145 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19341 Comparing 205 19286 and 205 19341 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 146 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 146 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 146 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 147 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 4 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 4 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 1 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 1 3 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 368 sum_lax = 402 Min_lax = 24 The mutated normalized solution of iteration 147 : 1 2 1 3 1 4 5 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 147 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 368 19398 Comparing 205 19286 and 368 19398 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 148 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 4 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 4 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 7 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 148 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 148 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 205 19286 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 149 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 3 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 3 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 368 sum_lax = 396 Min_lax = 24 The mutated normalized solution of iteration 149 : 1 2 3 4 1 5 6 1 3 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 149 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 368 19404 Comparing 205 19286 and 368 19404 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 150 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 3 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 150 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 150 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 205 19286 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 151 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 10 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 668 Min_lax = 21 The mutated normalized solution of iteration 151 : 1 2 3 4 5 6 7 1 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 151 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19132 Comparing 205 19286 and 255 19132 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 152 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 7 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 1 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 1 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 461 Min_lax = 29 The mutated normalized solution of iteration 152 : 1 2 3 4 1 5 1 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 152 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19339 Comparing 205 19286 and 205 19339 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 153 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 153 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 153 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 154 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 3 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 3 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 276 sum_lax = 591 Min_lax = 29 The mutated normalized solution of iteration 154 : 1 2 3 4 3 5 6 1 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 154 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 276 19209 Comparing 205 19286 and 276 19209 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 155 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 4 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 3 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 338 Min_lax = 16 The mutated normalized solution of iteration 155 : 1 2 3 3 1 4 5 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 155 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19462 Comparing 205 19286 and 360 19462 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 156 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 6 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 511 Min_lax = 29 The mutated normalized solution of iteration 156 : 1 2 3 4 1 5 6 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 156 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19289 Comparing 205 19286 and 205 19289 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 157 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 157 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 157 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 158 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 7 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 236 sum_lax = 443 Min_lax = 25 The mutated normalized solution of iteration 158 : 1 2 3 4 1 5 6 1 4 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 158 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 236 19357 Comparing 205 19286 and 236 19357 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 159 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 6 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 3 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 368 sum_lax = 394 Min_lax = 24 The mutated normalized solution of iteration 159 : 1 2 3 4 1 5 3 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 159 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 368 19406 Comparing 205 19286 and 368 19406 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 160 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 160 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 160 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 161 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 161 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 161 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 162 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 1 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 1 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 461 Min_lax = 29 The mutated normalized solution of iteration 162 : 1 2 3 4 1 5 1 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 162 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19339 Comparing 205 19286 and 205 19339 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 163 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 3 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 3 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 276 sum_lax = 591 Min_lax = 29 The mutated normalized solution of iteration 163 : 1 2 3 4 3 5 6 1 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 163 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 276 19209 Comparing 205 19286 and 276 19209 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 164 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 4 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 164 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 164 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 205 19286 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 165 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 3 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 165 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 165 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 205 19286 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 166 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 7 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 166 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 166 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 205 19286 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 167 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 7 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 167 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 167 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 205 19286 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 168 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 3 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 3 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 368 sum_lax = 394 Min_lax = 24 The mutated normalized solution of iteration 168 : 1 2 3 4 1 5 3 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 168 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 368 19406 Comparing 205 19286 and 368 19406 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 169 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 7 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 236 sum_lax = 443 Min_lax = 25 The mutated normalized solution of iteration 169 : 1 2 3 4 1 5 6 1 4 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 169 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 236 19357 Comparing 205 19286 and 236 19357 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 170 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 7 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 236 sum_lax = 443 Min_lax = 25 The mutated normalized solution of iteration 170 : 1 2 3 4 1 5 6 1 4 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 170 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 236 19357 Comparing 205 19286 and 236 19357 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 171 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 6 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 511 Min_lax = 29 The mutated normalized solution of iteration 171 : 1 2 3 4 1 5 6 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 171 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19289 Comparing 205 19286 and 205 19289 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 172 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 1 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 1 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 6 7 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 1 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 1 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 3 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 3 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 3 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 6 7 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 4 are: 1 3 4 6 7 9 ................................................................ The 3 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 7 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 1 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 632 Min_lax = 29 The mutated normalized solution of iteration 172 : 1 2 3 4 5 6 7 5 1 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 172 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19168 Comparing 205 19286 and 263 19168 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 173 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 6 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 5 6 5 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 499 Min_lax = 29 The mutated normalized solution of iteration 173 : 1 2 3 4 5 6 5 1 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 173 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19301 Comparing 205 19286 and 205 19301 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 174 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 9 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 1 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 1 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 6 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 4 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 217 sum_lax = 451 Min_lax = 27 The mutated normalized solution of iteration 174 : 1 2 3 4 1 5 4 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 174 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 217 19349 Comparing 205 19286 and 217 19349 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 175 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 4 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 4 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 217 sum_lax = 451 Min_lax = 27 The mutated normalized solution of iteration 175 : 1 2 3 4 1 5 4 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 175 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 217 19349 Comparing 205 19286 and 217 19349 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 176 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 176 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 176 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 177 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 177 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 177 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 178 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 1 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 3 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 1 3 4 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 278 sum_lax = 565 Min_lax = 29 The mutated normalized solution of iteration 178 : 1 2 1 3 4 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 178 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 278 19235 Comparing 205 19286 and 278 19235 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 179 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 6 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 511 Min_lax = 29 The mutated normalized solution of iteration 179 : 1 2 3 4 1 5 6 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 179 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19289 Comparing 205 19286 and 205 19289 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 180 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 7 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 180 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 180 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 205 19286 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 181 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 6 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 3 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 3 5 6 1 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 276 sum_lax = 591 Min_lax = 29 The mutated normalized solution of iteration 181 : 1 2 3 4 3 5 6 1 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 181 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 276 19209 Comparing 205 19286 and 276 19209 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 182 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 2 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 229 sum_lax = 437 Min_lax = 29 The mutated normalized solution of iteration 182 : 1 2 3 4 1 2 5 1 6 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 182 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 229 19363 Comparing 205 19286 and 229 19363 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 183 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 4 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 1 4 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 622 Min_lax = 27 The mutated normalized solution of iteration 183 : 1 2 3 1 4 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 183 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19178 Comparing 205 19286 and 272 19178 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 184 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 7 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 1 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 632 Min_lax = 29 The mutated normalized solution of iteration 184 : 1 2 3 4 5 6 7 5 1 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 184 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19168 Comparing 205 19286 and 263 19168 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 185 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 3 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 1 3 4 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 278 sum_lax = 565 Min_lax = 29 The mutated normalized solution of iteration 185 : 1 2 1 3 4 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 185 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 278 19235 Comparing 205 19286 and 278 19235 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 186 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 6 7 The mutated solution is : 1 2 4 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 3 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 338 Min_lax = 16 The mutated normalized solution of iteration 186 : 1 2 3 3 1 4 5 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 186 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19462 Comparing 205 19286 and 360 19462 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 187 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 4 2 3 4 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 1 4 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 622 Min_lax = 27 The mutated normalized solution of iteration 187 : 1 2 3 1 4 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 187 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19178 Comparing 205 19286 and 272 19178 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 188 ------------------ Objectives of the current solution : 205 19286 The current solution : 1 2 3 4 1 5 6 1 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 90 harmonic_tasks ( 6) = 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 6 7 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 6 7 9 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 9 The mutated solution is : 1 2 3 9 1 5 6 1 7 8 9 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 439 Min_lax = 27 The mutated normalized solution of iteration 188 : 1 2 3 4 1 5 6 1 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 188 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19361 Comparing 205 19286 and 198 19361 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 189 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 The mutated solution is : 1 2 3 7 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 236 sum_lax = 443 Min_lax = 25 The mutated normalized solution of iteration 189 : 1 2 3 4 1 5 6 1 4 7 8 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 189 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 236 19357 Comparing 198 19361 and 236 19357 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 190 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 8 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 3 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 3 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 328 Min_lax = 20 The mutated normalized solution of iteration 190 : 1 2 3 4 1 5 6 1 3 7 4 The hyperperiod of the candidate task set is : 3300 The Anti-Ideal point in the iteration 190 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19472 Comparing 198 19361 and 360 19472 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 191 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 6 7 The mutated solution is : 1 2 3 3 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 3 1 4 5 1 6 7 8 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 338 Min_lax = 16 The mutated normalized solution of iteration 191 : 1 2 3 3 1 4 5 1 6 7 8 The hyperperiod of the candidate task set is : 9900 The Anti-Ideal point in the iteration 191 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19462 Comparing 198 19361 and 360 19462 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 192 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 4 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 222 sum_lax = 370 Min_lax = 23 The mutated normalized solution of iteration 192 : 1 2 3 4 1 5 6 1 4 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 192 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 222 19430 Comparing 198 19361 and 222 19430 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 193 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 The mutated solution is : 9 2 3 4 1 5 6 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 193 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 193 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 198 19361 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 194 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 3 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 273 sum_lax = 454 Min_lax = 27 The mutated normalized solution of iteration 194 : 1 2 3 4 1 5 6 3 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 194 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 273 19346 Comparing 198 19361 and 273 19346 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 195 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 1 4 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 1 4 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 222 sum_lax = 370 Min_lax = 23 The mutated normalized solution of iteration 195 : 1 2 3 4 1 5 6 1 4 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 195 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 222 19430 Comparing 198 19361 and 222 19430 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 196 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 1 1 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 1 1 6 7 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 388 Min_lax = 27 The mutated normalized solution of iteration 196 : 1 2 3 4 1 5 1 1 6 7 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 196 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19412 Comparing 198 19361 and 198 19412 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 197 ------------------ Objectives of the current solution : 198 19361 The current solution : 1 2 3 4 1 5 6 1 7 8 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 8 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 nb_tasks = 8 and The task chosen randomly is : 1 The harmonic tasks with 8 are: 1 3 4 6 7 The mutated solution is : 1 2 3 4 1 5 6 9 7 8 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 197 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 197 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 198 19361 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 198 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 7 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 580 Min_lax = 27 The mutated normalized solution of iteration 198 : 1 2 3 4 5 6 7 1 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 198 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19220 Comparing 231 19271 and 243 19220 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 199 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 8 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 433 Min_lax = 27 The mutated normalized solution of iteration 199 : 1 2 3 4 1 5 6 7 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 199 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19367 Comparing 231 19271 and 198 19367 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 200 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 8 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 3 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 393 sum_lax = 407 Min_lax = 23 The mutated normalized solution of iteration 200 : 1 2 3 4 1 5 6 7 3 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 200 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 393 19393 Comparing 231 19271 and 393 19393 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 201 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 201 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 201 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 202 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 8 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 433 Min_lax = 27 The mutated normalized solution of iteration 202 : 1 2 3 4 1 5 6 7 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 202 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19367 Comparing 231 19271 and 198 19367 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 203 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 7 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 433 Min_lax = 27 The mutated normalized solution of iteration 203 : 1 2 3 4 1 5 6 7 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 203 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19367 Comparing 231 19271 and 198 19367 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 204 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 10 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 204 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 204 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 231 19271 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 205 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 8 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 552 Min_lax = 29 The mutated normalized solution of iteration 205 : 1 2 3 4 1 5 6 7 6 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 205 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19248 Comparing 234 19193 and 234 19248 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 206 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 3 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 206 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 206 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 207 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 1 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 1 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 486 Min_lax = 27 The mutated normalized solution of iteration 207 : 1 2 1 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 207 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19314 Comparing 234 19193 and 384 19314 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 208 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 1 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 10 ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 10 ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 208 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 208 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 234 19193 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 209 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 3 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 3 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 480 Min_lax = 27 The mutated normalized solution of iteration 209 : 1 2 3 4 1 5 6 7 3 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 209 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19320 Comparing 234 19193 and 384 19320 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 210 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 7 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 210 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 210 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 211 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 7 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 211 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 211 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 212 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 10 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 212 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 212 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 234 19193 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 213 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 6 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 476 Min_lax = 27 The mutated normalized solution of iteration 213 : 1 2 3 4 1 5 6 7 6 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 213 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19324 Comparing 231 19271 and 231 19324 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 214 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 460 Min_lax = 23 The mutated normalized solution of iteration 214 : 1 2 3 4 1 5 6 7 4 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 214 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19340 Comparing 231 19271 and 255 19340 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 215 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 1 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 1 3 1 4 5 6 7 8 3 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 393 sum_lax = 413 Min_lax = 23 The mutated normalized solution of iteration 215 : 1 2 1 3 1 4 5 6 7 8 3 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 215 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 393 19387 Comparing 231 19271 and 393 19387 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 216 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 634 Min_lax = 27 The mutated normalized solution of iteration 216 : 1 2 3 4 5 6 1 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 216 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19166 Comparing 231 19271 and 243 19166 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 217 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 217 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 217 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 231 19271 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 218 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 11 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 218 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 218 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 219 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 219 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 219 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 220 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 220 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 220 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 221 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 9 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 594 Min_lax = 21 The mutated normalized solution of iteration 221 : 1 2 3 4 5 6 7 8 5 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 221 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19206 Comparing 263 19024 and 234 19206 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 222 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 1 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 725 Min_lax = 21 The mutated normalized solution of iteration 222 : 1 2 3 4 5 6 7 8 1 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 222 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19075 Comparing 263 19024 and 263 19075 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 223 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 1 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 223 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 223 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 224 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 4 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 224 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 224 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 225 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 1 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 225 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 225 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 263 19024 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 226 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 226 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 226 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 227 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 3 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 414 Min_lax = 19 The mutated normalized solution of iteration 227 : 1 2 3 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 227 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19386 Comparing 234 19193 and 360 19386 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 228 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 3 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 228 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 228 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 229 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 8 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 725 Min_lax = 21 The mutated normalized solution of iteration 229 : 1 2 3 4 5 6 7 8 1 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 229 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19075 Comparing 234 19193 and 263 19075 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 230 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 8 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 230 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 230 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 231 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 6 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 511 Min_lax = 29 The mutated normalized solution of iteration 231 : 1 2 3 4 1 5 6 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 231 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19289 Comparing 234 19193 and 205 19289 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 232 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 8 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 271 sum_lax = 536 Min_lax = 25 The mutated normalized solution of iteration 232 : 1 2 3 4 1 5 6 7 4 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 232 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 271 19264 Comparing 234 19193 and 271 19264 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 233 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 11 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 233 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 233 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 234 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 234 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 234 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 235 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 8 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 662 Min_lax = 21 The mutated normalized solution of iteration 235 : 1 2 3 4 5 6 7 8 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 235 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19138 Comparing 263 19024 and 255 19138 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 236 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 1 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 668 Min_lax = 21 The mutated normalized solution of iteration 236 : 1 2 3 4 5 6 7 1 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 236 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19132 Comparing 263 19024 and 255 19132 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 237 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 237 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 237 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 238 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 11 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 238 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 238 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 239 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 5 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 239 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 239 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 243 19115 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 240 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 240 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 240 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 241 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 241 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 241 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 231 19271 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 242 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 3 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 3 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 480 Min_lax = 27 The mutated normalized solution of iteration 242 : 1 2 3 4 1 5 6 7 3 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 242 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19320 Comparing 234 19193 and 384 19320 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 243 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 6 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 243 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 243 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 234 19193 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 244 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 7 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 668 Min_lax = 21 The mutated normalized solution of iteration 244 : 1 2 3 4 5 6 7 1 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 244 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19132 Comparing 234 19193 and 255 19132 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 245 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 7 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 245 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 245 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 234 19193 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 246 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 246 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 246 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 234 19193 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 247 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 7 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 247 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 247 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 234 19193 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 248 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 248 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 248 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 249 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 6 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 249 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 249 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 250 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 1 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 6 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 552 Min_lax = 29 The mutated normalized solution of iteration 250 : 1 2 3 4 1 5 6 7 6 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 250 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19248 Comparing 234 19193 and 234 19248 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 251 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 251 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 251 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 252 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 7 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 252 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 252 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 253 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 253 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 253 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 234 19193 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 254 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 6 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 254 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 254 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 234 19193 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 255 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 4 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 414 Min_lax = 19 The mutated normalized solution of iteration 255 : 1 2 3 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 255 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19386 Comparing 234 19193 and 360 19386 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 256 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 6 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 256 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 256 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 257 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 257 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 257 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 234 19193 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 258 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 6 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 552 Min_lax = 29 The mutated normalized solution of iteration 258 : 1 2 3 4 1 5 6 7 6 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 258 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19248 Comparing 234 19193 and 234 19248 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 259 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 8 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 259 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 259 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 260 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 8 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 3 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 480 Min_lax = 27 The mutated normalized solution of iteration 260 : 1 2 3 4 1 5 6 7 3 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 260 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19320 Comparing 234 19193 and 384 19320 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 261 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 3 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 699 Min_lax = 21 The mutated normalized solution of iteration 261 : 1 2 3 4 3 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 261 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19101 Comparing 234 19193 and 284 19101 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 262 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 6 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 262 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 262 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 234 19193 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 263 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 8 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 552 Min_lax = 29 The mutated normalized solution of iteration 263 : 1 2 3 4 1 5 6 7 6 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 263 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19248 Comparing 234 19193 and 234 19248 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 264 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 264 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 264 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 234 19193 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 265 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 8 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 265 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 265 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 266 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 4 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 414 Min_lax = 19 The mutated normalized solution of iteration 266 : 1 2 3 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 266 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19386 Comparing 234 19193 and 360 19386 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 267 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 3 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 267 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 267 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 268 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 4 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 268 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 268 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 234 19193 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 269 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 8 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 552 Min_lax = 29 The mutated normalized solution of iteration 269 : 1 2 3 4 1 5 6 7 6 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 269 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19248 Comparing 234 19193 and 234 19248 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 270 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 3 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 270 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 270 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 271 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 1 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 1 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 556 Min_lax = 29 The mutated normalized solution of iteration 271 : 1 2 3 4 1 5 6 7 1 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 271 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19244 Comparing 234 19193 and 234 19244 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 272 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 8 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 272 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 272 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 273 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 10 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 273 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 273 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 234 19193 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 274 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 460 Min_lax = 23 The mutated normalized solution of iteration 274 : 1 2 3 4 1 5 6 7 4 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 274 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19340 Comparing 231 19271 and 255 19340 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 275 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 6 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 476 Min_lax = 27 The mutated normalized solution of iteration 275 : 1 2 3 4 1 5 6 7 6 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 275 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19324 Comparing 231 19271 and 231 19324 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 276 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 6 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 634 Min_lax = 27 The mutated normalized solution of iteration 276 : 1 2 3 4 5 6 1 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 276 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19166 Comparing 231 19271 and 243 19166 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 277 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 277 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 277 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 231 19271 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 278 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 3 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 278 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 278 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 234 19193 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 279 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 7 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 205 sum_lax = 508 Min_lax = 29 The mutated normalized solution of iteration 279 : 1 2 3 4 1 5 6 7 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 279 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 205 19292 Comparing 234 19193 and 205 19292 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 280 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 280 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 280 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 234 19193 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 281 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 11 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 281 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 281 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 282 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 4 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 282 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 282 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 283 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 4 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 283 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 283 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 284 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 284 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 284 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 285 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 7 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 3 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 641 Min_lax = 15 The mutated normalized solution of iteration 285 : 1 2 3 4 5 6 3 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 285 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19159 Comparing 263 19024 and 256 19159 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 286 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 3 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 3 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 641 Min_lax = 15 The mutated normalized solution of iteration 286 : 1 2 3 4 5 6 3 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 286 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19159 Comparing 263 19024 and 256 19159 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 287 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 287 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 287 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 288 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 5 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 288 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 288 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 263 19024 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 289 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 1 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 289 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 289 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 263 19024 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 290 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 290 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 290 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 291 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 3 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 291 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 291 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 292 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 292 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 292 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 293 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 6 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 293 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 293 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 234 19193 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 294 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 7 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 294 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 294 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 234 19193 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 295 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 6 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 295 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 295 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 296 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 3 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 296 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 296 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 234 19193 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 297 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 1 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 1 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 556 Min_lax = 29 The mutated normalized solution of iteration 297 : 1 2 3 4 1 5 6 7 1 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 297 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19244 Comparing 234 19193 and 234 19244 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 298 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 3 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 298 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 298 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 234 19193 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 299 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 11 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 299 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 299 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 300 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 11 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 300 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 300 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 301 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 5 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 301 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 301 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 243 19115 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 302 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 8 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 302 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 302 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 243 19115 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 303 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 9 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 636 Min_lax = 27 The mutated normalized solution of iteration 303 : 1 2 3 4 5 6 7 8 1 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 303 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19164 Comparing 243 19115 and 243 19164 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 304 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 8 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 577 Min_lax = 27 The mutated normalized solution of iteration 304 : 1 2 3 4 5 6 7 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 304 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19223 Comparing 243 19115 and 243 19223 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 305 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 1 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 636 Min_lax = 27 The mutated normalized solution of iteration 305 : 1 2 3 4 5 6 7 8 1 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 305 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19164 Comparing 243 19115 and 243 19164 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 306 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 9 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 4 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 291 sum_lax = 709 Min_lax = 25 The mutated normalized solution of iteration 306 : 1 2 3 4 5 6 7 8 4 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 306 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 291 19091 Comparing 243 19115 and 291 19091 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 307 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 3 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 3 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 285 sum_lax = 595 Min_lax = 27 The mutated normalized solution of iteration 307 : 1 2 3 4 5 6 7 3 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 307 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 285 19205 Comparing 243 19115 and 285 19205 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 308 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 514 Min_lax = 27 The mutated normalized solution of iteration 308 : 1 2 3 4 5 6 5 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 308 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19286 Comparing 243 19115 and 231 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 309 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 3 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 315 sum_lax = 558 Min_lax = 27 The mutated normalized solution of iteration 309 : 1 2 3 4 5 6 7 8 3 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 309 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 315 19242 Comparing 243 19115 and 315 19242 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 310 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 9 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 636 Min_lax = 27 The mutated normalized solution of iteration 310 : 1 2 3 4 5 6 7 8 1 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 310 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19164 Comparing 243 19115 and 243 19164 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 311 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 311 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 311 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 312 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 8 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 577 Min_lax = 27 The mutated normalized solution of iteration 312 : 1 2 3 4 5 6 7 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 312 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19223 Comparing 243 19115 and 243 19223 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 313 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 514 Min_lax = 27 The mutated normalized solution of iteration 313 : 1 2 3 4 5 6 5 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 313 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19286 Comparing 243 19115 and 231 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 314 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 5 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 314 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 314 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 243 19115 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 315 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 6 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 476 Min_lax = 27 The mutated normalized solution of iteration 315 : 1 2 3 4 1 5 6 7 6 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 315 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19324 Comparing 231 19271 and 231 19324 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 316 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 7 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 316 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 316 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 231 19271 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 317 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 10 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 317 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 317 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 231 19271 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 318 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 5 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 318 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 318 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 243 19115 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 319 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 9 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 315 sum_lax = 558 Min_lax = 27 The mutated normalized solution of iteration 319 : 1 2 3 4 5 6 7 8 3 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 319 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 315 19242 Comparing 243 19115 and 315 19242 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 320 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 634 Min_lax = 27 The mutated normalized solution of iteration 320 : 1 2 3 4 5 6 1 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 320 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19166 Comparing 243 19115 and 243 19166 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 321 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 321 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 321 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 322 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 7 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 7 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 632 Min_lax = 27 The mutated normalized solution of iteration 322 : 1 2 3 4 5 6 7 8 7 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 322 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19168 Comparing 243 19115 and 243 19168 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 323 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 8 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 3 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 285 sum_lax = 595 Min_lax = 27 The mutated normalized solution of iteration 323 : 1 2 3 4 5 6 7 3 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 323 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 285 19205 Comparing 243 19115 and 285 19205 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 324 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 9 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 324 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 324 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 243 19115 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 325 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 7 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 3 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 315 sum_lax = 556 Min_lax = 27 The mutated normalized solution of iteration 325 : 1 2 3 4 5 6 3 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 325 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 315 19244 Comparing 243 19115 and 315 19244 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 326 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 326 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 326 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 243 19115 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 327 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 8 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 327 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 327 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 328 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 1 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 328 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 328 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 263 19024 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 329 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 6 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 329 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 329 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 330 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 10 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 330 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 330 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 234 19193 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 331 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 6 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 249 sum_lax = 544 Min_lax = 27 The mutated normalized solution of iteration 331 : 1 2 3 4 1 5 4 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 331 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 249 19256 Comparing 231 19271 and 249 19256 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 332 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 332 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 332 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 333 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 1 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 1 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 333 : 1 2 3 4 1 5 1 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 333 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19322 Comparing 231 19271 and 231 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 334 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 7 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 334 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 334 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 231 19271 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 335 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 4 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 4 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 460 Min_lax = 23 The mutated normalized solution of iteration 335 : 1 2 3 4 1 5 6 7 4 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 335 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19340 Comparing 231 19271 and 255 19340 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 336 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 6 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 436 Min_lax = 27 The mutated normalized solution of iteration 336 : 1 2 3 4 1 5 6 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 336 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19364 Comparing 231 19271 and 198 19364 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 337 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 7 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 337 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 337 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 231 19271 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 338 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 8 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 3 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 393 sum_lax = 407 Min_lax = 23 The mutated normalized solution of iteration 338 : 1 2 3 4 1 5 6 7 3 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 338 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 393 19393 Comparing 231 19271 and 393 19393 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 339 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 3 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 414 Min_lax = 19 The mutated normalized solution of iteration 339 : 1 2 3 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 339 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19386 Comparing 231 19271 and 360 19386 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 340 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 7 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 340 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 340 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 231 19271 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 341 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 8 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 341 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 341 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 231 19271 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 342 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 342 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 342 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 231 19271 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 343 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 90 harmonic_tasks ( 7) = 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 6 7 8 10 The mutated solution is : 1 2 3 6 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 249 sum_lax = 544 Min_lax = 27 The mutated normalized solution of iteration 343 : 1 2 3 4 1 5 4 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 343 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 249 19256 Comparing 234 19193 and 249 19256 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 344 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 344 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 344 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 345 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 345 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 345 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 346 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 8 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 552 Min_lax = 29 The mutated normalized solution of iteration 346 : 1 2 3 4 1 5 6 7 6 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 346 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19248 Comparing 234 19193 and 234 19248 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 347 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 4 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 347 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 347 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 234 19193 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 348 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 11 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 348 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 348 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 349 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 349 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 349 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 350 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 5 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 350 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 350 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 263 19024 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 351 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 7 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 4 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 23 The mutated normalized solution of iteration 351 : 1 2 3 4 5 6 4 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 351 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 263 19024 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 352 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 4 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 352 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 352 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 263 19024 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 353 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 3 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 3 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 686 Min_lax = 21 The mutated normalized solution of iteration 353 : 1 2 3 4 5 6 7 3 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 353 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19114 Comparing 263 19024 and 284 19114 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 354 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 5 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 354 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 354 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 355 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 3 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 273 sum_lax = 601 Min_lax = 11 The mutated normalized solution of iteration 355 : 1 2 3 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 355 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 273 19199 Comparing 263 19024 and 273 19199 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 356 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 356 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 356 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 357 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 11 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 357 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 357 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 358 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 9 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 358 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 358 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 243 19115 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 359 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 359 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 359 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 360 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 9 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 7 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 632 Min_lax = 27 The mutated normalized solution of iteration 360 : 1 2 3 4 5 6 7 8 7 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 360 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19168 Comparing 243 19115 and 243 19168 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 361 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 5 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 361 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 361 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 243 19115 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 362 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 362 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 362 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 243 19115 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 363 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 7 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 3 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 641 Min_lax = 15 The mutated normalized solution of iteration 363 : 1 2 3 4 5 6 3 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 363 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19159 Comparing 263 19024 and 256 19159 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 364 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 364 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 364 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 365 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 8 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 665 Min_lax = 21 The mutated normalized solution of iteration 365 : 1 2 3 4 5 6 7 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 365 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19135 Comparing 263 19024 and 255 19135 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 366 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 8 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 662 Min_lax = 21 The mutated normalized solution of iteration 366 : 1 2 3 4 5 6 7 8 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 366 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19138 Comparing 263 19024 and 255 19138 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 367 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 9 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 367 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 367 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 368 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 368 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 368 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 369 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 9 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 725 Min_lax = 21 The mutated normalized solution of iteration 369 : 1 2 3 4 5 6 7 8 1 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 369 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19075 Comparing 263 19024 and 263 19075 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 370 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 8 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 370 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 370 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 371 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 371 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 371 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 372 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 5 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 372 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 372 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 263 19024 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 373 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 1 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 725 Min_lax = 21 The mutated normalized solution of iteration 373 : 1 2 3 4 5 6 7 8 1 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 373 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19075 Comparing 263 19024 and 263 19075 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 374 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 374 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 374 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 375 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 375 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 375 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 376 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 5 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 699 Min_lax = 21 The mutated normalized solution of iteration 376 : 1 2 3 4 3 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 376 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19101 Comparing 263 19024 and 284 19101 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 377 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 1 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 377 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 377 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 378 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 11 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 378 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 378 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 379 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 379 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 379 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 243 19115 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 380 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 4 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 4 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 291 sum_lax = 709 Min_lax = 25 The mutated normalized solution of iteration 380 : 1 2 3 4 5 6 7 8 4 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 380 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 291 19091 Comparing 263 19024 and 291 19091 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 381 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 9 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 7 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 721 Min_lax = 21 The mutated normalized solution of iteration 381 : 1 2 3 4 5 6 7 8 7 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 381 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19079 Comparing 263 19024 and 263 19079 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 382 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 9 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 594 Min_lax = 21 The mutated normalized solution of iteration 382 : 1 2 3 4 5 6 7 8 5 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 382 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19206 Comparing 263 19024 and 234 19206 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 383 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 3 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 273 sum_lax = 601 Min_lax = 11 The mutated normalized solution of iteration 383 : 1 2 3 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 383 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 273 19199 Comparing 263 19024 and 273 19199 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 384 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 9 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 662 Min_lax = 21 The mutated normalized solution of iteration 384 : 1 2 3 4 5 6 7 8 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 384 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19138 Comparing 263 19024 and 255 19138 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 385 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 8 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 385 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 385 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 263 19024 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 386 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 5 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 386 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 386 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 387 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 11 are: 4 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 9 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 662 Min_lax = 21 The mutated normalized solution of iteration 387 : 1 2 3 4 5 6 7 8 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 387 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19138 Comparing 263 19024 and 255 19138 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 388 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 388 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 388 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 389 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 3 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 389 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 389 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 263 19024 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 390 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 8 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 668 Min_lax = 21 The mutated normalized solution of iteration 390 : 1 2 3 4 5 6 7 1 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 390 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19132 Comparing 263 19024 and 255 19132 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 391 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 9 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 4 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 291 sum_lax = 709 Min_lax = 25 The mutated normalized solution of iteration 391 : 1 2 3 4 5 6 7 8 4 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 391 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 291 19091 Comparing 263 19024 and 291 19091 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 392 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 11 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 392 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 392 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 393 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 1 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 393 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 393 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 243 19115 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 394 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 10 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 394 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 394 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 231 19271 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 395 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 8 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 577 Min_lax = 27 The mutated normalized solution of iteration 395 : 1 2 3 4 5 6 7 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 395 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19223 Comparing 243 19115 and 243 19223 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 396 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 4 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 565 Min_lax = 24 The mutated normalized solution of iteration 396 : 1 2 3 4 5 6 7 4 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 396 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19235 Comparing 243 19115 and 267 19235 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 397 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 9 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 397 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 397 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 243 19115 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 398 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 8 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 577 Min_lax = 27 The mutated normalized solution of iteration 398 : 1 2 3 4 5 6 7 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 398 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19223 Comparing 243 19115 and 243 19223 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 399 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 1 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 399 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 399 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 243 19115 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 400 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 4 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 468 Min_lax = 25 The mutated normalized solution of iteration 400 : 1 2 3 4 1 5 4 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 400 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19332 Comparing 231 19271 and 255 19332 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 401 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 7 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 8 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 476 Min_lax = 27 The mutated normalized solution of iteration 401 : 1 2 3 4 1 5 6 7 6 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 401 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19324 Comparing 231 19271 and 231 19324 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 402 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 402 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 402 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 231 19271 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 403 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 7 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 3 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 530 Min_lax = 29 The mutated normalized solution of iteration 403 : 1 2 3 4 1 5 6 3 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 403 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19270 Comparing 234 19193 and 255 19270 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 404 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 404 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 404 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 234 19193 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 405 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 5 The mutated solution is : 1 2 3 4 1 2 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 526 Min_lax = 29 The mutated normalized solution of iteration 405 : 1 2 3 4 1 2 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 405 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19274 Comparing 234 19193 and 234 19274 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 406 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 1 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 1 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 556 Min_lax = 29 The mutated normalized solution of iteration 406 : 1 2 3 4 1 5 6 7 1 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 406 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19244 Comparing 234 19193 and 234 19244 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 407 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 4 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 6 4 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 496 Min_lax = 26 The mutated normalized solution of iteration 407 : 1 2 3 4 1 5 6 4 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 407 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19304 Comparing 234 19193 and 234 19304 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 408 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 3 2 3 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 408 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 408 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 234 19193 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 409 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 11 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 409 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 409 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 410 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 4 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 410 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 410 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 263 19024 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 411 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 3 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 649 Min_lax = 3 The mutated normalized solution of iteration 411 : 1 2 1 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 411 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19151 Comparing 263 19024 and 256 19151 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 412 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 9 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 725 Min_lax = 21 The mutated normalized solution of iteration 412 : 1 2 3 4 5 6 7 8 1 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 412 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19075 Comparing 263 19024 and 263 19075 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 413 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 3 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 413 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 413 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 414 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 3 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 414 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 414 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 415 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 11 are: 4 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 5 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 415 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 415 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 263 19024 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 416 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 8 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 416 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 416 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 417 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 9 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 417 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 417 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 418 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 418 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 418 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 419 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 8 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 419 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 419 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 263 19024 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 420 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 11 are: 4 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 8 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 255 sum_lax = 665 Min_lax = 21 The mutated normalized solution of iteration 420 : 1 2 3 4 5 6 7 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 420 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 255 19135 Comparing 263 19024 and 255 19135 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 421 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 421 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 421 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 422 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 3 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 3 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 284 sum_lax = 686 Min_lax = 21 The mutated normalized solution of iteration 422 : 1 2 3 4 5 6 7 3 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 422 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 284 19114 Comparing 263 19024 and 284 19114 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 423 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 8 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 423 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 423 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 424 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 4 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 424 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 424 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 425 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 11 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 425 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 425 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 426 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 4 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is NOT schedulable** ................................................................ The 2 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 426 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 426 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 427 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 8 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 427 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 427 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 243 19115 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 428 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 428 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 428 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 429 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 429 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 429 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 430 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 4 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 4 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 626 Min_lax = 25 The mutated normalized solution of iteration 430 : 1 2 3 4 5 6 4 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 430 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19174 Comparing 243 19115 and 267 19174 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 431 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 8 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 580 Min_lax = 27 The mutated normalized solution of iteration 431 : 1 2 3 4 5 6 7 1 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 431 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19220 Comparing 243 19115 and 243 19220 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 432 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 9 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 7 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 632 Min_lax = 27 The mutated normalized solution of iteration 432 : 1 2 3 4 5 6 7 8 7 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 432 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19168 Comparing 243 19115 and 243 19168 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 433 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 5 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 306 sum_lax = 493 Min_lax = 60 The mutated normalized solution of iteration 433 : 1 2 3 4 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 433 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 306 19307 Comparing 243 19115 and 306 19307 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 434 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 11 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 434 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 434 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 243 19115 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 435 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 4 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 435 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 435 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 436 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 9 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 436 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 436 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 437 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 4 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 437 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 437 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 263 19024 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 438 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 9 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 1 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 725 Min_lax = 21 The mutated normalized solution of iteration 438 : 1 2 3 4 5 6 7 8 1 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 438 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19075 Comparing 263 19024 and 263 19075 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 439 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 4 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 273 sum_lax = 601 Min_lax = 11 The mutated normalized solution of iteration 439 : 1 2 3 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 439 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 273 19199 Comparing 263 19024 and 273 19199 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 440 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 5 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 594 Min_lax = 21 The mutated normalized solution of iteration 440 : 1 2 3 4 5 6 7 8 5 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 440 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19206 Comparing 263 19024 and 234 19206 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 441 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 8 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 4 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 281 sum_lax = 653 Min_lax = 24 The mutated normalized solution of iteration 441 : 1 2 3 4 5 6 7 4 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 441 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 281 19147 Comparing 263 19024 and 281 19147 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 442 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 4 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 4 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 291 sum_lax = 709 Min_lax = 25 The mutated normalized solution of iteration 442 : 1 2 3 4 5 6 7 8 4 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 442 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 291 19091 Comparing 263 19024 and 291 19091 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 443 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 9 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 4 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 291 sum_lax = 709 Min_lax = 25 The mutated normalized solution of iteration 443 : 1 2 3 4 5 6 7 8 4 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 443 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 291 19091 Comparing 263 19024 and 291 19091 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 444 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 444 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 444 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 445 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 4 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 4 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 23 The mutated normalized solution of iteration 445 : 1 2 3 4 5 6 4 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 445 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 263 19024 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 446 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 11 are: 4 11 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 11 are: 4 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 10 are: 10 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 5 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 607 Min_lax = 21 The mutated normalized solution of iteration 446 : 1 2 3 4 1 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 446 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19193 Comparing 263 19024 and 234 19193 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 447 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 7 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 3 are: 1 3 4 6 7 8 The mutated solution is : 1 2 6 4 1 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 384 sum_lax = 478 Min_lax = 27 The mutated normalized solution of iteration 447 : 1 2 3 4 1 5 3 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 447 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 384 19322 Comparing 234 19193 and 384 19322 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 448 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 1 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 1 5 1 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 554 Min_lax = 29 The mutated normalized solution of iteration 448 : 1 2 3 4 1 5 1 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 448 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19246 Comparing 234 19193 and 234 19246 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 449 ------------------ Objectives of the current solution : 234 19193 The current solution : 1 2 3 4 1 5 6 7 8 9 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 11 5 6 7 8 9 10 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 449 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 449 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 234 19193 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 450 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 period_fn = 90 period_j = 90 harmonic_tasks ( 2) = 11 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 11 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 450 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 450 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 263 19024 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 451 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 451 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 451 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 452 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 452 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 452 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 453 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 8 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 574 Min_lax = 27 The mutated normalized solution of iteration 453 : 1 2 3 4 5 6 7 8 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 453 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19226 Comparing 243 19115 and 243 19226 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 454 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 454 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 454 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 455 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 3 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 285 sum_lax = 610 Min_lax = 27 The mutated normalized solution of iteration 455 : 1 2 3 4 3 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 455 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 285 19190 Comparing 243 19115 and 285 19190 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 456 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 5 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 529 Min_lax = 27 The mutated normalized solution of iteration 456 : 1 2 3 4 1 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 456 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19271 Comparing 243 19115 and 231 19271 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 457 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 457 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 457 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 458 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 3 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 1 3 4 5 6 7 8 9 3 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 315 sum_lax = 564 Min_lax = 27 The mutated normalized solution of iteration 458 : 1 2 1 3 4 5 6 7 8 9 3 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 458 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 315 19236 Comparing 231 19271 and 315 19236 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 459 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 4 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 3 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 3 1 4 5 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 360 sum_lax = 414 Min_lax = 19 The mutated normalized solution of iteration 459 : 1 2 3 3 1 4 5 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 459 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 360 19386 Comparing 231 19271 and 360 19386 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 460 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 3 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 3 5 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 285 sum_lax = 610 Min_lax = 27 The mutated normalized solution of iteration 460 : 1 2 3 4 3 5 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 460 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 285 19190 Comparing 231 19271 and 285 19190 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 461 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 6 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 514 Min_lax = 27 The mutated normalized solution of iteration 461 : 1 2 3 4 5 6 5 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 461 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19286 Comparing 231 19271 and 231 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 462 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 30 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 4 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 6 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 4 6 7 8 9 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 249 sum_lax = 544 Min_lax = 27 The mutated normalized solution of iteration 462 : 1 2 3 4 1 5 4 6 7 8 9 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 462 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 249 19256 Comparing 231 19271 and 249 19256 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 463 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 9 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 9 are: 1 3 4 6 7 8 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 6 7 8 The mutated solution is : 4 2 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 1 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 626 Min_lax = 25 The mutated normalized solution of iteration 463 : 1 2 3 1 4 5 6 7 8 9 1 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 463 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19174 Comparing 231 19271 and 267 19174 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 464 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 7 3 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 3 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 393 sum_lax = 407 Min_lax = 23 The mutated normalized solution of iteration 464 : 1 2 3 4 1 5 6 7 3 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 464 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 393 19393 Comparing 231 19271 and 393 19393 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 465 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 5 The mutated solution is : 1 5 3 4 1 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 2 5 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 448 Min_lax = 27 The mutated normalized solution of iteration 465 : 1 2 3 4 1 2 5 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 465 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19352 Comparing 231 19271 and 231 19352 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 466 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 5 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 5 nb_tasks = 9 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 5 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 3 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 3 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 393 sum_lax = 405 Min_lax = 23 The mutated normalized solution of iteration 466 : 1 2 3 4 1 5 3 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 466 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 393 19395 Comparing 231 19271 and 393 19395 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 467 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 9 nb_tasks = 9 and The task chosen randomly is : 9 The harmonic tasks with 10 are: 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 6 The harmonic tasks with 8 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 6 6 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 6 7 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 198 sum_lax = 436 Min_lax = 27 The mutated normalized solution of iteration 467 : 1 2 3 4 1 5 6 6 7 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 467 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 198 19364 Comparing 231 19271 and 198 19364 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 468 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 60 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 8 The harmonic tasks with 7 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 1 5 8 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 1 5 6 7 6 8 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 476 Min_lax = 27 The mutated normalized solution of iteration 468 : 1 2 3 4 1 5 6 7 6 8 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 468 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19324 Comparing 231 19271 and 231 19324 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 469 ------------------ Objectives of the current solution : 231 19271 The current solution : 1 2 3 4 1 5 6 7 8 9 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 60 harmonic_tasks ( 4) = 6 period_fn = 120 period_j = 120 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 60 harmonic_tasks ( 6) = 8 nb_tasks = 9 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 6 7 8 nb_tasks = 9 and The task chosen randomly is : 1 The harmonic tasks with 5 are: 1 3 4 6 7 8 The mutated solution is : 1 2 3 4 10 5 6 7 8 9 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 685 Min_lax = 23 The mutated normalized solution of iteration 469 : 1 2 3 4 5 6 7 8 9 10 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 469 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19115 Comparing 231 19271 and 243 19115 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 470 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 514 Min_lax = 27 The mutated normalized solution of iteration 470 : 1 2 3 4 5 6 5 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 470 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19286 Comparing 243 19115 and 231 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 471 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 5 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 471 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 471 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 243 19115 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 472 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 8 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 472 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 472 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 243 19115 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 473 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 7 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 3 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 315 sum_lax = 556 Min_lax = 27 The mutated normalized solution of iteration 473 : 1 2 3 4 5 6 3 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 473 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 315 19244 Comparing 243 19115 and 315 19244 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 474 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 4 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 4 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 626 Min_lax = 25 The mutated normalized solution of iteration 474 : 1 2 3 4 5 6 4 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 474 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19174 Comparing 243 19115 and 267 19174 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 475 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 4 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 4 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 267 sum_lax = 626 Min_lax = 25 The mutated normalized solution of iteration 475 : 1 2 3 4 5 6 4 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 475 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 267 19174 Comparing 243 19115 and 267 19174 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 476 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 476 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 476 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 477 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 8 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 3 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 285 sum_lax = 595 Min_lax = 27 The mutated normalized solution of iteration 477 : 1 2 3 4 5 6 7 3 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 477 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 285 19205 Comparing 243 19115 and 285 19205 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 478 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 5 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 478 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 478 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 243 19115 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 479 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 479 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 479 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 480 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 8 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 592 Min_lax = 27 The mutated normalized solution of iteration 480 : 1 2 3 4 5 6 7 5 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 480 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19208 Comparing 243 19115 and 243 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 481 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 7 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 4 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 23 The mutated normalized solution of iteration 481 : 1 2 3 4 5 6 4 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 481 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 243 19115 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 482 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 8 2 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 1 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 580 Min_lax = 27 The mutated normalized solution of iteration 482 : 1 2 3 4 5 6 7 1 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 482 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19220 Comparing 243 19115 and 243 19220 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 483 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 6 The harmonic tasks with 2 are: 2 6 The mutated solution is : 1 6 3 4 5 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 589 Min_lax = 27 The mutated normalized solution of iteration 483 : 1 2 3 4 5 2 6 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 483 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19211 Comparing 243 19115 and 243 19211 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 484 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 5 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 5 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 7 6 7 8 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 514 Min_lax = 27 The mutated normalized solution of iteration 484 : 1 2 3 4 5 6 5 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 484 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19286 Comparing 243 19115 and 231 19286 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 485 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 10 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 10 period_fn = 100 period_j = 100 harmonic_tasks ( 1) = 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 8 The harmonic tasks with 10 are: 10 nb_tasks = 10 and The task chosen randomly is : 10 The harmonic tasks with 10 are: 10 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 7 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 7 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 243 sum_lax = 577 Min_lax = 27 The mutated normalized solution of iteration 485 : 1 2 3 4 5 6 7 7 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 485 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 243 19223 Comparing 243 19115 and 243 19223 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 486 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 5 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 5 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 231 sum_lax = 516 Min_lax = 27 The mutated normalized solution of iteration 486 : 1 2 3 4 5 6 7 8 5 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 486 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 231 19284 Comparing 243 19115 and 231 19284 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 487 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 3 9 10 4 After normalization the candidate solution is : 1 2 3 4 5 6 7 3 8 9 4 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 285 sum_lax = 595 Min_lax = 27 The mutated normalized solution of iteration 487 : 1 2 3 4 5 6 7 3 8 9 4 The hyperperiod of the candidate task set is : 6600 The Anti-Ideal point in the iteration 487 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 285 19205 Comparing 243 19115 and 285 19205 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 488 ------------------ Objectives of the current solution : 243 19115 The current solution : 1 2 3 4 5 6 7 8 9 10 4 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 11 period_fn = 90 period_j = 30 harmonic_tasks ( 1) = 4 nb_tasks = 10 and The task chosen randomly is : 9 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 7 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 1 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 5 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 3 The harmonic tasks with 11 are: 4 nb_tasks = 10 and The task chosen randomly is : 4 The harmonic tasks with 11 are: 4 The mutated solution is : 1 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 9 10 11 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 776 Min_lax = 6 The mutated normalized solution of iteration 488 : 1 2 3 4 5 6 7 8 9 10 11 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 488 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19024 Comparing 243 19115 and 263 19024 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 489 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 5 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 5 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 234 sum_lax = 592 Min_lax = 21 The mutated normalized solution of iteration 489 : 1 2 3 4 5 6 5 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 489 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 234 19208 Comparing 263 19024 and 234 19208 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 490 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 9 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 7 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 721 Min_lax = 21 The mutated normalized solution of iteration 490 : 1 2 3 4 5 6 7 8 7 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 490 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19079 Comparing 263 19024 and 263 19079 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 491 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 4 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 1 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 27 The mutated normalized solution of iteration 491 : 1 2 3 1 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 491 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 263 19024 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 492 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 6 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 3 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 3 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 4 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 3 4 5 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 273 sum_lax = 601 Min_lax = 11 The mutated normalized solution of iteration 492 : 1 2 3 3 4 5 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 492 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 273 19199 Comparing 263 19024 and 273 19199 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 493 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 6 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 493 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 493 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 494 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 9 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 9 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 8 3 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 8 3 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 643 Min_lax = 15 The mutated normalized solution of iteration 494 : 1 2 3 4 5 6 7 8 3 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 494 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19157 Comparing 263 19024 and 256 19157 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 495 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 495 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 495 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 496 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 1 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 6 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 1 are: 1 3 4 5 7 8 9 The mutated solution is : 7 2 3 4 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 1 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 723 Min_lax = 21 The mutated normalized solution of iteration 496 : 1 2 3 4 5 6 1 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 496 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19077 Comparing 263 19024 and 263 19077 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 497 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 8 period_fn = 120 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 120 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 120 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 120 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 120 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 120 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 120 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 8 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 7 5 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 7 5 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 683 Min_lax = 21 The mutated normalized solution of iteration 497 : 1 2 3 4 5 6 7 5 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 497 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19117 Comparing 263 19024 and 263 19117 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 498 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 6 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 6 are: 2 6 The mutated solution is : 1 2 3 4 5 2 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 2 6 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 263 sum_lax = 680 Min_lax = 21 The mutated normalized solution of iteration 498 : 1 2 3 4 5 2 6 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 498 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 263 19120 Comparing 263 19024 and 263 19120 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 499 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 4 period_fn = 30 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 30 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 30 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 30 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 30 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 30 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 30 period_j = 60 harmonic_tasks ( 7) = 9 period_fn = 30 period_j = 90 harmonic_tasks ( 8) = 11 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 4 are: 1 3 4 5 7 8 9 11 The mutated solution is : 1 2 3 7 5 6 7 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 4 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 272 sum_lax = 715 Min_lax = 23 The mutated normalized solution of iteration 499 : 1 2 3 4 5 6 4 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 499 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 272 19085 Comparing 263 19024 and 272 19085 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ------------------ iteration = 500 ------------------ Objectives of the current solution : 263 19024 The current solution : 1 2 3 4 5 6 7 8 9 10 11 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 2 period_fn = 110 period_j = 110 harmonic_tasks ( 1) = 2 period_fn = 110 period_j = 110 harmonic_tasks ( 2) = 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 9 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 4 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 7 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 11 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 10 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 8 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 5 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 1 The harmonic tasks with 2 are: 2 6 nb_tasks = 11 and The task chosen randomly is : 2 The harmonic tasks with 2 are: 2 6 ................................................................ The 1 attempt of the mutation procedure ................................................................ The randomly chosen function is : 7 period_fn = 60 period_j = 60 harmonic_tasks ( 1) = 1 period_fn = 60 period_j = 120 harmonic_tasks ( 2) = 3 period_fn = 60 period_j = 30 harmonic_tasks ( 3) = 4 period_fn = 60 period_j = 120 harmonic_tasks ( 4) = 5 period_fn = 60 period_j = 60 harmonic_tasks ( 5) = 7 period_fn = 60 period_j = 120 harmonic_tasks ( 6) = 8 period_fn = 60 period_j = 60 harmonic_tasks ( 7) = 9 nb_tasks = 11 and The task chosen randomly is : 3 The harmonic tasks with 7 are: 1 3 4 5 7 8 9 The mutated solution is : 1 2 3 4 5 6 3 8 9 10 11 After normalization the candidate solution is : 1 2 3 4 5 6 3 7 8 9 10 The candidate solution is consistent and then we check the schedulability **The candidate task set is schedulable** Nb_preemptions = 256 sum_lax = 641 Min_lax = 15 The mutated normalized solution of iteration 500 : 1 2 3 4 5 6 3 7 8 9 10 The hyperperiod of the candidate task set is : 19800 The Anti-Ideal point in the iteration 500 is : Z1_anti_ideal = 4.05000E+02 Z2_anti_ideal = 1.94970E+04 Objectives of the mutated solution : 256 19159 Comparing 263 19024 and 256 19159 The genetic material in the archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : | Number of preemptions = 263 | sum_lax = 776 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : | Number of preemptions = 243 | sum_lax = 685 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : | Number of preemptions = 231 | sum_lax = 529 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : | Number of preemptions = 198 | sum_lax = 439 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : | Number of preemptions = 205 | sum_lax = 514 --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : | Number of preemptions = 234 | sum_lax = 607 --------------------------------------------------------------------------------------- ====================================================================================================== The final Archive length = 6 The final Archive is now... --------------------------------------------------------------------------------------- Solution 1: 1 2 3 4 5 6 7 8 9 10 11 Objectives of solution 1 : || Number of preemptions = 263 | sum_lax = 776 || --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 2: 1 2 3 4 5 6 7 8 9 10 4 Objectives of solution 2 : || Number of preemptions = 243 | sum_lax = 685 || --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 3: 1 2 3 4 1 5 6 7 8 9 4 Objectives of solution 3 : || Number of preemptions = 231 | sum_lax = 529 || --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 4: 1 2 3 4 1 5 6 1 7 8 4 Objectives of solution 4 : || Number of preemptions = 198 | sum_lax = 439 || --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 5: 1 2 3 4 1 5 6 1 7 8 9 Objectives of solution 5 : || Number of preemptions = 205 | sum_lax = 514 || --------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------- Solution 6: 1 2 3 4 1 5 6 7 8 9 10 Objectives of solution 6 : || Number of preemptions = 234 | sum_lax = 607 || --------------------------------------------------------------------------------------- ====================================================================================================== The hyperperiod of initial solution: 19800 The maximum hyperperiod of candidate solution: 19800 Paes_computation_time : 1618.66737400