Video-on-Demand streaming on P2P networks has become increasingly popular in recent years. This report presents a comparison study of block scheduling algorithms in P2P VoD networking. Global rarest-first and a promising technique named network coding are reviewed and simulated. The influence of the size of blocks to the performance is also covered in the simulation. The results confirm that wi...

Airline schedule development continues to remain one of the most challenging planning activity for any airline. An airline schedule comprises of a list of flights and specifies the origin, destination, scheduled departure, and arrival time of each flight in the airline’s network. A critical component of the schedule development activity is the choice of flight block-times, which depend on sever...

This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to assess the quality of the proposed neighborhood and to compare it with two existing neighborhoods using shift and swap. The ”block moves” neighborhood can be beneficial for any local search algorithm.

Historically, one of the most constant features of America’s high schools is the structure of the school day. However, in the 1990s, “The most visible and perhaps significant change in the organization of the high school is the block schedule” (Cawelti, 1997, p. 41). There have been conflicting results regarding the effects of block scheduling on student achievement. Researchers in agricultural...

VLIW scheduling, profile driven scheduling, superblocks, hyperblocks Code scheduling to exploit instruction level parallelism (lLP) is a central problem in compiler optimization research, in light of the increased use of long-instruction-word computers. Unfortunately, optimum scheduling is computationally intractable, and one must resort to carefully crafted heuristics in practice. If the scope...

This dissertation addresses the complexities involved with scheduling in the presence of conditional branches. This is a particularly important problem for processors that execute multiple operations per cycle and are not fully utilized by local scheduling techniques. Since conditional branches introduce multiple execution paths, it is diicult for a global scheduler to keep track of the various...