schliessen

Filtern

 

Bibliotheken

Cover Image

Achieving speedups for APL on an SIMD distributed memory machine

Despite such advantages as a large user community and its parallel semantics, APL is often overlooked as a programming language for parallel computers. Researchers considered the potential speedup for single instruction stream, multiple data stream (SIMD) parallel implementations of APL programs. Bo... Full description

Journal Title: International journal of parallel programming 1990, Vol.19 (2), p.111-127
Main Author: GREENLAW, R
Other Authors: SNYDER, L
Format: Electronic Article Electronic Article
Language: English
Subjects:
Algorithms
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Effectiveness
Exact sciences and technology
Implementations
Parallel processing
Programming languages
Simulation
Software
Studies
Publisher: New York, NY: Plenum Press
ID: ISSN: 0885-7458
Link: http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4770709
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_proquest_miscellaneous_743121502
title: Achieving speedups for APL on an SIMD distributed memory machine
format: Article
creator:
  • GREENLAW, R
  • SNYDER, L
subjects:
  • Algorithms
  • Applied sciences
  • Computer science
  • control theory
  • systems
  • Computer systems and distributed systems. User interface
  • Effectiveness
  • Exact sciences and technology
  • Implementations
  • Parallel processing
  • Programming languages
  • Simulation
  • Software
  • Studies
ispartof: International journal of parallel programming, 1990, Vol.19 (2), p.111-127
description: Despite such advantages as a large user community and its parallel semantics, APL is often overlooked as a programming language for parallel computers. Researchers considered the potential speedup for single instruction stream, multiple data stream (SIMD) parallel implementations of APL programs. Both analytical and simulated empirical studies were conducted. The approach taken recognized that almost 95% of the operators appearing in APL programs are either scalar primitive, reduction, or indexing. Thus, the performance of the operators provides a good estimate of the amount of speedup a full program might receive. Substantial speedups were demonstrated for the operators. Empirical evidence was found to be in accord with analytical estimates.
language: eng
source:
identifier: ISSN: 0885-7458
fulltext: no_fulltext
issn:
  • 0885-7458
  • 1573-7640
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK1.454622
LOCALfalse
PrimoNMBib
record
control
sourceidproquest_cross
recordidTN_cdi_proquest_miscellaneous_743121502
sourceformatXML
sourcesystemPC
sourcerecordid25582975
originalsourceidFETCH-LOGICAL-1356t-3b88aeab465c30589faa086bc504c4274bf2b565df01facbaaa2a8e77a48a3120
addsrcrecordideNp90F9LwzAUBfAgCs7pi58giCgI1Zs0adI353Q6mCioz-U2TbWj_0xaYd_ejg0FH3y6L79z4B5CjhlcMgB1dTMDJkDpMNwhIyZVGKhIwC4ZgdYyUELqfXLg_RIAYqX1iFxPzEdhv4r6nfrW2qxvPc0bRyfPC9rUFGv6Mn-8pVnhO1ekfWczWtmqcSta4ZCs7SHZy7H09mh7x-Rtdvc6fQgWT_fz6WQRsFBGXRCmWqPFVETShCB1nCOCjlIjQRjBlUhznspIZjmwHE2KiBy1VQqFxpBxGJPzTW_rms_e-i6pCm9sWWJtm94nSgyKSVjLs38ll1LzWMkBnvyBy6Z39fBFwkHwGEIWD-hig4xrvHc2T1pXVOhWCYNkvXnyu_mAT7eN6A2WucPaFP4nIZQCBTF8A0Kzfc4
sourcetypeAggregation Database
isCDItrue
recordtypearticle
pqid204290319
display
typearticle
titleAchieving speedups for APL on an SIMD distributed memory machine
creatorGREENLAW, R ; SNYDER, L
creatorcontribGREENLAW, R ; SNYDER, L
descriptionDespite such advantages as a large user community and its parallel semantics, APL is often overlooked as a programming language for parallel computers. Researchers considered the potential speedup for single instruction stream, multiple data stream (SIMD) parallel implementations of APL programs. Both analytical and simulated empirical studies were conducted. The approach taken recognized that almost 95% of the operators appearing in APL programs are either scalar primitive, reduction, or indexing. Thus, the performance of the operators provides a good estimate of the amount of speedup a full program might receive. Substantial speedups were demonstrated for the operators. Empirical evidence was found to be in accord with analytical estimates.
identifier
0ISSN: 0885-7458
1EISSN: 1573-7640
2DOI: 10.1007/BF01407833
3CODEN: IJPPE5
languageeng
publisherNew York, NY: Plenum Press
subjectAlgorithms ; Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Effectiveness ; Exact sciences and technology ; Implementations ; Parallel processing ; Programming languages ; Simulation ; Software ; Studies
ispartofInternational journal of parallel programming, 1990, Vol.19 (2), p.111-127
rights
01993 INIST-CNRS
1Copyright Plenum Publishing Corporation Apr 1990
lds50peer_reviewed
citesFETCH-LOGICAL-1356t-3b88aeab465c30589faa086bc504c4274bf2b565df01facbaaa2a8e77a48a3120
links
openurl$$Topenurl_article
thumbnail$$Usyndetics_thumb_exl
backlink$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4770709$$DView record in Pascal Francis
search
creatorcontrib
0GREENLAW, R
1SNYDER, L
title
0Achieving speedups for APL on an SIMD distributed memory machine
1International journal of parallel programming
descriptionDespite such advantages as a large user community and its parallel semantics, APL is often overlooked as a programming language for parallel computers. Researchers considered the potential speedup for single instruction stream, multiple data stream (SIMD) parallel implementations of APL programs. Both analytical and simulated empirical studies were conducted. The approach taken recognized that almost 95% of the operators appearing in APL programs are either scalar primitive, reduction, or indexing. Thus, the performance of the operators provides a good estimate of the amount of speedup a full program might receive. Substantial speedups were demonstrated for the operators. Empirical evidence was found to be in accord with analytical estimates.
subject
0Algorithms
1Applied sciences
2Computer science; control theory; systems
3Computer systems and distributed systems. User interface
4Effectiveness
5Exact sciences and technology
6Implementations
7Parallel processing
8Programming languages
9Simulation
10Software
11Studies
issn
00885-7458
11573-7640
fulltextfalse
rsrctypearticle
creationdate1990
recordtypearticle
recordideNp90F9LwzAUBfAgCs7pi58giCgI1Zs0adI353Q6mCioz-U2TbWj_0xaYd_ejg0FH3y6L79z4B5CjhlcMgB1dTMDJkDpMNwhIyZVGKhIwC4ZgdYyUELqfXLg_RIAYqX1iFxPzEdhv4r6nfrW2qxvPc0bRyfPC9rUFGv6Mn-8pVnhO1ekfWczWtmqcSta4ZCs7SHZy7H09mh7x-Rtdvc6fQgWT_fz6WQRsFBGXRCmWqPFVETShCB1nCOCjlIjQRjBlUhznspIZjmwHE2KiBy1VQqFxpBxGJPzTW_rms_e-i6pCm9sWWJtm94nSgyKSVjLs38ll1LzWMkBnvyBy6Z39fBFwkHwGEIWD-hig4xrvHc2T1pXVOhWCYNkvXnyu_mAT7eN6A2WucPaFP4nIZQCBTF8A0Kzfc4
startdate1990
enddate1990
creator
0GREENLAW, R
1SNYDER, L
general
0Plenum Press
1Springer Nature B.V
scope
0IQODW
1AAYXX
2CITATION
37SC
48FD
5JQ2
6L7M
7L~C
8L~D
sort
creationdate1990
titleAchieving speedups for APL on an SIMD distributed memory machine
authorGREENLAW, R ; SNYDER, L
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-1356t-3b88aeab465c30589faa086bc504c4274bf2b565df01facbaaa2a8e77a48a3120
rsrctypearticles
prefilterarticles
languageeng
creationdate1990
topic
0Algorithms
1Applied sciences
2Computer science; control theory; systems
3Computer systems and distributed systems. User interface
4Effectiveness
5Exact sciences and technology
6Implementations
7Parallel processing
8Programming languages
9Simulation
10Software
11Studies
toplevelpeer_reviewed
creatorcontrib
0GREENLAW, R
1SNYDER, L
collection
0Pascal-Francis
1CrossRef
2Computer and Information Systems Abstracts
3Technology Research Database
4ProQuest Computer Science Collection
5Advanced Technologies Database with Aerospace
6Computer and Information Systems Abstracts – Academic
7Computer and Information Systems Abstracts Professional
jtitleInternational journal of parallel programming
delivery
delcategoryRemote Search Resource
fulltextno_fulltext
addata
au
0GREENLAW, R
1SNYDER, L
formatjournal
genrearticle
ristypeJOUR
atitleAchieving speedups for APL on an SIMD distributed memory machine
jtitleInternational journal of parallel programming
date1990
risdate1990
volume19
issue2
spage111
epage127
pages111-127
issn0885-7458
eissn1573-7640
codenIJPPE5
abstractDespite such advantages as a large user community and its parallel semantics, APL is often overlooked as a programming language for parallel computers. Researchers considered the potential speedup for single instruction stream, multiple data stream (SIMD) parallel implementations of APL programs. Both analytical and simulated empirical studies were conducted. The approach taken recognized that almost 95% of the operators appearing in APL programs are either scalar primitive, reduction, or indexing. Thus, the performance of the operators provides a good estimate of the amount of speedup a full program might receive. Substantial speedups were demonstrated for the operators. Empirical evidence was found to be in accord with analytical estimates.
copNew York, NY
pubPlenum Press
doi10.1007/BF01407833