Results 1  10
of
46
Low Complexity Multiple Access Protocols for Wavelength Division Multiplexed Photonic Networks
 IEEE Journal on Selected Areas in Communications
, 1993
"... Media access control protocols for an optically interconnected starcoupled system with preallocated Wavelength Division Multiple Access channels are introduced and compared. The photonic network is based on a passive starcoupled configuration where high topological connectivity is achieved with ..."
Abstract

Cited by 62 (22 self)
 Add to MetaCart
Media access control protocols for an optically interconnected starcoupled system with preallocated Wavelength Division Multiple Access channels are introduced and compared. The photonic network is based on a passive starcoupled configuration where high topological connectivity is achieved with low complexity and excellent faulttolerance. The channels are preallocated to the nodes with the proposed approach, where each node has a home channel it uses either for data packet transmission or data packet reception. This approach reduces the resulting system complexity since both tunable transmitters and tunable receivers are not required, and also has the advantage of being applicable to systems where there are many more nodes than wavelength channels. The performance of a generalized random access protocol is compared to an approach based on interleaved time multiplexing. Semimarkov analytic models are developed to investigate the performance of the two protocols. The analytic mode...
High Performance Interprocessor Communication Through Optical Wavelength Division Multiple Access Channels
 in Proc. 18 th International Symposium on Computer Architecture
, 1991
"... A multiprocessor system with a large number of nodes can be built at low cost by combining the recent advances in high capacity channels available through optical fiber communication. A highly fault tolerant system is created with good performance characteristics at a reduction in system complexity. ..."
Abstract

Cited by 38 (17 self)
 Add to MetaCart
(Show Context)
A multiprocessor system with a large number of nodes can be built at low cost by combining the recent advances in high capacity channels available through optical fiber communication. A highly fault tolerant system is created with good performance characteristics at a reduction in system complexity. The system capitalizes on the optical selfrouting characteristic of wavelength division multiple access to improve performance and reduce complexity. This paper examines typical optical multiple access channel implementations and shows that the starcoupled approach is superior due to optical power budget considerations. Starcoupled configurations which exhibit the optical selfrouting characteristic are then studied. A hypercube based structure is introduced where optical multiple access channels span the dimensional axes. This severely reduces the required degree since only one I/O port is required per dimension, and performance is maintained through the high capacity characteristics of...
Hierarchical Scalable Photonic Architecture For HighPerformance Processor Interconnection
 IEEE Trans. on Computers
, 1993
"... ..."
(Show Context)
Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system
 Proceedings of IPPS/SPDP ’99 (2nd Merged Symp. of 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
, 1999
"... The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N,multiplying two N N matrices can be performed on a pprocessor linear array with a ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
(Show Context)
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N,multiplying two N N matrices can be performed on a pprocessor linear array with a recon gurable pipelined bus system (LARPBS) in O N
Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
 IEEE Trans. on Parallel and Distributed Systems
, 1998
"... Abstract—We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). Such systems are able to support a large volume of parallel communication of various patterns in constant time. An LARPBS can also be reconfigured into many i ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
(Show Context)
Abstract—We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). Such systems are able to support a large volume of parallel communication of various patterns in constant time. An LARPBS can also be reconfigured into many independent subsystems and, thus, is able to support parallel implementations of divideandconquer computations like Strassen’s algorithm. The main contributions of the paper are as follows: We develop five matrix multiplication algorithms with varying degrees of parallelism on the LARPBS computing model, namely, MM1, MM2, MM3, and compound algorithms &1 (�) and &2 (δ). Algorithm &1 (�) has adjustable time complexity in sublinear level. Algorithm &2 (δ) implies that it is feasible to achieve sublogarithmic time using o(N 3) processors for matrix multiplication on a realistic system. Algorithms MM3, &1 (�), and &2 (δ) all have o(N 3) cost and, hence, are very processor efficient. Algorithms MM1, MM3, and &1 (�) are generalpurpose matrix multiplication algorithms, where the array elements are in any ring. Algorithms MM2 and &2 (δ) are applicable to array elements that are integers of bounded magnitude, or floatingpoint values of bounded precision and magnitude, or Boolean values. Extension of algorithms MM2 and &2 (δ) to unbounded integers and reals are also discussed.
PreAllocation Media Access Control Protocols for Multiple Access WDM Photonic Networks
, 1992
"... Media access control protocols for an optically interconnected starcoupled system with preallocated WDMA channels are introduced and compared. The photonic network is based on a passive starcoupled WDM based configuration with high topological connectivity and low complexity. The channels are ..."
Abstract

Cited by 19 (12 self)
 Add to MetaCart
Media access control protocols for an optically interconnected starcoupled system with preallocated WDMA channels are introduced and compared. The photonic network is based on a passive starcoupled WDM based configuration with high topological connectivity and low complexity. The channels are preallocated to the nodes with this approach, where each node has a home channel that it uses either for all data packet transmissions or all data packet receptions. A home channel may be shared if the number of nodes exceeds the number of channels in the system. This approach does not require both tunable transmitters and tunable receivers. The performance of a generalized random access protocol is compared to a protocol based on interleaved time multiplexing. Both protocols are designed to operate in a multiplechannel multipleaccess environment and require each node to possess a tunable transmitter and a fixed (or slow tunable) receiver. Semimarkov analytic models are developed to inve...
Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems
 Journal of Supercomputing
, 2000
"... . In this paper, we present deterministic and probabilistic methods for simulating PRAM computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The following results are established in this paper. (1) Each step of a pprocessor PRAM with m = O#p# shared memory cells can b ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
(Show Context)
. In this paper, we present deterministic and probabilistic methods for simulating PRAM computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The following results are established in this paper. (1) Each step of a pprocessor PRAM with m = O#p# shared memory cells can be simulated by a pprocessors LARPBS in O#log p# time, where the constant in the bigO notation is small. (2) Each step of a pprocessor PRAM with m = ##p# shared memory cells can be simulated by a pprocessors LARPBS in O#log m# time. (3) Each step of a pprocessor PRAM can be simulated by a pprocessor LARPBS in O#log p# time with probability larger than 1  1/p c for all c>0. (4) As an interesting byproduct, we show that a pprocessor LARPBS can sort p items in O#log p# time, with a small constant hidden in the bigO notation. Our results indicate that an LARPBS can simulate a PRAM very efficiently. Keywords: Concurrent read, concurrent write, deterministic simulation, linear array...
A Spanning Multichannel Linked Hypercube: A Gradually Scalable Optical Interconnection Network for Massively Parallel Computing
 IEEE Trans. Parallel and Distributed Systems
, 1998
"... A new, scalable interconnection topology called the Spanning Multichannel Linked Hypercube (SMLH) is proposed. This proposed network is very suitable to massively parallel systems and is highly amenable to optical implementation. The SMLH uses the hypercube topology as a basic building block and c ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
A new, scalable interconnection topology called the Spanning Multichannel Linked Hypercube (SMLH) is proposed. This proposed network is very suitable to massively parallel systems and is highly amenable to optical implementation. The SMLH uses the hypercube topology as a basic building block and connects such building blocks using twodimensional multichannel links (similar to spanning buses). In doing so, the SMLH combines positive features of both the hypercube (small diameter, high connectivity, symmetry, simple routing, and fault tolerance) and the spanning bus hypercube (SBH) (constant node degree, scalability, and ease of physical implementation), while at the same time circumventing their disadvantages. The SMLH topology supports many communication patterns found in different classes of computation, such as busbased, meshbased, and treebased problems, as well as hypercubebased problems. A very attractive feature of the SMLH network is its ability to support a large n...
Channel Sharing in MultiHop WDM Lightwave Networks: Realization, and Performance of Multicast Traffic
 IEEE/ACM Transactions on Networking
, 1996
"... A local lightwave network can be constructed by employing twoway fibers to connect nodes in a passivestar physical topology, and the available optical bandwidth may be effectively accessed by the nodal transmitters and receivers at electronic rates using wavelength division multiplexing (WDM). The ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
A local lightwave network can be constructed by employing twoway fibers to connect nodes in a passivestar physical topology, and the available optical bandwidth may be effectively accessed by the nodal transmitters and receivers at electronic rates using wavelength division multiplexing (WDM). The number of channels, , in a WDM network is limited by technology and is usually less than the number of nodes, , in the network. We provide a general method using channel sharing to construct practical multihop networks under this limitation. Channel sharing may be achieved through timedivisionmultiplexing. The method is applied to a generalized shuffleexchange based multihop architecture, called GEMNET. Multicastingthe ability to transmit information from a single source node to multiple destination nodesis becoming an important requirement in highperformance networks. Multicasting, if improperly implemented, can be bandwidthabusive. Channel sharing is one approach towards effici...
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
 Journal of Parallel and Distributed Computing
"... Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N), where 2 < 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N = log N processors. Such a parallel comp ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N), where 2 < 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N = log N processors. Such a parallel computation is cost optimal and matches the performance of PRAM. Furthermore, our parallelization on a DMPC can be made fully scalable, that is, for all 1 p N = log N, multiplying two N N matrices can be performed by a DMPC with p processors in O(N =p) time, i.e., linear speedup and cost optimality can be achieved in the range [1::N = log N]. This unifies all known algorithms for matrix multiplication on DMPC, standard or nonstandard, sequential or parallel. Extensions of our methods and results to other parallel systems are also presented. The above claims result in significant progress in scalable parallel matrix multiplication (as well as solving many other important problems) on distributed memory systems, both theoretically and practically. 1