Sanjeev Kumar
- 1.ANDERSON, T. The performance of spin lock alternatives for shared-memory muitiprocessors, in IEEE Transactions on Parallel and Distributed Systems (Jan- Google Scholar
Digital Library
- 2.ARPACI, R. H., CULLER, D. E., KRISHNAMUBTHY, A., #'rEINBERG, S. G., AND Y ELI(3K, 1%. Empirical evaluation of the CRAY-T3D" A compiler perspective. In Proceedings of the 22nd Annual International Symposium on Computer Architecture (Santa Margherita Ligure, Italy, June 22-24, 1995), ACM SIGARCH and IEEE wompu#er #ocm#y i w#, pp. ozu-ool. Google ScholarDigital Library
- 3.BASKETT, F., JERMOLUK, T., AND SOLOMON, D. The 4D-MP graphics superworkstation: Computing+graphics = 40mips -t- 40mflops and 100,000 lighted pp. 468-471.Google Scholar
- 4.EXCHENBERGER, A. E., AND ABRAHAM, S. G. impact of load imbalance on the design of software barriers. In Proceedings of the 1995 International Conference on Parallel Processing (Aug. 1995), pp. 63-72.Google Scholar
- 5.JIANG, D., AND SINGH, J. P. A methodology and an evaluation of the SGI Origin 2000. in Proceedings of A CM Sigmetricsg8 / Performance 98 (June 1998). Google ScholarDigital Library
- 6.K)#GI, A., BURGER, D., AND GOODMAN, J. R. Efficient synchronization" Let them eat qolb. In International Symposium on Computer Architecture (June 1997), pp. 170-180. Google ScholarDigital Library
- 7.LAUDON, J., AND LENOSKI, D. The SGI Origin: A cc- NUMA highly scalable server. In international Symposium on Computer Architecture (June 1997), pp. 241- 251. Google ScholarDigital Library
- 8.LIM, B.-H., AND AGARWAL, A. Reactive synchronization algorithms for multiprocessors. In Architectural Support for Programming Languages and Operating Systems (San Jose, California, October 4-7, 1994), r,r, 9.r#_2 # Google ScholarDigital Library
- 9.MARTZN, R. P., VAHDAT, A. M., CULLER, D. E., AND ANDERSON., T. E. Effec of communication latency, overhead, and bandwidth on a cluster architecture. In Proceedings of the 2#th Annual International Symposium on Computer Architecture (June 1997), pp. 85-97. Google ScholarDigital Library
- 10.MELLOR- CRUMMEY, J. M., AND SCOTT, M.L. Algorithms for scalable synchronization on shared-memory multiprocessors. In A CM Transactions on Computer Systems (Feb 1991), pp. 9(1):21-65. Google ScholarDigital Library
- 11.M'ET,T,OR,-CRITMMEY.} M.# AND ,qCOTT. M L. Svnchronization without contention. In Architectural Support for Programming Languages and Operating Systems (Santa Clara, California, April 8-11, i99i), pp. 269-278. Google Scholar
- 12.Woo, S. C., OHARA, M., TORRIE, E., SINGH, J. P., AND GUPTA, A. The splash-2 programs: Characterization and methodological considerations. In International Symposium on Computer Architecture (June 1995), pp. 24-38. Google ScholarDigital Library
Index Terms
- Evaluating synchronization on shared address space multiprocessors: methodology and performance
Recommendations
On data synchronization for multiprocessors
ISCA '89: Proceedings of the 16th annual international symposium on Computer architectureAs the grain size becomes smaller, more parallelism can be found in most programs. However, to exploit smaller grain parallelism, more efficient synchronization primitives are needed to reduce the increased synchronization overhead. The granularity of ...
Parallel Tree Building on a Range of Shared Address Space Multiprocessors: Algorithms and Application Performance
IPPS '98: Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing SymposiumIrregular, particle-based applications that use trees, for example hierarchical N-body applications, are important consumers of multiprocessor cycles, and are argued to benefit greatly in programming ease from a coherent shared address space programming ...
An experience using different synchronisation mechanisms on a shared memory multiprocessors
In this paper, we are concerned with a number of parallel algorithms for comparing three different synchronization mechanisms when applied to a particular problem. The problem is the reduction of a general matrix to upper Hessenberg form. The algorithms ...
Comments