Skip header Section
Skip Bibliometrics Section
Structure of Computers and ComputationsNovember 1978
- Author:
- David L. Kuck
Abstract
No abstract available.
Cited By
- Chakraborty S, Gupta A and Unadkat D (2022). Full-program induction: verifying array programs sans loop invariants, International Journal on Software Tools for Technology Transfer (STTT), 24:5, (843-888), Online publication date: 1-Oct-2022.
Wei X, Yu C, Zhang P, Chen Y, Wang Y, Hu H, Liang Y and Cong J Automated Systolic Array Architecture Synthesis for High Throughput CNN Inference on FPGAs Proceedings of the 54th Annual Design Automation Conference 2017, (1-6)- Feautrier P Array expansion ACM International Conference on Supercomputing 25th Anniversary Volume, (99-111)
- Sarkar S and Maltouf M Identifying hotspots in a program for data parallel architecture Proceedings of the 5th India Software Engineering Conference, (131-137)
- Arnold M An improved DNA-sticker addition algorithm and its application to logarithmic arithmetic Proceedings of the 17th international conference on DNA computing and molecular programming, (34-48)
- Nicolau A and Kejariwal A How many threads to spawn during program multithreading? Proceedings of the 23rd international conference on Languages and compilers for parallel computing, (166-183)
- Kejariwal A, Veidenbaum A, Nicolau A, Girkar M, Tian X and Saito H (2009). On the exploitation of loop-level parallelism in embedded applications, ACM Transactions on Embedded Computing Systems (TECS), 8:2, (1-34), Online publication date: 1-Jan-2009.
- Nicolau A, Li G and Kejariwal A Techniques for efficient placement of synchronization primitives Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, (199-208)
- Baneres D, Cortadella J and Kishinevsky M Timing-driven N-way decomposition Proceedings of the 19th ACM Great Lakes symposium on VLSI, (363-368)
- Bilardi G, Ekanadham K and Pattnaik P (2009). On approximating the ideal random access machine by physical machines, Journal of the ACM (JACM), 56:5, (1-57), Online publication date: 1-Aug-2009.
- Nicolau A, Li G and Kejariwal A (2009). Techniques for efficient placement of synchronization primitives, ACM SIGPLAN Notices, 44:4, (199-208), Online publication date: 14-Feb-2009.
- Nicolau A, Li G, Veidenbaum A and Kejariwal A Synchronization optimizations for efficient execution on multi-cores Proceedings of the 23rd international conference on Supercomputing, (169-180)
- Ali Q, Pai V and Midkiff S Advanced collective communication in aspen Proceedings of the 22nd annual international conference on Supercomputing, (83-93)
- Kejariwal A, Veidenbaum A, Nicolau A, Girkarmark M, Tian X and Saito H Challenges in exploitation of loop parallelism in embedded applications Proceedings of the 4th international conference on Hardware/software codesign and system synthesis, (173-180)
- Kejariwal A, Saito H, Tian X, Girkar M, Li W, Banerjee U, Nicolau A and Polychronopoulos C Lightweight lock-free synchronization methods for multithreading Proceedings of the 20th annual international conference on Supercomputing, (361-371)
- Vasilache N, Bastoul C and Cohen A Polyhedral code generation in the real world Proceedings of the 15th international conference on Compiler Construction, (185-201)
- Kim D, Gautam G and Rajopadhye S On control signals for multi-dimensional time Proceedings of the 19th international conference on Languages and compilers for parallel computing, (141-155)
- van Engelen R, Birch J, Shou Y, Walsh B and Gallivan K A unified framework for nonlinear dependence testing and symbolic analysis Proceedings of the 18th annual international conference on Supercomputing, (106-115)
- Burke M and Cytron R (2004). Interprocedural dependence analysis and parallelization, ACM SIGPLAN Notices, 39:4, (139-154), Online publication date: 1-Apr-2004.
- Callahan D, Carr S and Kennedy K (2004). Improving register allocation for subscripted variables, ACM SIGPLAN Notices, 39:4, (328-342), Online publication date: 1-Apr-2004.
- Bastoul C Code Generation in the Polyhedral Model Is Easier Than You Think Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques, (7-16)
- Pearcey T and Pine M Channel Encyclopedia of Computer Science, (200-204)
- Bastoul C and Feautrier P Improving data locality by chunking Proceedings of the 12th international conference on Compiler construction, (320-334)
- Bik A, Girkar M, Grey P and Tian X Automatic detection of saturation and clipping idioms Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing, (61-74)
- Song Y, Xu R, Wang C and Li Z Data locality enhancement by memory reduction Proceedings of the 15th international conference on Supercomputing, (50-64)
- Peymandoust A and De Micheli G Symbolic algebra and timing driven data-flow synthesis Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, (300-305)
- Quilleré F, Rajopadhye S and Wilde D (2019). Generation of Efficient Nested Loops from Polyhedra, International Journal of Parallel Programming, 28:5, (469-498), Online publication date: 1-Oct-2000.
- Gu J and Li Z (2000). Efficient Interprocedural Array Data-Flow Analysis for Automatic Program Parallelization, IEEE Transactions on Software Engineering, 26:3, (244-261), Online publication date: 1-Mar-2000.
- Kyriakis-Bitzaros E and Goutis C (2018). A Space-Time Representation Method of Iterative Algorithms for the Design of Processor Arrays, Journal of VLSI Signal Processing Systems, 22:3, (151-162), Online publication date: 1-Sep-1999.
- August D, Sias J, Puiatti J, Mahlke S, Connors D, Crozier K and Hwu W The program decision logic approach to predicated execution Proceedings of the 26th annual international symposium on Computer architecture, (208-219)
- Schlansker M, Mahlke S and Johnson R Control CPR Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, (155-168)
- Song Y and Li Z New tiling techniques to improve cache temporal locality Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, (215-228)
- Schlansker M, Mahlke S and Johnson R (1999). Control CPR, ACM SIGPLAN Notices, 34:5, (155-168), Online publication date: 1-May-1999.
- Song Y and Li Z (1999). New tiling techniques to improve cache temporal locality, ACM SIGPLAN Notices, 34:5, (215-228), Online publication date: 1-May-1999.
- August D, Sias J, Puiatti J, Mahlke S, Connors D, Crozier K and Hwu W (1999). The program decision logic approach to predicated execution, ACM SIGARCH Computer Architecture News, 27:2, (208-219), Online publication date: 1-May-1999.
- Jin G, Li Z and Chen F (1998). An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing, IEEE Transactions on Computers, 47:5, (527-543), Online publication date: 1-May-1998.
- Pottenger W The role of associativity and commutativity in the detection and transformation of loop-level parallelism Proceedings of the 12th international conference on Supercomputing, (188-195)
- Chongwe S Simulation of aerodynamics problem on a distributed shared-memory machine Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
- Wang H, Nicolau A and Siu K (1996). The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints, IEEE Transactions on Computers, 45:11, (1257-1271), Online publication date: 1-Nov-1996.
- Wang H, Nicolau A, Keung S and Siu K (1996). Computing Programs Containing Band Linear Recurrences on Vector Supercomputers, IEEE Transactions on Parallel and Distributed Systems, 7:8, (769-782), Online publication date: 1-Aug-1996.
- Dunn D and Hsu W Instruction scheduling for the HP PA-8000 Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture, (298-307)
- Song W, Park D, Kim B and Kong Y Extracting Parallelism in Nested Loops Proceedings of the 20th Conference on Computer Software and Applications
- Beckmann C (2019). Generating Self-Scheduling Code for Nonloop Parallelism, Journal of Parallel and Distributed Computing, 39:2, (126-145), Online publication date: 15-Dec-1996.
- Bik A and Wijshoff H (2019). The Use of Iteration Space Partitioning to Construct Representative Simple Sections, Journal of Parallel and Distributed Computing, 34:1, (95-110), Online publication date: 10-Apr-1996.
- Lee G (2019). Parallelizing Iterative Loops with Conditional Branching, IEEE Transactions on Parallel and Distributed Systems, 6:2, (185-189), Online publication date: 1-Feb-1995.
- Gu J, Li Z and Lee G Symbolic array dataflow analysis for array privatization and program parallelization Proceedings of the 1995 ACM/IEEE conference on Supercomputing, (47-es)
- Tang P and Gao N Vectorization beyond data dependences Proceedings of the 9th international conference on Supercomputing, (434-443)
- Schlansker M and Kathail V Critical path reduction for scalar programs Proceedings of the 28th annual international symposium on Microarchitecture, (57-69)
- Walker W and Cragon H (1995). Interrupt Processing in Concurrent Processors, Computer, 28:6, (36-46), Online publication date: 1-Jun-1995.
- Chen Y, Wang S and Wang C Compiler techniques for maximizing fine-grain and coarse-grain parallelism in loops with uniform dependences Proceedings of the 8th international conference on Supercomputing, (204-213)
- Schlansker M, Kathail V and Anik S Height reduction of control recurrences for ILP processors Proceedings of the 27th annual international symposium on Microarchitecture, (40-51)
- Kolson D, Nicolau A and Dutt N Minimization of memory traffic in high-level synthesis Proceedings of the 31st annual Design Automation Conference, (149-154)
- Aloqeely M and Chen C Sequencer-based data path synthesis of regular iterative algorithms Proceedings of the 31st annual Design Automation Conference, (155-160)
- Acree R, Croley D, Ullah N, Gonzalez M and Samani D Parallelization and analysis of a linear adaptive filtering algorithm Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (165-172)
- Baker H (1993). Complex Gaussian integers for “Gaussian graphics”, ACM SIGPLAN Notices, 28:11, (22-27), Online publication date: 1-Nov-1993.
- Bik A and Wijshoff H Advanced compiler optimizations for sparse computations Proceedings of the 1993 ACM/IEEE conference on Supercomputing, (430-439)
- Newburn C, Huang A and Shen J Balancing Fine- and Medium-Grained Parallelism in Scheduling Loops for the XIMD Architecture Proceedings of the IFIP WG10.3. Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, (39-52)
- Allen R and Kennedy K (2019). Vector Register Allocation, IEEE Transactions on Computers, 41:10, (1290-1317), Online publication date: 1-Oct-1992.
- Min S and Baer J (2019). Design and Analysis of a Scalable Cache Coherence Scheme Based on Clocks and Timestamps, IEEE Transactions on Parallel and Distributed Systems, 3:1, (25-44), Online publication date: 1-Jan-1992.
- Girkar M and Polychronopoulos C (2019). Automatic Extraction of Functional Parallelism from Ordinary Programs, IEEE Transactions on Parallel and Distributed Systems, 3:2, (166-178), Online publication date: 1-Mar-1992.
- Hendren L, Hummell J and Nicolau A Abstractions for recursive pointer data structures Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, (249-260)
- Hendren L, Hummell J and Nicolau A (2019). Abstractions for recursive pointer data structures, ACM SIGPLAN Notices, 27:7, (249-260), Online publication date: 1-Jul-1992.
- Darnell E, Mellor-Crummey J and Kennedy K Automatic software cache coherence through vectorization Proceedings of the 6th international conference on Supercomputing, (129-138)
- Wang H and Nicolau A Speedup of band linear recurrences in the presence of resource constraints Proceedings of the 6th international conference on Supercomputing, (466-477)
- Beckmann C and Polychronopoulos C (1992). Microarchitecture support for dynamic scheduling of acyclic task graphs, ACM SIGMICRO Newsletter, 23:1-2, (140-148), Online publication date: 10-Dec-1992.
- Beckmann C and Polychronopoulos C Microarchitecture support for dynamic scheduling of acyclic task graphs Proceedings of the 25th annual international symposium on Microarchitecture, (140-148)
- Carr S and Kennedy K Compiler blockability of numerical algorithms Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (114-124)
- Mahlke S, Chen W, Gyllenhaal J and Hwu W Compiler code transformations for superscalar-based high performance systems Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (808-817)
- Cooper K, Hall M and Torczon L (1992). Unexpected side effects of inline substitution, ACM Letters on Programming Languages and Systems (LOPLAS), 1:1, (22-32), Online publication date: 1-Mar-1992.
- Li Z Compiler algorithms for event variable synchronization Proceedings of the 5th international conference on Supercomputing, (85-95)
- Polychronopoulos C The hierarchical task graph and its use in auto-scheduling Proceedings of the 5th international conference on Supercomputing, (252-263)
- Kennedy K, McKinley K and Tseng C Analysis and transformation in the ParaScope editor Proceedings of the 5th international conference on Supercomputing, (433-447)
- Nicolau A and Wang H Optimal schedules for parallel prefix computation with bounded resources Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, (1-10)
- Malony A Event-based performance perturbation Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming, (201-212)
- Nicolau A and Wang H (2019). Optimal schedules for parallel prefix computation with bounded resources, ACM SIGPLAN Notices, 26:7, (1-10), Online publication date: 1-Jul-1991.
- Malony A (2019). Event-based performance perturbation, ACM SIGPLAN Notices, 26:7, (201-212), Online publication date: 1-Jul-1991.
- Goff G, Kennedy K and Tseng C Practical dependence testing Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (15-29)
- Goff G, Kennedy K and Tseng C (1991). Practical dependence testing, ACM SIGPLAN Notices, 26:6, (15-29), Online publication date: 1-Jun-1991.
- Fujimoto R (1991). The virtual machine, ACM SIGARCH Computer Architecture News, 19:1, (35-44), Online publication date: 1-Mar-1991.
- Wang H, Nicolau A and Potasman R A new technique for induction variable removal Proceedings of the 24th annual international symposium on Microarchitecture, (172-180)
- Hall M, Kennedy K and McKinley K Interprocedural transformations for parallel code generation Proceedings of the 1991 ACM/IEEE conference on Supercomputing, (424-434)
- Nicolau A and Potasmann R Incremental tree height reduction for high level synthesis Proceedings of the 28th ACM/IEEE Design Automation Conference, (770-774)
- Pingali K, Beck M, Johnson R, Moudgill M and Stodghill P Dependence flow graphs: an algebraic approach to program dependencies Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (67-78)
- Sips H and Lin H (1991). An Improved Vector-Reduction Method, IEEE Transactions on Computers, 40:2, (214-217), Online publication date: 1-Feb-1991.
- Saxena S, Bhatt P and Prasad V (2019). Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions, IEEE Transactions on Computers, 39:3, (400-404), Online publication date: 1-Mar-1990.
- Wei B and Thompson C (1990). Area-Time Optimal Adder Design, IEEE Transactions on Computers, 39:5, (666-675), Online publication date: 1-May-1990.
- Gupta R and Soffa M (2019). Region Scheduling, IEEE Transactions on Software Engineering, 16:4, (421-431), Online publication date: 1-Apr-1990.
- Callahan D, Carr S and Kennedy K Improving register allocation for subscripted variables Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, (53-65)
- Cytron R, Ferrante J and Sarkar V Compact representations for control dependence Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, (337-351)
- Callahan D, Carr S and Kennedy K (1990). Improving register allocation for subscripted variables, ACM SIGPLAN Notices, 25:6, (53-65), Online publication date: 1-Jun-1990.
- Cytron R, Ferrante J and Sarkar V (1990). Compact representations for control dependence, ACM SIGPLAN Notices, 25:6, (337-351), Online publication date: 1-Jun-1990.
- Simons B, Alpern D and Ferrante J A foundation for sequentializing parallel code Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, (350-359)
- Ching W Automatic parallelization of APL-style programs Conference proceedings on APL 90: for the future, (76-80)
- Ching W (2019). Automatic parallelization of APL-style programs, ACM SIGAPL APL Quote Quad, 20:4, (76-80), Online publication date: 1-May-1990.
- Callahan D, Kennedy K and Subhlok J Analysis of event synchronization in a parallel programming tool Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, (21-30)
- Callahan D, Kennedy K and Subhlok J (2019). Analysis of event synchronization in a parallel programming tool, ACM SIGPLAN Notices, 25:3, (21-30), Online publication date: 1-Mar-1990.
- Hanson F A real introduction to supercomputing Proceedings of the 1990 ACM/IEEE conference on Supercomputing, (376-385)
- Cytron R, Lipkis J and Schonberg E A compiler-assisted approach to SPMD execution Proceedings of the 1990 ACM/IEEE conference on Supercomputing, (398-406)
- Lai F, Lee H and Lee C Optimization on instruction reorganization Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture, (143-148)
- Patel M A design representation for high level synthesis Proceedings of the conference on European design automation, (374-379)
- Burkhart H and Millen R (2019). Performance-Measurement Tools in a Multiprocessor Environment, IEEE Transactions on Computers, 38:5, (725-737), Online publication date: 1-May-1989.
- Padmanabhan K The composite binary cube — a family of interconnection networks for multiprocessors Proceedings of the 3rd international conference on Supercomputing, (62-71)
- Koblenz B and Noyce W Constraint based vectorization Proceedings of the 3rd international conference on Supercomputing, (195-204)
- Kim Y and Lee K Performance analysis of buffered banyan networks under nonuniform traffic Proceedings of the 3rd international conference on Supercomputing, (452-460)
- Callahan D and Sublok J (2019). Static analysis of low-level synchronization, ACM SIGPLAN Notices, 24:1, (100-111), Online publication date: 3-Jan-1989.
- Fujimoto R The virtual time machine Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, (199-208)
- Cytron R, Hind M and Hsieh W Automatic generation of DAG parallelism Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (54-68)
- Cytron R, Hind M and Hsieh W (2019). Automatic generation of DAG parallelism, ACM SIGPLAN Notices, 24:7, (54-68), Online publication date: 1-Jul-1989.
- Parker D Partial order programming (extended abstract) Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (260-266)
- Nakatani T and Ebcioğlu K “Combining” as a compilation technique for VLIW architectures Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture, (43-55)
- Nakatani T and Ebcioğlu K (1989). “Combining” as a compilation technique for VLIW architectures, ACM SIGMICRO Newsletter, 20:3, (43-55), Online publication date: 1-Aug-1989.
- Balasundaram V, Kennedy K, Kremer U, McKinley K and Subhlok J The parascope editor: an interactive parallel programming tool Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (540-550)
- Liu B and Strother N (2019). Programming in VS Fortran on the IBM 3090 for Maximum Vector Performance, Computer, 21:6, (65-76), Online publication date: 1-Jun-1988.
- Blake J, Reibman A and Trivedi K (1988). Sensitivity analysis of reliability and performability measures for multiprocessor systems, ACM SIGMETRICS Performance Evaluation Review, 16:1, (177-186), Online publication date: 1-May-1988.
- Callahan D The program summary graph and flow-sensitive interprocedual data flow analysis Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation, (47-56)
- Allen F, Burke M, Cytron R, Ferrante J and Hsieh W A framework for determining useful parallelism Proceedings of the 2nd international conference on Supercomputing, (207-215)
- Sadayappan P and Visvanathan V Parallelization and performance evaluation of circuit simulation on a shared-memory multiprocessor Proceedings of the 2nd international conference on Supercomputing, (254-265)
- Swensen J and Patt Y Hierarchical registers for scientific computers Proceedings of the 2nd international conference on Supercomputing, (346-354)
- Feautrier P Array expansion Proceedings of the 2nd international conference on Supercomputing, (429-441)
- Tang P, Yew P and Zhu C Impact of self-scheduling order on performance on multiprocessor systems Proceedings of the 2nd international conference on Supercomputing, (593-603)
- Blake J, Reibman A and Trivedi K Sensitivity analysis of reliability and performability measures for multiprocessor systems Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems, (177-186)
- Burke M, Cytron R, Ferrante J, Hsieh W, Sarkar V and Shields D Automatic discovery of parallelism: a tool and an experiment (extended abstract) Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems, (77-84)
- Li Z and Yew P Efficient interprocedural analysis for program parallelization and restructuring Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems, (85-99)
- Burke M, Cytron R, Ferrante J, Hsieh W, Sarkar V and Shields D (1988). Automatic discovery of parallelism: a tool and an experiment (extended abstract), ACM SIGPLAN Notices, 23:9, (77-84), Online publication date: 1-Sep-1988.
- Li Z and Yew P (2019). Efficient interprocedural analysis for program parallelization and restructuring, ACM SIGPLAN Notices, 23:9, (85-99), Online publication date: 1-Sep-1988.
- Uht A and Kolen J (1988). On the combination of hardware and software concurrency extraction methods, ACM SIGMICRO Newsletter, 19:1-2, (53-57), Online publication date: 1-Jun-1988.
- Lipovski G and Vaughan P (1988). A fetch-and-op implementation for parallel computers, ACM SIGARCH Computer Architecture News, 16:2, (384-392), Online publication date: 17-May-1988.
- Callahan D and Sublok J Static analysis of low-level synchronization Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging, (100-111)
- Horwitz S, Prins J and Reps T On the adequacy of program dependence graphs for representing programs Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (146-157)
- Callahan D (2019). The program summary graph and flow-sensitive interprocedual data flow analysis, ACM SIGPLAN Notices, 23:7, (47-56), Online publication date: 1-Jul-1988.
- Lipovski G and Vaughan P A fetch-and-op implementation for parallel computers Proceedings of the 15th Annual International Symposium on Computer architecture, (384-392)
- Gikar M and Polychronopoulos C Compiling issues for supercomputers Proceedings of the 1988 ACM/IEEE conference on Supercomputing, (164-173)
- Despain A, Patt Y, Srini V, Bitar P, Bush W, Chien C, Citrin W, Fagin B, Hwu W, Melvin S, McGeer R, Singhal A, Shebanow M and Van Roy P (1987). Aquarius, ACM SIGARCH Computer Architecture News, 15:1, (22-34), Online publication date: 1-Mar-1987.
- Uht A, Polychronopoulos C and Kolen J On the combination of hardware and software concurrency extraction methods Proceedings of the 20th annual workshop on Microprogramming, (133-141)
- Bilardi G and Preparata F Size-time complexity of Boolean networks for prefix computations Proceedings of the nineteenth annual ACM symposium on Theory of computing, (436-442)
- Swensen J and Patt Y Fast temporary storage for serial and parallel execution Proceedings of the 14th annual international symposium on Computer architecture, (35-43)
- Allen r, Callahan D and Kennedy K Automatic decomposition of scientific programs for parallel execution Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (63-76)
- Polychronopoulus C and Banerjee U (1987). Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds, IEEE Transactions on Computers, 36:4, (410-420), Online publication date: 1-Apr-1987.
- Burke M and Cytron R Interprocedural dependence analysis and parallelization Proceedings of the 1986 SIGPLAN symposium on Compiler construction, (162-175)
- Burke M and Cytron R (2019). Interprocedural dependence analysis and parallelization, ACM SIGPLAN Notices, 21:7, (162-175), Online publication date: 1-Jul-1986.
- Kung H (2019). Memory requirements for balanced computer architectures, ACM SIGARCH Computer Architecture News, 14:2, (49-54), Online publication date: 1-May-1986.
- Hsu P and Davidson E (2019). Highly concurrent scalar processing, ACM SIGARCH Computer Architecture News, 14:2, (386-395), Online publication date: 1-May-1986.
- Kunkel S and Smith J (1986). Optimal pipelining in supercomputers, ACM SIGARCH Computer Architecture News, 14:2, (404-411), Online publication date: 1-May-1986.
- Thoreson S, Long A and Kerns J Performance of three dataflow computers Proceedings of the 1986 ACM fourteenth annual conference on Computer science, (93-99)
- Frenkel K (1986). Evaluating two massively parallel machines, Communications of the ACM, 29:8, (752-758), Online publication date: 1-Aug-1986.
- Kung H Memory requirements for balanced computer architectures Proceedings of the 13th annual international symposium on Computer architecture, (49-54)
- Hsu P and Davidson E Highly concurrent scalar processing Proceedings of the 13th annual international symposium on Computer architecture, (386-395)
- Kunkel S and Smith J Optimal pipelining in supercomputers Proceedings of the 13th annual international symposium on Computer architecture, (404-411)
- Banerjee R and Abraham J (1986). Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems, IEEE Transactions on Computers, 35:4, (296-306), Online publication date: 1-Apr-1986.
- Sinha B, Bhattacharya B, Ghose S and Srimani P (1986). A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation, IEEE Transactions on Computers, 35:11, (1000-1004), Online publication date: 1-Nov-1986.
- Lakshmivarahan S and Dhall S A new class of parallel algorithms for solving linear tridiagonal systems Proceedings of 1986 ACM Fall joint computer conference, (315-324)
- Fich F and Tompa M The parallel complexity of exponentiating polynomials over finite fields Proceedings of the seventeenth annual ACM symposium on Theory of computing, (38-47)
- Kuck D Supercomputers and distributed computing Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, (34-46)
- Li Z and Abu-Sufah W (1985). A technique for reducing synchronization overhead in large scale multiprocessors, ACM SIGARCH Computer Architecture News, 13:3, (284-291), Online publication date: 1-Jun-1985.
- Conrad M (1985). On design principles for a molecular computer, Communications of the ACM, 28:5, (464-480), Online publication date: 1-May-1985.
- Li Z and Abu-Sufah W A technique for reducing synchronization overhead in large scale multiprocessors Proceedings of the 12th annual international symposium on Computer architecture, (284-291)
- Chan T and Schreiber R (2006). Parallel Networks for Multi-Grid Algorithms, SIAM Journal on Scientific and Statistical Computing, 6:3, (698-711), Online publication date: 1-Jul-1985.
- Fortes J and Moldovan D (2019). Data broadcasting in linearly scheduled array processors, ACM SIGARCH Computer Architecture News, 12:3, (224-231), Online publication date: 1-Jun-1984.
- Banerjee P and Abraham J (2019). Fault-secure algorithms for multiple-processor systems, ACM SIGARCH Computer Architecture News, 12:3, (279-287), Online publication date: 1-Jun-1984.
- Fortes J and Moldovan D Data broadcasting in linearly scheduled array processors Proceedings of the 11th annual international symposium on Computer architecture, (224-231)
- Banerjee P and Abraham J Fault-secure algorithms for multiple-processor systems Proceedings of the 11th annual international symposium on Computer architecture, (279-287)
- Warren J A hierarchical basis for reordering transformations Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (272-282)
- Ottenstein K (1984). Intermediate program representations in compiler construction, ACM SIGPLAN Notices, 19:7, (25-27), Online publication date: 1-Jul-1984.
- Marwedel P The mimola design system Proceedings of the 21st Design Automation Conference, (587-593)
- Kim W, Gajski D and Kuck D (1984). A parallel pipelined relational query processor, ACM Transactions on Database Systems (TODS), 9:2, (214-235), Online publication date: 3-Jun-1984.
- Wagner R (2019). The Boolean Vector Machine [BVM], ACM SIGARCH Computer Architecture News, 11:3, (59-66), Online publication date: 30-Jun-1983.
- Ferrante J and Ottenstein K A program form based on data dependency in predicate regions Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (217-236)
- Wagner R The Boolean Vector Machine [BVM] Proceedings of the 10th annual international symposium on Computer architecture, (59-66)
- Parkinson D and Liddell H (1983). The Measurement of Performance on a Highly Parallel System, IEEE Transactions on Computers, 32:1, (32-37), Online publication date: 1-Jan-1983.
- Hockney R (1983). Characterizing Computers and Optimizing the FACR(l) Poisson-Solver on Parallel Unicomputers, IEEE Transactions on Computers, 32:10, (933-941), Online publication date: 1-Oct-1983.
- Shauchi Ong and Atkins D (1983). A Basis for the Quantitative Comparison of Computer Number Systems, IEEE Transactions on Computers, 32:4, (359-369), Online publication date: 1-Apr-1983.
- Horowitz E and Zorat A (1983). Divide-and-Conquer for Parallel Processing, IEEE Transactions on Computers, 32:6, (582-585), Online publication date: 1-Jun-1983.
- Uhr L (1982). Comparing Serial Computers, Arrays, and Networks Using Measures of "Active Resources", IEEE Transactions on Computers, 31:10, (1022-1025), Online publication date: 1-Oct-1982.
- Irani K and Kuo-Wei Chen (1982). Minimization of Interprocessor Communication for Parallel Computation, IEEE Transactions on Computers, 31:11, (1067-1075), Online publication date: 1-Nov-1982.
- Brent R and Kung H (1982). A Regular Layout for Parallel Adders, IEEE Transactions on Computers, 31:3, (260-264), Online publication date: 1-Mar-1982.
- Kuck D and Stokes R (1982). The Burroughs Scientific Processor (BSP), IEEE Transactions on Computers, 31:5, (363-376), Online publication date: 1-May-1982.
- Swartzlander E and Gilbert B (1982). Supersystems, IEEE Transactions on Computers, 31:5, (399-409), Online publication date: 1-May-1982.
- Marwedel P (1981). A retargetable microcode generation system for a high-level microprogramming language, ACM SIGMICRO Newsletter, 12:4, (115-123), Online publication date: 1-Dec-1981.
- Davidson S and Shriver B Specifying target resources in a machine independent higher level language Proceedings of the May 4-7, 1981, national computer conference, (81-85)
- Kuck D, Kuhn R, Padua D, Leasure B and Wolfe M Dependence graphs and compiler optimizations Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (207-218)
- Marwedel P A retargetable microcode generation system for a high-level microprogramming language Proceedings of the 14th annual workshop on Microprogramming, (115-123)
- Abu-Sufah W, Kuck D and Lawrie D (1981). On the Performance Enhancement of Paging Systems Through Program Analysis and Transformations, IEEE Transactions on Computers, 30:5, (341-356), Online publication date: 1-May-1981.
- VanAken J and Zick G (1981). The Expression Processor, IEEE Transactions on Computers, 30:8, (525-536), Online publication date: 1-Aug-1981.
- Poe M (1980). Heuristics for the global optimization of microprograms, ACM SIGMICRO Newsletter, 11:3-4, (13-22), Online publication date: 1-Dec-1980.
- Nudd G Image understanding architectures Proceedings of the May 19-22, 1980, national computer conference, (377-390)
- Irwin M and Heller D Online pipeline systems for recursive numeric computations Proceedings of the 7th annual symposium on Computer Architecture, (292-299)
- Casavant A, Gajski D and Kuck D Automatic design with dependence graphs Proceedings of the 17th Design Automation Conference, (506-515)
- Poe M Heuristics for the global optimization of microprograms Proceedings of the 13th annual workshop on Microprogramming, (13-22)
- Brent R and Kung H The chip complexity of binary arithmetic Proceedings of the twelfth annual ACM symposium on Theory of computing, (190-200)
- Padua D, Kuck D and Lawrie D (1980). High-Speed Multiprocessors and Compilation Techniques, IEEE Transactions on Computers, 29:9, (763-776), Online publication date: 1-Sep-1980.
- Irwin M A pipelined processing unit for on-line division Proceedings of the 5th annual symposium on Computer architecture, (24-30)
Index Terms
- Structure of Computers and Computations
Recommendations
A mini-micro computers link promotes distributed processing in scientific and engineering computations
Engineering and scientific work often requires complex computations of different types that should be carried out on different types of computers on the one hand, but must communicate and support each other on the other. In recent years, the ...
General-Purpose Computations Using Graphics Processors
General-purpose graphics processing extends graphics-processor use to nongraphics applications.