IMPROVED DESIGN FOR A STOCHASTICALLY CONFLICT-FREE MEMORY/INTERCONNECTION SYSTEM.

David Klappholz

IMPROVED DESIGN FOR A STOCHASTICALLY CONFLICT-FREE MEMORY/INTERCONNECTION SYSTEM.

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

A symbolically-programmable MIMD machine is an MIMD machine whose programs can be written in an almost-conventional, symbolic high-level language without significant loss of the speedup promised by their underlying parallel algorithms. This is the case even though such programs ignore the issues raised by network and memory interference and by network-traversal delay. An improved design is presented for a family of symbolically-programmable MIMD machines, a design termed stochastically conflict-free.

Original language	English
Pages	443-448
Number of pages	6
State	Published - 1981
Event	Conf Rec Asilomar Conf Circuits Syst Comput 14th - Pacific Grove, CA, USA Duration: 17 Nov 1980 → 19 Nov 1980

Conference

Conference	Conf Rec Asilomar Conf Circuits Syst Comput 14th
City	Pacific Grove, CA, USA
Period	17/11/80 → 19/11/80

Cite this

@conference{b87e590701d6424e985aefdfec3eb023,

title = "IMPROVED DESIGN FOR A STOCHASTICALLY CONFLICT-FREE MEMORY/INTERCONNECTION SYSTEM.",

abstract = "A symbolically-programmable MIMD machine is an MIMD machine whose programs can be written in an almost-conventional, symbolic high-level language without significant loss of the speedup promised by their underlying parallel algorithms. This is the case even though such programs ignore the issues raised by network and memory interference and by network-traversal delay. An improved design is presented for a family of symbolically-programmable MIMD machines, a design termed stochastically conflict-free.",

author = "David Klappholz",

year = "1981",

language = "English",

pages = "443--448",

note = "Conf Rec Asilomar Conf Circuits Syst Comput 14th ; Conference date: 17-11-1980 Through 19-11-1980",

}

TY - CONF

T1 - IMPROVED DESIGN FOR A STOCHASTICALLY CONFLICT-FREE MEMORY/INTERCONNECTION SYSTEM.

AU - Klappholz, David

PY - 1981

Y1 - 1981

N2 - A symbolically-programmable MIMD machine is an MIMD machine whose programs can be written in an almost-conventional, symbolic high-level language without significant loss of the speedup promised by their underlying parallel algorithms. This is the case even though such programs ignore the issues raised by network and memory interference and by network-traversal delay. An improved design is presented for a family of symbolically-programmable MIMD machines, a design termed stochastically conflict-free.

AB - A symbolically-programmable MIMD machine is an MIMD machine whose programs can be written in an almost-conventional, symbolic high-level language without significant loss of the speedup promised by their underlying parallel algorithms. This is the case even though such programs ignore the issues raised by network and memory interference and by network-traversal delay. An improved design is presented for a family of symbolically-programmable MIMD machines, a design termed stochastically conflict-free.

UR - http://www.scopus.com/inward/record.url?scp=0019688649&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019688649&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0019688649

SP - 443

EP - 448

T2 - Conf Rec Asilomar Conf Circuits Syst Comput 14th

Y2 - 17 November 1980 through 19 November 1980

ER -

IMPROVED DESIGN FOR A STOCHASTICALLY CONFLICT-FREE MEMORY/INTERCONNECTION SYSTEM.

Abstract

Conference

Other files and links

Fingerprint

Cite this