default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSantosh G. Abraham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c35]Alexandre E. Eichenberger, Edward S. Davidson, Santosh G. Abraham:
Author retrospective for optimum modulo schedules for minimum register requirements. ICS 25th Anniversary 2014: 35-36
2000 – 2009
- 2005
- [c34]Lawrence Spracklen, Yuan Chou, Santosh G. Abraham:
Effective Instruction Prefetching in Chip Multiprocessors for Modern Commercial Applications. HPCA 2005: 225-236 - [c33]Lawrence Spracklen, Santosh G. Abraham:
Chip Multithreading: Opportunities and Challenges. HPCA 2005: 248-252 - [c32]Harit Modi, Lawrence Spracklen, Yuan Chou, Santosh G. Abraham:
Accurate Modeling of Aggressive Speculation in Modern Microprocessor Architectures. MASCOTS 2005: 75-84 - [c31]Jiwei Lu, Abhinav Das, Wei-Chung Hsu
, Khoa Nguyen, Santosh G. Abraham:
Dynamic Helper Threaded Prefetching on the Sun UltraSPARC CMP Processor. MICRO 2005: 93-104 - [c30]Yuan Chou, Lawrence Spracklen, Santosh G. Abraham:
Store Memory-Level Parallelism Optimizations for Commercial Applications. MICRO 2005: 183-196 - 2004
- [c29]Sorin Iacobovici, Lawrence Spracklen, Sudarshan Kadambi, Yuan Chou, Santosh G. Abraham:
Effective stream-based and execution-based data prefetching. ICS 2004: 1-11 - [c28]Yuan Chou, Brian Fahs, Santosh G. Abraham:
Microarchitecture Optimizations for Exploiting Memory-Level Parallelism. ISCA 2004: 76-89 - 2002
- [j10]Ivan D. Baev, Waleed Meleis, Santosh G. Abraham:
Backtracking-Based Instruction Scheduling to Fill Branch Delay Slots. Int. J. Parallel Program. 30(6): 397-418 (2002) - 2000
- [c27]Santosh G. Abraham, Waleed Meleis, Ivan D. Baev:
Efficient Backtracking Instruction Schedulers. IEEE PACT 2000: 301-308 - [c26]Robert Schreiber, Shail Aditya, B. Ramakrishna Rau, Vinod Kathail, Scott A. Mahlke, Santosh G. Abraham, Greg Snider:
High-Level Synthesis of Nonprogrammable Hardware Accelerators. ASAP 2000: 113- - [c25]Santosh G. Abraham, B. Ramakrishna Rau:
Efficient design space exploration in PICO. CASES 2000: 71-79
1990 – 1999
- 1999
- [c24]Santosh G. Abraham, Scott A. Mahlke:
Automatic and Efficient Evaluation of Memory Hierarchies for Embedded Systems. MICRO 1999: 114-125 - 1998
- [j9]Santosh G. Abraham, Vinod Kathail, Brian L. Deitrich:
Meld Scheduling: A Technique for Relaxing Scheduling Constraints. Int. J. Parallel Program. 26(4): 349-381 (1998) - 1996
- [j8]Alexandre E. Eichenberger, Edward S. Davidson, Santosh G. Abraham:
Minimizing Register Requirements of a Modulo Schedule via Optimum Stage Scheduling. Int. J. Parallel Program. 24(2): 103-132 (1996) - [c23]Santosh G. Abraham, Vinod Kathail, Brian L. Deitrich:
Meld Scheduling: Relaxing Scheduling Constraints Across Region Boundaries. MICRO 1996: 308-321 - 1995
- [j7]Rabin A. Sugumar, Santosh G. Abraham:
Set-Associative Cache Simulation Using Generalized Binomial Trees. ACM Trans. Comput. Syst. 13(1): 32-56 (1995) - [c22]Alexandre E. Eichenberger, Santosh G. Abraham:
Modeling load imbalance and fuzzy barriers for scalable shared-memory multiprocessors. HICSS (1) 1995: 262-271 - [c21]Alexandre E. Eichenberger, Santosh G. Abraham:
Impact of Load Imbalance on the Design of Software Barriers. ICPP (2) 1995: 63-72 - [c20]Alexandre E. Eichenberger, Edward S. Davidson, Santosh G. Abraham:
Optimum Modulo Schedules for Minimum Register Requirements. International Conference on Supercomputing 1995: 31-40 - [c19]Yang Zeng, Santosh G. Abraham:
Partitioning regular grid applications with irregular boundaries for cache-coherent multiprocessors. IPPS 1995: 222-228 - 1994
- [c18]Santosh G. Abraham, Rabin A. Sugumar:
Fast Efficient Simulation of Write-Buffer Configurations. HICSS (1) 1994: 231-240 - [c17]Karen A. Tomko, Santosh G. Abraham:
Data and program restructuring of irregular applications for cache-coherent multiprocessor. International Conference on Supercomputing 1994: 214-225 - [c16]Alexandre E. Eichenberger, Edward S. Davidson, Santosh G. Abraham:
Minimum register requirements for a modulo schedule. MICRO 1994: 75-84 - 1993
- [j6]Jiajen M. Lin, Santosh G. Abraham:
Utilizing Global Simulation Information in Conservative Parallel Simulation on Shared Memory Multiprocessors. J. Parallel Distributed Comput. 18(4): 516-523 (1993) - [j5]William H. Mangione-Smith, Tien-Pao Shih, Santosh G. Abraham, Edward S. Davidson:
Approaching a machine-application bound in delivered performance on scientific code. Proc. IEEE 81(8): 1166-1178 (1993) - [c15]Karen A. Tomko, Santosh G. Abraham:
Iteration Partitioning for Resolving Stride Conflicts on Cache-Coherent Multiprocessors. ICPP (2) 1993: 95-102 - [c14]Eric L. Boyd, John-David Wellman, Santosh G. Abraham, Edward S. Davidson:
Evaluating the Communication Performance of MPPs Using Synthetic Sparse Matrix Multiplication Workloads. International Conference on Supercomputing 1993: 240-250 - [c13]Daniel Windheiser, Eric L. Boyd, Eric Hao, Santosh G. Abraham, Edward S. Davidson:
KSR 1 Multiprocessor: Analysis of Latency Hiding Techniques in a Sparse Solver. IPPS 1993: 454-461 - [c12]Santosh G. Abraham, Rabin A. Sugumar, Daniel Windheiser, B. Ramakrishna Rau, Rajiv Gupta:
Predictability of load/store instruction latencies. MICRO 1993: 139-152 - [c11]Rabin A. Sugumar, Santosh G. Abraham:
Efficient Simulation of Caches under Optimal Replacement with Applications to Miss Characterization. SIGMETRICS 1993: 24-35 - 1992
- [j4]Jiajen M. Lin, Santosh G. Abraham:
Fast High-Level Simulation of Shared-Memory Multiprocessor Systems. Int. J. Comput. Simul. 2(1) (1992) - [j3]David E. Hudak, Santosh G. Abraham:
Compile-Time Optimization of Near-Neighbor Communication for Scalable Shared Memory Architecture. J. Parallel Distributed Comput. 15(4): 351-367 (1992) - [c10]Gautam B. Singh, Santosh G. Abraham, Franklin H. Westervelt:
Computing Radiosity Solution on a High Performance Workstation LAN. HPDC 1992: 248-257 - [c9]Jiajen M. Lin, Santosh G. Abraham:
Discrete Event Simulation on Shared Memory Multiprocessors Using Global Simulation Information. ICPP (3) 1992: 254-261 - [c8]William H. Mangione-Smith, Santosh G. Abraham, Edward S. Davidson:
Register requirements of pipelined processors. ICS 1992: 260-271 - 1991
- [j2]William H. Mangione-Smith, Santosh G. Abraham, Edward S. Davidson:
A Performance Comparison of the IBM RS/6000 and the Astronautics ZS-1. Computer 24(1): 39-46 (1991) - [j1]Santosh G. Abraham, David E. Hudak:
Compile-Time Partitioning of Iterative Parallel Loops to Reduce Cache Coherency Traffic. IEEE Trans. Parallel Distributed Syst. 2(3): 318-328 (1991) - [c7]William H. Mangione-Smith, Santosh G. Abraham, Edward S. Davidson:
Vector Register Design for Polycyclic Vector Scheduling. ASPLOS 1991: 154-163 - [c6]Rabin A. Sugumar, Santosh G. Abraham:
Parallel Simulation of Fully Associative Caches. ICPP (2) 1991: 304-305 - [c5]David E. Hudak, Santosh G. Abraham:
Beyond loop partitioning: data assignment and overlap to reduce communication overhead. ICS 1991: 172-182 - 1990
- [c4]David E. Hudak, Santosh G. Abraham:
Compiler techniques for data partitioning of sequentially iterated parallel loops. ICS 1990: 187-200
1980 – 1989
- 1988
- [b1]Santosh G. Abraham:
Reducing Interprocessor Communication in Parallel Architectures: System Configuration and Task Assignment. University of Illinois Urbana-Champaign, USA, 1988 - [c3]Santosh G. Abraham, Timothy A. Davis:
Blocking for Parallel Sparse Linear System Solvers. ICPP (1) 1988: 166-173 - 1987
- [c2]Santosh G. Abraham, Janak H. Patel:
Parallel Garbage Collection on a Virtual Memory System. ICPP 1987: 243-246 - 1986
- [c1]Santosh G. Abraham, Edward S. Davidson:
A Communication Model for Optimizing Hierarchical Multiprocessor Systems. ICPP 1986: 467-474
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
