Search

In order to test and compare the performance of algorithms in the project scheduling problems, test instances sets are required. Some literatures are reviewed and surveyed on the instances sets. As internationally and commonly used, two basic instances sets(Patterson sets and PSPLIB)and two instances sets generators(the single project generator RanGen and the multi-project generator RCMPSP)are introduced. Finally, the selection flow of test instances sets in project scheduling problems and the general method of constructing test instances sets are proposed. Two cases are used to illustrate the effectiveness and application prospects of these methods. [ABSTRACT FROM AUTHOR]

As large-scale MapReduce clusters become widely adapted to process huge amount of data, one of critical challenges Is to improve the service quality of MapReduce clusters by minimizing their makespan. A scheduling model can be considered for multiple, MapReduce jobs. It Is observed that the order in which these jobs are executed can have a significant impact on t H r overall makespan. The goal of the paper Is to design a framework of automatic job scheduler and propose an analytical model for minimizing the makespan of such a set of MapReduce jobs. By considering a better strategy and implementation, we can meet the conditions of the classical Johnson algorithm and use it to find the optimal solution. Under our proposed new strategy, solving the balanced pools problem becomes exact in linear time, better than existing simulating approaches. Our proposed analyical results can be applied to improve system response time, energy-efficiency and load-balance in Hadoop cluster pools, while corresponding numerical examples validate our observations. [ABSTRACT FROM AUTHOR]