Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today’s fastest machines and simulators takes several weeks. A practical solution to the simulation problem is sampling. Sampled simulation selects a number of sampling units out of a complete program execution and only simulat...

Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming probl...

Dual M-Z interferometer is the sensitive element of three-component acceleration seismic geophone, while Y branch waveguide is the basic optical components composed of dual M-Z interferometer, so the design of Y branch waveguide directly affects the performance of threecomponent acceleration seismic geophone. Firstly, branch waveguide and S-shaped bent waveguide are introduced, and symmetrical ...

Branch misprediction limits processor performance signiWcantly, as the pipeline deepens and the instruction issued per cycle increases. Since the introduction of the two-level adaptive branch predictor, branch history has been a major input vector in branch prediction, together with the address of a branch instruction. Until now, the length of branch history has been statically Wxed for all bra...

Perceptrons is a simple neural network that works as an alternative to the commonly used two-bit counters branch history table (BHT) branch predictor. Perceptrons achieves increased accuracy than traditional BHT branch predictors because they can make use of longer branch histories, given the same hardware budget. Although having very similar organization to BHT branch predictors, Perceptrons’ ...

The performance and hardware complexity of super-scalar architectures is hindered by conditional branch instructions. When conditional branches are encountered in a program, the instruction fetch unit must rapidly predict the branch predicate and begin speculatively fetching instructions with no loss of instruction throughput. Speculative execution has a high hardware cost, is limited by dynami...