Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.     

Refactoring and converting a TTCN-2 test suite

When deploying TTCN-3 at Nokia, we converted two TTCN-2 test systems to TTCN-3. We explain to which extend we have been able to do the conversion automatically. The conversion tool used provided a syntactically and semantically correct conversion of the TTCN-2 code. We define some improvements made on the tool to increase readability and maintainability of the resulting code. We cover aspects of converting also the non-TTCN-2 parts and describe the experiences we made as a set of lessons learnt.