A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
The Paradigm compiler for distributed-memory multicomputers
1995
Computer
Preserved Fulltext
A flexible compiler framework for distributed-memory multicomputers automatically parallelizes sequential programs. ...
The Paradigm (Parallelizing Compiler for Distributed-Memory, General-Purpose Multicomputers) project at the University of Illinois addresses this problem by developing automatic methods for efficient parallelization ...
We are also grateful to the National Center for Supercomputing Applications, the San Diego Supercomputing Center, and the Argonne National Laboratory for providing access to their machines. ...
doi:10.1109/2.467577
fatcat:ghmtervcfzehzlelvf2ealwgyu
50 & 25 Years Ago
2020
Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Paradigm approaches these problems through a combination of flexible, irregular runtime support and compile-time analysis." (p. 46) "Paradigm is a flexible parallelizing compiler for multicomputers. ...
The Paradigm Compiler for Distributed-Memory Multicomputers; Prithviraj Banerjee et al. ...
doi:10.1109/mc.2020.3010073
fatcat:gd35v3gdvjcv7g4xqpmyvlw7k4
TRAPEDS: producing traces for multicomputers via execution driven simulation
1989
Performance Evaluation Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In general, it makes little sense to store the multicomputer traces if the multicomputer is available for use in trace analysis, and if the extra analysis routines do not cause the execution module's size ...
STEP 2: All source written in C is compiled to assembly language. ...
doi:10.1145/75372.75380
fatcat:tul3hs3ya5eyzittekqitxdnlq
TRAPEDS: producing traces for multicomputers via execution driven simulation
1989
Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Capturing address traces for these simulations is a difficult problem for single processors and particularly for multicomputers. ...
Trace-driven simulation is an important aid in performance analysis of computer systems. ...
In general, it makes little sense to store the multicomputer traces if the multicomputer is available for use in w e analysis, and if the extra analysis routines do not cause the execution module's size ...
doi:10.1145/75108.75380
dblp:conf/sigmetrics/StunkelF89
fatcat:scgjoadlz5afvpd6czsewr2jiq
A Parallel Processing Framework for Real-Time Software-Only Video Compression for Broadcast and Mobile Services
2006
Journal of Intelligent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper develops a generic parallel processing framework on embedded multicomputer systems for real-time video compression for convergent broadcast and cellular services. ...
The parallel processing framework not only can be configured with different number of processors on an embedded multicomputer system but also is portable onto varied embedded multicomputer platforms. ...
ACKNOWLEDGMENTS
Real-Time Video Compression for Broadcast & Mobile Services Tiwari, P. and Viscito, E. 1996. ...
doi:10.1515/jisys.2006.15.1-4.261
fatcat:36mn23ixsbdg7cv3a5vcgqpime
Scalable, parallel computers: Alternatives, issues, and challenges
1994
International journal of parallel programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
system, compilers, performance monitoring, etc.). ...
However, it has been the experience of the scientists in our research group that a certain amount of long-distance communication is unavoidable for these types of applications. ...
Clearly, research challenges exist in architectures and compilers to increase parallelism for a single processor. ...
doi:10.1007/bf02577791
fatcat:jnvgpsftabcnnabkmpcm5kifqq
Models of machines and computation for mapping in multicomputers
1993
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
For this reason we hope that
work can continue
on the analysis
of con-
tention
in the communications
resource
during
multicomputer
computation. ...
A FRAMEWORK
FOR DISCUSSING
MODELS OF A MULTICOMPUTER In this section we present a framework for discussing the activity of the processors of a multicomputer. ...
doi:10.1145/158439.158908
fatcat:pekvoq2nejepxbu7mv7dbqe5qa
Key Concepts of the INCAS Multicomputer Project
1987
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This paper gives an overview of the INCAS (INCremental Architecture for distributed Systems) multicomputer project, which aims at the development of a comprehensive methodology for the design and implementation ...
Index Terms-Distributed operating systems, distributed programming languages, distributed systems, distributed testing, message passing, multicast communication, multicomputer. munication concept. ...
Jeffery for their helpful comments on the final version of this paper, and the anonymous reviewers for helping us to express our ideas better. ...
doi:10.1109/tse.1987.233510
fatcat:hvu7bysybbf2paivuacbfckztq
Communication-Free Data Allocation Techniques for Parallelizing Compilers on Multicomputers
1993
1993 International Conference on Parallel Processing - ICPP'93 Vol2
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we devote our efforts to the techniques of allocating array elements of nested loops onto multicomputers in a communication-free fashion for parallelizing compilers. ...
In distributed memory multicomputers, local memory accesses are much faster than those involving interprocessor communication. ...
for parallelizing compilers. ...
doi:10.1109/icpp.1993.56
dblp:conf/icpp/ChenS93
fatcat:xmxreuf42zbttkbxv2sn6mhuou
A lab course on computer architecture
1998
Proceedings of the 1998 workshop on Computer architecture education - WCAE '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
They have been designed for a course length of 30 hours and they only require standard personal computers and some simulation tools. ...
In this paper, the laboratory exercises for a course on computer architecture in the Computer Engineering degree at the Universidad Politécnica de Valencia are presented. ...
Two real programs (an Occam language compiler and a multicomputer simulator) and the well-known Dhrystone and Whetstone benchmarks are used. ...
doi:10.1145/1275182.1275193
dblp:conf/wcae/LopezD98
fatcat:acumg7ojzzby7nvh7d2gcbhhia
Communication-free data allocation techniques for parallelizing compilers on multicomputers
1994
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we devote our efforts to the techniques of allocating array elements of nested loops onto multicomputers in a communication-free fashion for parallelizing compilers. ...
In distributed memory multicomputers, local memory accesses are much faster than those involving interprocessor communication. ...
for parallelizing compilers. ...
doi:10.1109/71.308531
fatcat:afi4337x2bgqjjckzo7h73i34e
The Data Mover: A Machine-Independent Abstraction for Managing Customized Data Motion
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
The Data Mover currently serves as useful middleware for application library designers, but defines a simple machine-independent interface suitable as a target for a compiler or compiler run time library ...
We describe the Data Mover model of communication, and present performance for various applications. ...
Thanks go to Richard Frost for assistance in building the KeLP distribution, and in providing KeLP tutorials to the user community. ...
doi:10.1007/3-540-44905-1_21
fatcat:32polp3dcbgzbikn2n6vneqh3y
Automatic array alignment for distributed memory multicomputers
1994
Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our compiler technique \resurrects" the lost dimensions of the data arrays to successfully apply automatic data alignment. ...
We h a ve implemented automatic alignment in our imperative language using techniques similar to those used for the functional language Crystal. ...
Analysis phase and Program Mapping phase, as shown Figure 1. ...
doi:10.1109/hicss.1994.323282
fatcat:f3pu32tsqjhnhhqgsqsgs3e63i
Implementation Of Adetran Language Using Message Passing Interface
2016
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Two methods for implementation of pass statement are discussed and the performance evaluation using Splitting-Up CG method is presented. ...
ACKNOWLEDGMENTS We are grateful to Professor Tatsuo Nogi of Kyoto University for helpful discussions. ...
We received generous support from Professor Shinji Odanaka of Osaka University for using SX-ACE supercomputers. The author would like to express his gratitude to both professors. ...
doi:10.5281/zenodo.1112176
fatcat:kx2hfwyaizcxldj7naksx7p4aa
AN ASSESSMENT OF THE CONNECTION MACHINE
1993
International journal of high speed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These are contrasted with the same issues in MD multiprocessors and multicomputers. ...
Compiler analysis of entire programs (interprocedura] analysis) to al. low for better optimization. ...
The CM does not do particularly well on problems for which the underlying communication scheme is grid oriented. ...
doi:10.1142/s0129053393000220
fatcat:simo6to2hnamhec4itephqirvm
« Previous
Showing results 1 — 15 out of 701 results