431 search results - page 39 / 87 » The predictability of branches in libraries |
CASES
2007
ACM
13 years 11 months ago
2007
ACM
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...
IJCAI
1993
13 years 9 months ago
1993
In this paper we present a technique for automatically generating constraints on parameter derivatives that reduce ambiguity in the behaviour prediction. Starting with a behaviour...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
APPML
2007
13 years 7 months ago
2007
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Presentation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...