In this paper we present mechanisms that improve the accuracy and performance of history-based branch prediction. By studying the characteristics of the decision structures present in high-level languages, two mechanisms are proposed that reduce the number of wrong predictions made by a branch target buer (BTB). Execution-driven modeling is used to evaluate the improvement in branch prediction ...

Speed and memory requirements of branch and bound algorithms depend on the selection strategy of which candidate node to process next. The goal of this paper is to experimentally investigate this influence to the performance of sequential and parallel branch and bound algorithms. The experiments have been performed solving a number of multidimensional test problems for global optimization. Bran...

objective: to evaluate sensorimotor nerve damage in patients with maxillofacial trauma referring to taleghani hospital, tehran, iran methods: this cross-sectional study was conducted during a 2-year period from 2014 to 2012 in taleghani hospital of tehran. we included a total number of 495 patients with maxillofacial trauma referring to our center during the study period. the demographic inform...

Even sophisticated branch-prediction techniques necessarily suffer some mispredictions, and even relatively small mispredict rates hurt performance substantially in current-generation processors. This suggests the study of multipath execution, in which the processor simultaneously executes code from both the taken and not-taken outcomes of a branch. This paper describes HydraScalar, a simulator...

Sorting is one of the most important and studied problems in computer science. Many good algorithms exist which offer various trade-offs in efficiency, simplicity and memory use. However most of these algorithms were discovered decades ago at a time when computer architectures were much simpler than today. Branch prediction and cache memories are two developments in computer architecture that h...

the main objective for plant breeding is to increase genetic diversity. mutation induction is a method to increase genetic diversity associated with selection, recombination, or a combination of these approaches in plant breeding. the present research was aimed to compare efficacy of different doses of gamma rays (150, 200, 250, 300 and 350 gy and zero dose control) on the sesame morphological ...

Traveling salesman problem is a NP-hard problem. Until now, researchers have not found a polynomial time algorithm for traveling salesman problem. Among the existing algorithms, dynamic programming algorithm can solve the problem in time O(n2·2n) where n is the number of nodes in the graph. The branch-and-cut algorithm has been applied to solve the problem with a large number of nodes. However,...