This paper describes and evaluates the use of aggressive static analysis in Jackal, a fine-grain Distributed Shared Memory (DSM) system for Java. Jackal uses an optimizing,
The compiler detects situations where an access to a
Computation migration (or function shipping) is used to optimize critical sections in which a single processor owns both the shared data that is accessed and the lock that protects the data. It is usually more efficient to execute such critical sections on the processor that holds the lock and the data than to incur multiple roundtrips for acquiring the lock, fetching the data, writing the data back, and releasing the lock. Jackal's compiler detects such critical sections and optimizes them by generating single-roundtrip
Jackal's optimizations improve both sequential and parallel application performance. On average, sequential execution times of instrumented, optimized programs are within 10% of those of uninstrumented programs. Application speedups usually improve significantly and several Jackal applications perform as well as hand-optimized message-passing programs.
机译:细粒度分布式共享内存系统的源代码级全局优化
机译:在细粒度的分布式共享内存上优化HPF程序中的通信
机译:在软件分布式共享内存系统上优化OpenMP程序
机译:用于精细谷物分布式共享内存系统的源级别全局优化
机译:处理器 - 本机内存事务在分布式共享内存系统中优化RDMA传输中的影响
机译:使用远程内存访问和分布式内存系统上的递归加倍来优化NEURON仿真环境
机译:细粒度分布式共享内存系统的源代码级全局优化