The proceedings contain 193 papers. The topics discussed include: hypercubes for critical space flight command operations;a massively parallel expert system architecture for chemical structure analysis;hypercube exper...
ISBN:
(纸本)0818621133
The proceedings contain 193 papers. The topics discussed include: hypercubes for critical space flight command operations;a massively parallel expert system architecture for chemical structure analysis;hypercube expert system shell applying production parallelism;parallel distributed-memory implementation of the corrective switching problem;concurrent implementation of Munkres algorithm;efficient serial and parallel subcube recognition in hypercubes;concurrent supercomputing in Europe;evaluation of dual ported memories from the task level;hot-spot performance of single-stage and multistage interconnection networks;and parallel processor memory reference analysis and its application to interconnect architecture.
The proceedings contain 193 papers. The topics discussed include: hypercubes for critical space flight command operations;a massively parallel expert system architecture for chemical structure analysis;hypercube exper...
ISBN:
(纸本)0818621133
The proceedings contain 193 papers. The topics discussed include: hypercubes for critical space flight command operations;a massively parallel expert system architecture for chemical structure analysis;hypercube expert system shell applying production parallelism;parallel distributed-memory implementation of the corrective switching problem;concurrent implementation of Munkres algorithm;efficient serial and parallel subcube recognition in hypercubes;concurrent supercomputing in Europe;evaluation of dual ported memories from the task level;hot-spot performance of single-stage and multistage interconnection networks;and parallel processor memory reference analysis and its application to interconnect architecture.
The proceedings contain 115 papers. The topics discussed include: mapping precedence-constrained simulation tasks;a multicomputer simulation of the Galileo spacecraft command and data subsystem;resource management in ...
ISBN:
(纸本)0818622903
The proceedings contain 115 papers. The topics discussed include: mapping precedence-constrained simulation tasks;a multicomputer simulation of the Galileo spacecraft command and data subsystem;resource management in a large reconfigurable transputer-based system;fault tolerance of the cyclic buddy subcube location scheme in hypercubes;automatic data partitioning on distributedmemory multiprocessors;automatic support for data distribution;efficient algorithms for scheduling tasks on hypercubes;architectural support for dynamic data distribution and dynamic scheduling;communication abstraction and process refinement;scatter scheduling for problems with unpredictable structures;and probabilistic analysis of the optimal efficiency of the multi-level dynamic load balancing scheme.
The proceedings contain 49 papers. The special focus in this conference is on European distributedmemorycomputing. The topics include: The new age of supercomputing;the next generation transputers and beyond;a distr...
ISBN:
(纸本)9783540539513
The proceedings contain 49 papers. The special focus in this conference is on European distributedmemorycomputing. The topics include: The new age of supercomputing;the next generation transputers and beyond;a distributed implementation of shared virtual memory with strong and weak coherence;store coherency in a parallel distributed-memory machine;using a weak coherency model for a parallel lisp;flexible user-definable memory coherence scheme in distributed shared memory of GALAXY;parallelization of multigrid programs in SUPERB;mapping graphs onto a partially reconfigurable architecture;a performance evaluation tool environment for parallel and distributed systems;interleaving partitions of systolic algorithms for programming distributedmemory multiprocessors;partial ordering of synchronization events for distributed debugging in tightly-coupled multiprocessor systems;a development environment for distributed systems;monitor-supported analysis of a communication system for transputer-networks;an integrated environment for programming distributedmemory multiprocessors;optimal multinode broadcast on a mesh connected graph with reduced bufferization;adaptive irregular multiple grids on a distributedmemory multiprocessor;an object-oriented interface for parallel programming of loosely-coupled multiprocessor systems;on automatic loop data-mapping for distributed-memory a scalable communication processor design supporting systolic communication;multiprocessors;efficient and scalable logical busses for message-passing interconnection networks;performance benefits from locally adaptive interval routing in dynamically switched interconnection networks;an optimal structure that accommodates both a ring and a binary tree;on the design of deadlock-free adaptive routing algorithms for multicomputers and parallelization of lee's routing algorithm on a hypercube multicomputer.
conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover...
conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover art, table of contents, copyright statements, title-page or half title-pages, blank pages, venue maps or other general information relating to the conference that was part of the original conference proceedings.
conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover...
conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover art, table of contents, copyright statements, title-page or half title-pages, blank pages, venue maps or other general information relating to the conference that was part of the original conference proceedings.
conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover...
conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover art, table of contents, copyright statements, title-page or half title-pages, blank pages, venue maps or other general information relating to the conference that was part of the original conference proceedings.
The results of the stepwise computations are saved in memory slots, for possible reuse. The extended calculus reduces unnecessary iterations of assignments, which are chains of unnecessary assignments, by copying valu...
详细信息
ISBN:
(纸本)9783031820724;9783031820731
The results of the stepwise computations are saved in memory slots, for possible reuse. The extended calculus reduces unnecessary iterations of assignments, which are chains of unnecessary assignments, by copying values of terms from one memory slot to another, without any essential algorithmic changes. The primary applications of the chain-free type theory of recursion are for computational semantics of formal and natural languages, including programming languages and compilers.
Leader election is a critical and extensively studied problem in distributedcomputing. This paper introduces the study of leader election using mobile agents. Consider n agents initially placed arbitrarily on the nod...
详细信息
ISBN:
(纸本)9783031814037;9783031814044
Leader election is a critical and extensively studied problem in distributedcomputing. This paper introduces the study of leader election using mobile agents. Consider n agents initially placed arbitrarily on the nodes of an arbitrary, n-node, m-edge graph G. These agents move autonomously across the nodes of G and elect one agent as the leader such that the leader is aware of its status as the leader, and the other agents know they are not the leader. The goal is to minimize both time and memory usage. We study the leader election problem in a synchronous setting where each agent performs operations simultaneously with the others, allowing us to measure time complexity in terms of rounds. We assume that the agents have prior knowledge of the number of nodes n and the maximum degree of the graph Delta. We first elect a leader deterministically in O(n log(2) n + D Delta log n) rounds with each agent using O(log n) bits of memory, where D is the diameter of the graph. Leveraging this leader election result, we then present a deterministic algorithm for constructing a minimum spanning tree of G in O(m+ n log n) rounds, with each agent using O(Delta log n) bits of memory. Finally, using the same leader election result, we improve time and memory bounds for other key distributed graph problems, including gathering, maximal independent set, and minimal dominating set. For all the aforementioned problems, our algorithms remain memory-optimal.
暂无评论