Efficient speculative execution requires fetching and executing instructions before it is known whether the instructions are supposed to execute, and current research is looking at finding ways to fetch quickly lots of instructions in the presence of conditional branch instructions. Reduction in average memory access time involves new cache structures and burst transfers of large blocks of memory to cache. Efficient code generation for ILP architectures requires careful ordering of the operations to be performed during execution. This ordering, called instruction scheduling, is the driving force behind ILP code generation. A similarity correlation between two sequences is represented by an alignment of the sequences in a way that maximizes the pairs of identical symbols of the sequences.
Dynamic programming is used to compute an optimal alignment of two sequences.
This research contributes to the Human Genome Project whose ultimate goal is to obtain the complete human DNA sequence of about three billion nucleotides. Work in this area is determined on the basis of the combined expertise of the students and faculty members and often involves faculty members from other departments of the University. Recent work has centered on the development of a communication model for the Intel Paragon mesh. Modeling of message passing protocols is also being developed in order to study the behavior of those protocols and to discover ways in which the latency of message passing can be reduced. Recent research has been aimed at investigating the possible use of lower degree algebraic surfaces in geometric modeling.