Results 291 to 300 of about 52,467,368 (351)
Some of the next articles are maybe not open access.
Interprocedural parallelization analysis in SUIF
ACM Transactions on Programming Languages and Systems, 2005As shared-memory multiprocessor systems become widely available, there is an increasing need for tools to simplify the task of developing parallel programs. This paper describes one such tool, the automatic parallelization system in the Stanford SUIF compiler. This article represents a culmination of a several-year research effort aimed at
Mary W. Hall +4 more
openaire +1 more source
Parallel face analysis platform
2010 IEEE International Conference on Multimedia and Expo, 2010In this paper, we proposed an advanced face analysis platform for large-scale consumer photos, namely PFAP. Leveraging Client/Server architecture, the platform provides users high-performance face clustering and near-real time image retrieval service. Advanced face analysis schema, two-level parallel computing architecture and analysis as a service are
Lei Wang +4 more
openaire +2 more sources
Analysis of Programs for Parallel Processing
IEEE Transactions on Electronic Computers, 1966A set of conditions are described which determine whether or not two successive portions of a given program can be performed in parallel and still produce the same results. The conditions are general and can be applied to sections of the program of arbitrary size.
openaire +2 more sources
Application Analysis for Parallel Processing
2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools, 2008Effective mapping of multimedia applications on massively parallel embedded systems is a challenging demand in the domain of compiler design. The software implementations of emerging multimedia applications are often huge and it is virtually impossible to analyze these applications for parallel processing without generic automated tools.
Muhammad Rashid 0001 +2 more
openaire +1 more source
Parallel Analysis of Certain Endgames
ICGA Journal, 1989A massively-parallel retrograde endgame-analysis implementation is described. The max-to-win and percent-win figures for eighty 5-piece endgames without Pawns were computed in 227 minutes using a 32K-processor Connection Machine Model CM-2 with a VAX 8800 front end. This represents substantial speedup over previous implementations.
openaire +1 more source
Analysis of parallel uniform hashing
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabrizio Luccio +2 more
openaire +1 more source
Analysis tool for parallel systems
1993 Euromicro Workshop on Parallel and Distributed Processing, 2002This paper describes a system for the creation of the traces of programs consisting of sets of parallel processes that communicate via message passing. The system uses a communicating sequential process (CSP) model to represent the program from which the traces are created. The system is based around the X-windows environment.
O. J. Saiz, Andrew M. Tyrrell
openaire +1 more source
Parallel algorithms and static analysis of parallel programs
1987Within the framework of the metamodel of parallel data processing two sub-classes of models are distinguished supported by original language means. These means allow special marking of processing into subprocesses and to define various interactions between the PA-branches of p-algorithms.
openaire +2 more sources
Program parallelization with interprocedural analysis
The Journal of Supercomputing, 1988In this paper, we review several important issues in interprocedural analysis for parallel computing: call effects, variable aliasing, and execution context. We show the use of traditional summary data flow information in program transformation for parallel computing.
Zhiyuan Li 0001, Pen-Chung Yew
openaire +2 more sources
Parallel processing in DNA analysis
1995Potential analogies exist between the way computers process and analyze data and the way data is handled in biological systems. Biological data is predominantly in the form of DNA. DNA data is at least two-fold redundant, and it is often multi-fold redundant. Thus it is relatively error resistant.
Charles R. Cantor +3 more
openaire +1 more source