Xin Yuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xin Yuan has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Pitch Patarasuk
Department of Computer Science, Florida State University, Tallahassee, FL 32306
4 shared publications - Abu Naser
Department of Computer Science Florida State University 30306 Tallahassee FL
2 shared publications - Ahmad Faraj
IBM Corporation
2 shared publications - Cong Wu
Department of Computer Science Florida State University 30306 Tallahassee FL
2 shared publications - Mehran Sadeghi Lahijani
Florida State University,Department of Computer Science,Tallahassee,FL,USA
2 shared publications - Viet Tung Hoang
Florida State University
2 shared publications
Latest Publications
- 22 August 2021
- Published by Springer Nature in Instructional Science
- Vol. 49 (6) , 831-854
Exploring multiuser virtual teaching simulation as an alternative learning environment for student instructors
In this mixed-method study, we investigated the impact and design of a multiuser, virtual reality (VR) supported teaching simulation, in comparison with live classroom teaching simulation, on the participatory training of teaching and the teaching knowledge development of student instructors. A total of 40 university teaching assistants participated in a 4-h training session in which they were randomly assigned to a VR simulation or a live classroom simulation condition. The study indicated that the VR simulation better promoted the lab-teaching knowledge development than the live simulation, whereas the latter better fostered class-teaching knowledge development. All participants reported higher teaching self-efficacy after the training. The qualitative data indicated that domain-specific challenges and authentic environmental prompting in the VR simulation fostered both experiential and vicarious learning of teaching. However, VR participants lacked mutual engagement in collaborative role-playing. The study findings suggest that VR-based simulation can supplement and work as an alternative to the live classroom simulation to host participatory teaching development.
- 22 August 2021
- Published by Springer Nature in Instructional Science
- Vol. 49 (6) , 831-854
Exploring multiuser virtual teaching simulation as an alternative learning environment for student instructors
In this mixed-method study, we investigated the impact and design of a multiuser, virtual reality (VR) supported teaching simulation, in comparison with live classroom teaching simulation, on the participatory training of teaching and the teaching knowledge development of student instructors. A total of 40 university teaching assistants participated in a 4-h training session in which they were randomly assigned to a VR simulation or a live classroom simulation condition. The study indicated that the VR simulation better promoted the lab-teaching knowledge development than the live simulation, whereas the latter better fostered class-teaching knowledge development. All participants reported higher teaching self-efficacy after the training. The qualitative data indicated that domain-specific challenges and authentic environmental prompting in the VR simulation fostered both experiential and vicarious learning of teaching. However, VR participants lacked mutual engagement in collaborative role-playing. The study findings suggest that VR-based simulation can supplement and work as an alternative to the live classroom simulation to host participatory teaching development.
- Open Access
CryptMPI: A Fast Encrypted MPI Library
The cloud infrastructure must provide security for High-Performance Computing (HPC) applications of sensitive data to execute in such an environment. However, supporting security in the communication infrastructure of today's public cloud is challenging, because current networks for data centers are so fast that adding encryption can incur very significant overheads. In this work, we introduce CryptMPI, a high performance encrypted MPI library that supports communication with both integrity and privacy. We present the techniques in CryptMPI and report our benchmarking results using micro-benchmarks and NAS parallel benchmarks. The evaluation results indicate that the aforementioned techniques are effective in improving the performance of encrypted communication.
Open AccessCryptMPI: A Fast Encrypted MPI Library
The cloud infrastructure must provide security for High-Performance Computing (HPC) applications of sensitive data to execute in such an environment. However, supporting security in the communication infrastructure of today's public cloud is challenging, because current networks for data centers are so fast that adding encryption can incur very significant overheads. In this work, we introduce CryptMPI, a high performance encrypted MPI library that supports communication with both integrity and privacy. We present the techniques in CryptMPI and report our benchmarking results using micro-benchmarks and NAS parallel benchmarks. The evaluation results indicate that the aforementioned techniques are effective in improving the performance of encrypted communication.
- Open Access
Performance Evaluation and Modeling of Cryptographic Libraries for MPI Communications
In order for High-Performance Computing (HPC) applications with data security requirements to execute in the public cloud, the cloud infrastructure must ensure the privacy and integrity of data. To meet this goal, we consider incorporating encryption in the Message Passing Interface (MPI) library. We empirically evaluate four contemporary cryptographic libraries, OpenSSL, BoringSSL, Libsodium, and CryptoPP using micro-benchmarks and NAS parallel benchmarks on two different networking technologies, 10Gbps Ethernet and 40Gbps InfiniBand. We also develop accurate models that allow us to reason about the performance of encrypted MPI communication in different situations and give guidance on how to improve encrypted MPI performance.
Open AccessPerformance Evaluation and Modeling of Cryptographic Libraries for MPI Communications
In order for High-Performance Computing (HPC) applications with data security requirements to execute in the public cloud, the cloud infrastructure must ensure the privacy and integrity of data. To meet this goal, we consider incorporating encryption in the Message Passing Interface (MPI) library. We empirically evaluate four contemporary cryptographic libraries, OpenSSL, BoringSSL, Libsodium, and CryptoPP using micro-benchmarks and NAS parallel benchmarks on two different networking technologies, 10Gbps Ethernet and 40Gbps InfiniBand. We also develop accurate models that allow us to reason about the performance of encrypted MPI communication in different situations and give guidance on how to improve encrypted MPI performance.
- 29 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (1) , 156-168
Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks
Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this work, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that it is possible to find the max-min fair rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and show improvement in orders of magnitude over the previously best known method. We further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.
- 29 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (1) , 156-168
Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks
Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this work, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that it is possible to find the max-min fair rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and show improvement in orders of magnitude over the previously best known method. We further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.
- 28 February 2013
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 41 (5) , 682-703
Protocol Customization for Improving MPI Performance on RDMA-Enabled Clusters
- 28 February 2013
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 41 (5) , 682-703
Protocol Customization for Improving MPI Performance on RDMA-Enabled Clusters
- 1 September 2011
- Published by Elsevier in Computer Communications
- Vol. 34 (14) , 1764-1776
An empirical study of behavioral characteristics of spammers: Findings and implications
- 1 September 2011
- Published by Elsevier in Computer Communications
- Vol. 34 (14) , 1764-1776
An empirical study of behavioral characteristics of spammers: Findings and implications
- 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.
- 9 August 2006
- Published by Elsevier in Performance Evaluation
- Vol. 64 (3) , 210-228
An empirical study of reliable multicast protocols over Ethernet-connected networks
- 9 August 2006
- Published by Elsevier in Performance Evaluation
- Vol. 64 (3) , 210-228
An empirical study of reliable multicast protocols over Ethernet-connected networks