Name
Affiliation
Papers
HIDEAKI KOMATSU
IBM Tokyo Research Laboratory, Kanagawa-ken 242-8502, Japan
44
Collaborators
Citations 
PageRank 
60
410
34.00
Referers 
Referees 
References 
792
916
654
Search Limit
100916
Title
Citations
PageRank
Year
An Event-Processing System Alerting Analytically To Networked Vehicles00.342013
Idiom recognition framework using topological embedding00.342013
A high-performance sorting algorithm for multicore single-instruction multiple-data processors60.462012
Automatic Resource Scheduling with Latency Hiding for Parallel Stencil Applications on GPGPU Clusters10.362012
Distributed and fault-tolerant execution framework for transaction processing00.342011
A parallel programming framework orchestrating multiple languages and architectures00.342011
Automatic parallelization of simulink applications111.062010
Parallel programming framework for large batch transaction processing on scale-out systems10.352010
Coloring-based coalescing for graph coloring register allocation30.392010
AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors472.782007
Cloneable JVM: a new approach to start isolated java applications faster130.862007
Non-Retrial Register Allocation and its Spill Optimization Method00.342007
Accelerating Mutual-Information-Based Linear Registration On The Cell Broadband Engine Processor20.422007
EDO: Exception-directed optimization in java20.382006
Effective sign extension elimination for java20.392006
Design and evaluation of dynamic optimizations for a Java just-in-time compiler180.952005
Evolution of a java just-in-time compiler for IA-32 platforms101.012004
TO-Lock: Removing Lock Overhead Using the Owners' Temporal Locality20.382004
Optimizing precision overhead for x86 processors20.382004
Partial redundancy elimination for access expressions by speculative code motion70.582004
Structural Path Profiling: An Efficient Online Path Profiling Framework for Just-In-Time Compilers70.502004
Instruction combining for coalescing memory accesses using global code motion00.342004
Spill code minimization by spill code motion10.362003
Stride prefetching by dynamically inspecting objects200.752003
A new speculation technique to optimize floating-point performance while preserving bit-by-bit reproducibility00.342003
Integrated prepass scheduling for a Java Just-In-Time compiler on the IA-64 architecture40.512003
Effectiveness of cross-platform optimizations for a java just-in-time compiler281.052003
An efficient online path profiling framework for Java just-in-time compilers100.872003
Preference-directed graph coloring40.472002
A dynamic optimization framework for a Java just-in-time compiler652.852001
A study of exception handling and its dynamic optimization in Java261.532001
Design, implementation, and evaluation of optimizations in a JavaTM Just-In-Time compiler40.442000
A Loop Transformation Algorithm for Communication Overlapping80.702000
Effective null pointer check elimination utilizing hardware trap231.182000
Design, implementation, and evaluation of optimizations in a just-in-time compiler495.121999
A method for applying loop unrolling and software pipelining to instruction-level parallel architectures00.341998
A Method for Runtime Recognition of Collective Communication on Distributed-Memory Multiprocessors00.341997
A Register Allocation Technique Using Register Existence Graph00.341997
An Algorithm for Automatic Detection of Loop Indices for Communication Overlapping00.341997
Detection and global optimization of reduction operations for distributed parallel machines191.031996
A register allocation technique using guarded PDG20.431996
A Loop Parallelization Algorithm for HPF Compilers40.471995
An optimizing Prolog compiler30.591986
A very fast prolog compiler on multiple architectures60.661986