𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Switcherland: A scalable interconnection structure for distributed systems

✍ Scribed by Hans Eberle

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
916 KB
Volume
44
Category
Article
ISSN
1383-7621

No coin nor oath required. For personal study only.

✦ Synopsis

Switcherland is a scalable interconnection structure for distributed systems, it is scalable in that it uses switches that can serve as an I/O interconnection structure of a workstation as well as a network interconnection structure of a cluster of workstations. Switcherland realizes a distributed shared memory, that is, local communication within a workstation as well as remote communication within a cluster of workstations translate to load and store operations. Further, Switcherland offers quality of service (QoS) in that memory is accessed at guaranteed rates and in bounded time.

The "natural" programming model offered by the distributed shared memory and the real-time support provided in the form of QoS make Switcherland an ideal platform for distributed multimedia applications.

πŸ“œ SIMILAR VOLUMES

A Task Duplication Based Scalable Schedu
A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems
✍ Sekhar Darbha; Dharma P. Agrawal πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 466 KB

One of the major limitations of distributed memory systems (DMSs) is the high cost for interprocessor communication, which can be minimized by having an efficient task partitioning and scheduling algorithm. It is well known that scheduling the tasks of a directed acyclic graph (DAG) to obtain an opt

Nagging: A scalable fault-tolerant parad
Nagging: A scalable fault-tolerant paradigm for distributed search
✍ Alberto Maria Segre; Sean Forman; Giovanni Resta; Andrew Wildenberg πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 387 KB

This paper describes nagging, a technique for parallelizing search in a heterogeneous distributed computing environment. Nagging exploits the speedup anomaly often observed when parallelizing problems by playing multiple reformulations of the problem or portions of the problem against each other. Na