Pitch Patarasuk
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pitch Patarasuk has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Xin Yuan
Department of Computer Science, Florida State University, Tallahassee, USA
4 shared publications - Ahmad Faraj
IBM Corporation
2 shared publications - Ahmad Faraj
Department of Computer Science, Florida State University, Tallahassee, FL 32306
1 shared publication
Latest Publications
- 1 February 2008
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 36 (6) , 543-570
A Study of Process Arrival Patterns for MPI Collective Operations
- 1 February 2008
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 36 (6) , 543-570
A Study of Process Arrival Patterns for MPI Collective Operations
- 7 August 2007
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 36 (4) , 426-453
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
- 7 August 2007
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 36 (4) , 426-453
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-8
Bandwidth Efficient All-reduce Operation on Tree Topologies
We consider efficient implementations of the all-reduce operation with large data sizes on tree topologies. We prove a tight lower bound of the amount of data that must be transmitted to carry out the all-reduce operation and use it to derive the lower bound for the communication time of this operation. We develop a topology specific algorithm that is bandwidth efficient in that (1) the amount of data sent/received by each process is minimum for this operation; and (2) the communications do not incur network contention on the tree topology. With the proposed algorithm, the all-reduce operation can be realized on the tree topology as efficiently as on any other topology when the data size is sufficiently large. The proposed algorithm can be applied to several contemporary cluster environments, including high-end clusters of workstations with SMP and/or multi-core nodes and low-end Ethernet switched clusters. We evaluate the algorithm on various clusters of workstations, including a Myrinet cluster with dual-processor SMP nodes, an InfiniBand cluster with two dual-core processors SMP nodes, and an Ethernet switched cluster with single processor nodes. The results show that the routines implemented based on the proposed algorithm significantly outperform the native MPI_Allreduce and other recently developed algorithms for high-end SMP clusters when the data size is sufficiently large.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1-8
Bandwidth Efficient All-reduce Operation on Tree Topologies
We consider efficient implementations of the all-reduce operation with large data sizes on tree topologies. We prove a tight lower bound of the amount of data that must be transmitted to carry out the all-reduce operation and use it to derive the lower bound for the communication time of this operation. We develop a topology specific algorithm that is bandwidth efficient in that (1) the amount of data sent/received by each process is minimum for this operation; and (2) the communications do not incur network contention on the tree topology. With the proposed algorithm, the all-reduce operation can be realized on the tree topology as efficiently as on any other topology when the data size is sufficiently large. The proposed algorithm can be applied to several contemporary cluster environments, including high-end clusters of workstations with SMP and/or multi-core nodes and low-end Ethernet switched clusters. We evaluate the algorithm on various clusters of workstations, including a Myrinet cluster with dual-processor SMP nodes, an InfiniBand cluster with two dual-core processors SMP nodes, and an Ethernet switched cluster with single processor nodes. The results show that the routines implemented based on the proposed algorithm significantly outperform the native MPI_Allreduce and other recently developed algorithms for high-end SMP clusters when the data size is sufficiently large.
- 1 September 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15525244,p. 1-10
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, any tree topology can support all-to-all broadcast as efficiently as a single switch connecting all machines when the message size is sufficiently large. Since a tree topology can be embedded in almost any connected network, it follows that efficient all-to-all broadcast can be achieved in almost all topologies, regular or irregular. To perform all-to-all broadcast efficiently on clusters with store-and-forward switches, the algorithm must minimize the communication path lengths in addition to maximizing bandwidth efficiency. This turns out to be a harder algorithmic problem. We develop schemes that give solutions to common cases for such systems. The performance of our algorithms is evaluated on Ethernet switched clusters with different topologies. The results confirm our theoretical finding. Furthermore, depending on the topology, our algorithms sometimes out-perform the topology-unaware algorithms used in MPI libraries, including MPICH and LAM/MPI, to a very large degree
- 1 September 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15525244,p. 1-10
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, any tree topology can support all-to-all broadcast as efficiently as a single switch connecting all machines when the message size is sufficiently large. Since a tree topology can be embedded in almost any connected network, it follows that efficient all-to-all broadcast can be achieved in almost all topologies, regular or irregular. To perform all-to-all broadcast efficiently on clusters with store-and-forward switches, the algorithm must minimize the communication path lengths in addition to maximizing bandwidth efficiency. This turns out to be a harder algorithmic problem. We develop schemes that give solutions to common cases for such systems. The performance of our algorithms is evaluated on Ethernet switched clusters with different topologies. The results confirm our theoretical finding. Furthermore, depending on the topology, our algorithms sometimes out-perform the topology-unaware algorithms used in MPI libraries, including MPICH and LAM/MPI, to a very large degree