In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...

Two-level dynamic branch predictors try to predict the outcomes of conditional branches using both a table of state counters associated with specific branch instructions and a buffer of recent branch outcomes to correlate the counters with specific branch histories. However, there is always a question of how much correlation to use, and some programs benefit from higher levels of correlation th...

To feed the execution core with uninterrupted instruction streams, modern processors access complex branch predictors every clock cycle, incurring high energy consumption. In this paper, we conduct a systematic study on the energy consumption of representative branch predictors, and identify several sources of energy inefficiency. Based on this study, we introduce an improved branch predictor d...

Even after decades of research in branch prediction, branch predictors still remain imperfect, which results in significant performance loss in aggressive processors that support large instruction windows and deep pipelines. This paper proposes a new processor architecture for handling hard-to-predict branches, the diverge-merge processor. The goal of this paradigm is to eliminate branch mispre...