High Performance Computing – HiPC’99

Good quality information from data flow analysis is a prerequisite for code improvement and, in parallelizing compilers, parallelism detection. Typically, compilers do many kinds of data flow analyses and optimizations one after another, which may pose a phase-ordering problem: the analyses may have to be run several times until a fixed point is reached. However, when two related optimizations/analyses are performed in combination, it may be possible to obtain better results than iterating over the two analyses independently. Combining optimizations/analyses may be beneficial while potentially enforcing little calculation overhead. This paper discusses combining interprocedural conditional constant propagation (CCP) and interprocedural alias analysis (AA) in pointer-supporting languages.

[1]  Randall L. Hyde,et al.  An Analysis of Degenerate Sharing and False Coherence , 1996, J. Parallel Distributed Comput..

[2]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[3]  Marc Gengler.  An introduction to parallel dynamic programming , 1996, Solving Combinatorial Optimization Problems in Parallel.

[4]  Susan J. Eggers,et al.  Reducing false sharing on shared memory multiprocessors through compile time data transformations , 1995, PPOPP '95.

[5]  Veljko M. Milutinovic,et al.  Hardware approaches to cache coherence in shared-memory multiprocessors. 2 , 1994, IEEE Micro.

[6]  Veljko M. Milutinovic,et al.  The word-invalidate cache coherence protocol , 1996, Microprocess. Microsystems.

[7]  Josep Torrellas,et al.  False Sharing ans Spatial Locality in Multiprocessor Caches , 1994, IEEE Trans. Computers.

[8]  Alkiviadis G. Akritas,et al.  Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.

[9]  Anthony S. Acampora.  Wireless ATM: a perspective on issues and prospects , 1996, IEEE Wirel. Commun..

[10]  Mark S. Squillante,et al.  Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling , 1993, IEEE Trans. Parallel Distributed Syst..

[11]  C. P. Ravikumar,et al.  Distributed delay constrained multicast path setup algorithm for high speed networks , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[12]  D. Raychaudhuri.  Wireless ATM: an enabling technology for multimedia personal communication , 1999 .

[13]  Steffen Rothkugel,et al.  Enhancing the Web's Infrastructure: From Caching to Replication , 1997, IEEE Internet Comput..

[14]  Hussein F. Salama.  Delay-Constrained Shared Multicast Trees , 1999 .

[15]  Mats Brorsson,et al.  An adaptive cache coherence protocol optimized for migratory sharing , 1993, ISCA '93.

[16]  Ramesh Subramonian,et al.  LogP: towards a realistic model of parallel computation , 1993, PPOPP '93.

[17]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[18]  Douglas S. Reeves,et al.  Multicast routing for real-time communication of high-speed networks , 1996 .

[19]  Josep Torrellas,et al.  The memory performance of DSS commercial workloads in shared-memory multiprocessors , 1997, Proceedings Third International Symposium on High-Performance Computer Architecture.

[20]  Prathima Agrawal,et al.  SWAN: a mobile multimedia wireless network , 1996, IEEE Wirel. Commun..

[21]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[22]  Peter Thanisch,et al.  On the Scope of Applicability of the ETF Algorithm , 1995, IRREGULAR.

[23]  Mark N. Wegman,et al.  Constant propagation with conditional branches , 1985, POPL.

[24]  Robert J. Fowler,et al.  Adaptive cache coherency for detecting migratory shared data , 1993, ISCA '93.

[25]  Anoop Gupta,et al.  Memory-reference characteristics of multiprocessor applications under MACH , 1988, SIGMETRICS '88.

[26]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM 1989.

[27]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[28]  Laurence B. Milstein,et al.  Performance of a wireless access protocol on correlated Rayleigh-fading channels with capture , 1998, IEEE Trans. Commun..

[29]  Alan Jay Smith,et al.  A class of compatible cache consistency protocols and their support by the IEEE futurebus , 1986, ISCA '86.

[30]  Philip S. Yu,et al.  A Parallel Hash Join Algorithm for Managing Data Skew , 1993, IEEE Trans. Parallel Distributed Syst..

[31]  C. P. Ravikumar,et al.  Efficient algorithms for delay-bounded minimum cost path problem in communication networks , 1998, Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238).

[32]  Eric Bach,et al.  Asynchronous Analysis of Parallel Dynamic Programming Algorithms , 1996, IEEE Trans. Parallel Distributed Syst..

[33]  Michael L. Dowling.  A Fast Parallel Horner Algorithm , 1990, SIAM J. Comput..

[34]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

[35]  Ron Cytron,et al.  Efficient accommodation of may-alias information in SSA form , 1993, PLDI '93.

[36]  Anoop Gupta,et al.  Performance evaluation of memory consistency models for shared-memory multiprocessors , 1991, ASPLOS IV.

[37]  J. J. Garcia-Luna-Aceves,et al.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM '89.

[38]  Trevor N. Mudge,et al.  Trace-driven memory simulation: a survey , 1997, CSUR.

[39]  Bongki Moon,et al.  A case for parallelism in data warehousing and OLAP , 1998, Proceedings Ninth International Workshop on Database and Expert Systems Applications (Cat. No.98EX130).

[40]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[41]  Cosimo Antonio Prete,et al.  Some Considerations About Passive Sharing in Shared-Memory Multiprocessors , 1997 .

[42]  Mary Lou Soffa,et al.  An Incremental Version of Iterative Data Flow Analysis , 1989, IEEE Trans. Software Eng..

[43]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[44]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[45]  Zvi Galil,et al.  Parallel Algorithms for Dynamic Programming Recurrences with More than O(1) Dependency , 1994, J. Parallel Distributed Comput..

[46]  J. K. Archibald.  The cache coherence problem in shared-memory multiprocessors , 1987 .

[47]  Krishna M. Sivalingam,et al.  Scheduling in wireless networks with multiple transmission channels , 1999, Proceedings. Seventh International Conference on Network Protocols.

[48]  Thomas Decker,et al.  Virtual Data Space - A Universal Load Balancing Scheme , 1997, IRREGULAR.

[49]  Vipin Kumar,et al.  Efficient Parallel Formulations for Some Dynamic Programming Algorithms , 1993 .

[50]  Satish K. Tripathi,et al.  Enhancing throughput over wireless LANs using channel state dependent packet scheduling , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[51]  V. K. Bhargava,et al.  Scheduling multiservice traffic for wireless ATM transmission over TDMA/TDD channels , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[52]  Krishna M. Sivalingam,et al.  Design and analysis of low‐power access protocols for wireless and mobile ATM networks , 2000, Wirel. Networks.

[53]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated service packet networks , 1997, TNET.

[54]  Cosimo Antonio Prete,et al.  A new solution of coherence protocol for tightly coupled multiprocessor systems , 1990, Microprocessing and Microprogramming.

[55]  W. Kent Fuchs,et al.  Address tracing for parallel machines , 1991, Computer.

[56]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[57]  Wolfgang Küchlin,et al.  Parallel Real Root Isolation Using the Coefficient Sign Variation Method , 1990, CAP.

[58]  Ramesh Krishnamurti.  An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems , 1992, IEEE Trans. Computers.

[59]  Luigi M. Ricciardi,et al.  A hybrid approach to trace generation for performance evaluation of shared-bus multiprocessors , 1996, Proceedings of EUROMICRO 96. 22nd Euromicro Conference. Beyond 2000: Hardware and Software Design Strategies.

[60]  Ambuj Shatdal,et al.  Processing Aggregates in Parallel Database Systems , 1994 .

[61]  Cosimo Antonio Prete,et al.  PSCR: A Coherence Protocol for Eliminating Passive Sharing in Shared-Bus Shared-Memory Multiprocessors , 1999, IEEE Trans. Parallel Distributed Syst..

[62]  Luiz André Barroso,et al.  Memory system characterization of commercial workloads , 1998, ISCA.

[63]  John Edwards.  The Changing Face of Freeware , 1998, Computer.

[64]  Samir R. Das,et al.  Simulation Based Performance Evaluation of Mobile, Ad hoc Network Routing Protocols , 2000 .

[65]  Christina Fragouli,et al.  Controlled multimedia wireless link sharing via enhanced class-based queuing with channel-state-dependent packet scheduling , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[66]  Barbara G. Ryder,et al.  Interprocedural modification side effect analysis with pointer aliasing , 1993, PLDI '93.

[67]  Giinter von Biiltzingsloewen.  Translating and Optimizing SQL Queries Having Aggregates , 1987 .

[68]  Krishna M. Sivalingam,et al.  Scheduling Multimedia Services in a Low-Power MAC for Wireless and Mobile ATM Networks , 1999, IEEE Trans. Multim..

[69]  Richard T. Snodgrass,et al.  Parallel algorithms for computing temporal aggregates , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[70]  Shou-Hsuan Stephen Huang,et al.  A Sublinear Parallel Algorithm for Some Dynamic Programming Problems , 1992, Theor. Comput. Sci..

[71]  M. Scott Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[72]  Jong-Deok Choi,et al.  Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects , 1993, POPL '93.

[73]  Mark N. Wegman,et al.  Efficiently computing static single assignment form and the control dependence graph , 1991, TOPL.

[74]  Ananth Grama,et al.  Isoefficiency Function: A Sealability Metric for Parallel Algorithms and Architectures , 1993 .

[75]  Per-Ake Larson,et al.  Performing Group-By before Join , 1994, ICDE 1994.

[76]  Cosimo Antonio Prete,et al.  RST cache memory design for a highly coupled multiprocessor system , 1991, IEEE Micro.

[77]  Luigi M. Ricciardi,et al.  Trace Factory: generating workloads for trace-driven simulation of shared-bus multiprocessors , 1997, IEEE Concurrency.