Name
Papers
Collaborators
EDWARD S. DAVIDSON
70
80
Citations 
PageRank 
Referers 
922
171.30
1605
Referees 
References 
778
663
Search Limit
1001000
Title
Citations
PageRank
Year
Author retrospective for optimum modulo schedules for minimum register requirements10.372014
A freespace crossbar for multi-core processors00.342008
Probabilistic Predicate-Aware Modulo Scheduling30.392004
A Prefetch Taxonomy221.032004
Call Graph Prefetching for Database Applications181.162003
Predicate-aware scheduling: a technique for reducing resource constraints60.732003
Boosting trace cache performance with nonhead miss speculation10.382002
Data prefetching by dependence graph precomputation773.122001
Allocation by Conflict: A Simple, Effective Multilateral Cache Management Scheme00.342001
Evaluating the Use of Register Queues in Software Pipelined Loops120.712001
Branch History Guided Instruction Prefetching220.922001
Register Queues: A New Hardware/Software Approach to Efficient Software Pipelining71.052000
Dual-issue scheduling with spills for binary trees00.341999
Active Management of Data Caches by Exploiting Reuse Information201.531999
Origin 2000 Design Enhancements for Communication Intensive Applications20.391998
Effects of architectural and technological advances on the HP/Convex Exemplar's memory and communication performance80.881998
mlcache: a flexible multi-lateral cache simulator131.771998
Evaluating the Performance of Active Cache Management Schemes10.361998
Utilizing reuse information in data cache management442.401998
Configuration Independent Analysis for Characterizing Shared-Memory Applications121.371998
Characterizing distributed shared memory performance: a case study of the Convex SPP100090.951998
On high-bandwidth data cache design for multi-issue processors422.011997
On effective data supply for multi-issue processors50.671997
A reduced multipipeline machine description that preserves scheduling constraints151.531996
Minimizing register requirements of a modulo schedule via optimum stage scheduling140.821996
Performance issues in integrating temporality-based caching with prefetching00.341996
Modeling the Communication Performance of the IBM SP2252.041996
Profile driven weighted decomposition00.341996
Reducing Conflicts in Direct-Mapped Caches with a Temporality-Based Design715.601996
Maximum rate single-phase clocking of a closed pipeline including wave pipelining, stoppability, and startability10.391995
The resource conflict methodology for early-stage design space exploration of superscalar RISC processors20.561995
Optimum modulo schedules for minimum register requirements322.101995
Register allocation for predicated code141.141995
A Hierarchical Approach to Modeling and Improving the Performance of Scientific Applications on the KSR192.761994
Communication in the KSR1 MPP: performance evaluation using synthetic workload experiments30.841994
Grouping Array Layouts to Reduce Communication and Improve Locality of Parallel Programs10.471994
Optimal local register allocation for a multiple-issue machine20.381994
Minimum register requirements for a module schedule261.961994
Approaching a machine-application bound in delivered performance on scientific code152.341993
Hierarchical performance modeling with MACS: a case study of the convex C-24071.111993
Synchronization of pipelines131.271993
KSR 1 Multiprocessor: Analysis of Latency Hiding Techniques in a Sparse Solver61.101993
Evaluating the communication performance of MPPs using synthetic sparse matrix multiplication workloads112.271993
Using constraint geometry to determine maximum rate pipeline clocking30.651992
Register requirements of pipelined processors312.541992
A performance comparison of the IBM RS/6000 and the Astronautics ZS-1182.711991
The Organization Of The Cedar System181.511991
Optimal clocking of circular pipelines51.291991
An integrated approach to developing manufacturing control software40.801991
An evaluation of Cray X-MP performance on vectorizable Livermore FORTRAN kernels33.861988
  • 1
  • 2