#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1988

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David W. Goodwin, Kent D. Wilken
- Softw., Pract. Exper.
- 1996

- Changqing Fu, Kent D. Wilken, David W. Goodwin
- J. Instruction-Level Parallelism
- 2002

Recently researchers have proposed modeling register allocation as an integer linear programming (IP) problem and solving it optimally for general purpose processors [17, 20] and for dedicated embedded systems [23]. Compared with traditional graph-coloring approaches, the IP-based allocators can improve a program's performance. However, the solution times… (More)

- Timothy Kong, Kent D. Wilken
- MICRO
- 1998

This paper proposes a precise approach to register allocation for irregular-register architectures which is based on O-I integer programming (IP). Prior work shows that IP register allocation is feasible for RISC architectures, which have uniform registers and register usage. Extensions to the prior work are proposed that precisely model register… (More)

- Kent D. Wilken, Jack Liu, Mark Heffernan
- PLDI
- 2000

This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very large basic blocks. The new approach first uses a set of graph transformations to simplify the data-dependency graph while preserving the optimality of the final schedule. The… (More)

- Kent D. Wilken, John Paul Shen
- IEEE Trans. on CAD of Integrated Circuits and…
- 1990

This paper presents a low-cost approach to concurrent detection of processor control errors that uses a simple hardware monitor and signatures embedded into the executing program. Existing signature-monitoring techniques detect a large portion of processor control errors at a fraction of the cost of duplication. Analytical methods developed in this paper… (More)

- Peter van Beek, Kent D. Wilken
- CP
- 2001

Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to find a minimum length instruction schedule for a basic block subject to precedence, latency, and resource constraints. In this paper we consider local instruction scheduling for… (More)

- Mark Heffernan, Kent D. Wilken
- J. Scheduling
- 2005

This paper presents a set of efficient graph transformations for local instruction scheduling. These transformations to the data-dependency graph prune redundant and inferior schedules from the solution space of the problem. Optimally scheduling the transformed problems using an enumerative scheduler is faster and the number of problems solved to optimality… (More)

- Ghassan Shobaki, Kent D. Wilken
- MICRO
- 2004

The superblock is a scheduling region that is used by compilers for exploiting instruction-level parallelism across basic blocks. Many heuristic techniques have been proposed for solving this difficult scheduling problem, but none accurately approximates the optimal solution. This paper presents a new technique that finds provably optimal solutions to… (More)

- Kent D. Wilken, Timothy Kong
- IEEE Trans. Computers
- 1997

- Kent D. Wilken, John Paul Shen
- ITC
- 1988

This paper presents an eflcient approach to concurrent detection of processor control errors using signatured programs. The new approach, called Continuous Signature Monitoring (CSM), makes significant advances beyond the existing signature-monitoring techniques. For typical programs, CSM decreases average error-detection latency by as much as 8 times, down… (More)