Santosh G. Abraham

Indian Institute of Technology Madras — India

Computer Science · Physical Sciences

19h-index1.2kcitations54works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Parallel Computing and Optimization Techniques(43), Embedded Systems Design Techniques(21), Advanced Data Storage Technologies(15), Distributed and Parallel Computing Systems(12), Interconnection Networks and Systems(12)

Publications54 total

Project Report: Medicine and British Empire in South India:A Study of Psychiatry and Mental Asylum in Colonial Kerala
Revista de Fomento Social·2018Open Access
A para-virtualization technique to improve the performance of cross-platform emulation
2018
Author retrospective for optimum modulo schedules for minimum register requirements
2014· 3 cited
Optimum modulo schedules for minimum register requirements
2014· 46 cited
Methods for Improving Medium Reuse in IEEE 802.11 Networks
2009· 8 cited
Chapter-11 Postmastectomy Breast Reconstruction
Jaypee Brothers Medical Publishers (P) Ltd. eBooks·2006
Effective stream-based and execution-based data prefetching
2004· 78 cited
Microarchitecture Optimizations for Exploiting Memory-Level Parallelism
ACM SIGARCH Computer Architecture News·2004· 207 cited
Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots
International Journal of Parallel Programming·2002· 2 cited
Efficient Backtracking Instruction Schedulers
International Conference on Parallel Architectures and Compilation Techniques·2000· 14 cited
Fast Design Space Exploration Through Validity and Quality Filtering of Subsystem Designs
OpenGrey (Institut de l'Information Scientifique et Technique)·2000· 35 cited
Efficient design space exploration in PICO
2000· 31 citedOpen Access
Automatic and efficient evaluation of memory hierarchies for embedded systems
International Symposium on Microarchitecture·1999· 33 cited
Meld Scheduling: A Technique for Relaxing Scheduling Constraints
International Journal of Parallel Programming·1998· 7 cited
Achieving high levels of instruction-level parallelism with reduced hardware complexity
1997· 35 cited
Modulo Scheduling, Machine Representations, and Register-Sensitive Algorithms
1997· 6 cited
Meld scheduling: relaxing scheduling constraints across region boundaries
International Symposium on Microarchitecture·1996· 7 cited
Minimizing Register Requirements of a Modulo Schedule via Optimum Stage Scheduling
International Journal of Parallel Programming·1996· 26 cited
Set-associative cache simulation using generalized binomial trees
ACM Transactions on Computer Systems·1995· 52 citedOpen Access
Optimum modulo schedules for minimum register requirements
1995· 37 citedOpen Access
page 1 of 3Next →

Frequent Co-authors

Edward S. Davidson(12), David E. Hudak(11), Rabin A. Sugumar(7), Alexandre E. Eichenberger(7), B. Ramakrishna Rau(5), William H. Mangione-Smith(4), Vinod Kathail(3), Yuan Chou(2), Daniel Windheiser(2), Rajiv Gupta(2), Scott Mahlke(2), Waleed Meleis(2), Ivan D. Baev(2), Karen Tomko(2), Brian L. Deitrich(2), Brian Fahs(1), S. Iacobovici(1), Lawrence Spracklen(1), Sudarshan Kadambi(1), Robert Schreiber(1)