Yuan, Xin - Department of Computer Science, Florida State University

• A Study of Process Arrival Patterns for MPI Collective Operations
• Bandwidth Efficient All-to-All Broadcast on Switched Clusters
• Controlling IP Spoofing Through Inter-Domain Packet Filters
• CEN5515 Project No. 1: A Mail Reader Exercising the design and implementation of a network application.
• Fair Round Robin: A Low Complexity Packet Scheduler with Proportional and Worst-Case
• Fair Round Robin: A Low Complexity Packet Scheduler with Proportional and Worst-Case Fairness
• An Empirical Study of Reliable Multicast Protocols over EthernetConnected Networks
• Wavelength Assignment to Minimize the Number of SONET ADMs in WDM Rings
• Heuristic Algorithms for MultiConstrained Quality of Service Routing
• Load Balancing Mechanisms in Data Center Santosh Mahapatra Xin Yuan
• Near-optimal Rendezvous Protocols for RDMA-enabled Clusters
• Traffic-aware Inter-Domain Routing for Improved Internet Routing Stability
• Efficient MPI Bcast across Different Process Arrival Patterns Pitch Patarasuk Xin Yuan
• Award Number: CNS-551555 Title: CRI: Acquisition of an InfiniBand Cluster with SMP Nodes
• Bandwidth Efficient All-reduce Operation on Tree Topologies1 Pitch Patarasuk and Xin Yuan
• Pipelined Broadcast on Ethernet Switched Clusters Pitch Patarasuk Ahmad Faraj Xin Yuan
• Message Scheduling for All-to-All Personalized Communication on Ethernet Switched Clusters
• CCMPI: A Compiled Communication Capable MPI Prototype for Ethernet Switched Clusters
• Validation of Code-Improving Transformations for Embedded Systems Robert van Engelen, David Whalley, and Xin Yuan
• Wavelength Assignment to Minimize the Number of SONET ADMs in WDM Rings
• Path Selection Methods for Localized Quality of Service Routing
• An Empirical Study of Reliable Multicast Protocols over EthernetConnected Networks
• Using a Swap Instruction to Coalesce Loads and Stores
• IEEE INFOCOM 2001 1 Heuristic Algorithms for MultiConstrained Quality
• Compiler Analysis to Support Compiled Communication for HPFlike programs Dept. Of Computer Science
• Performance of Multihop Communications Using Logical Topologies on Optical Torus Networks
• COMMUNICATION CHARACTERISTICS IN THE NAS PARALLEL Name: Ahmad A. Faraj
• Project No. 1: A Simplified Parallel (multi-process) Make Program Practicing UNIX system calls.
• COP5570 Project No. 2: Internet Connect-five (Gomoku) Server Experience with socket programming, experience with implementing network applications.
• CDA5125 Programming Assignment 1: Threaded Sparse Matrix Multiplication Practice programming with threads.
• CDA5125 Programming Assignment 2: OpenMP and MPI Sparse Matrix Multiplication Practice programming with OpenMP and MPI.
• Project No. 2: Data Link Layer Protocols Exercising the flow control and error control techniques in the data link layer protocols.
• COP5611 Programming Assignment NO. 1 Orientation to Programming Requirements
• On LID Assignment In InfiniBand Networks Wickus Nienaber
• CDA5125 Programming Assignment 3: Loop optimizations Apply loop optimization techniques.
• Improving Routing Performance in InfiniBand Networks with 2-Level Generalized Fat-tree Topologies
• Resource Reservation Mechanisms for Distributed Multipath Quality of Service Routing
• Distributed Path Reservation Algorithms for Multiplexed All-Optical
• Techniques for Pipelined Broadcast on Ethernet Switched Clusters
• COP4610/CGS5765: Operating Systems Midterm (4 questions)
• A Study of Process Arrival Patterns for MPI Collective Operations
• Impact of Resource Reservation on the Distributed Multi--path Quality of Service Routing Scheme
• Automatic Generation and Tuning of MPI Collective Communication Routines
• An Empirical Approach for Efficient All-to-All Personalized Communication on Ethernet Switched Clusters
• COP5621 Compiler Construction Part I: Lexical Analyzer
• Optimal Routing and Channel Assignments for Hypercube Communication on Optical Meshlike Processor Arrays.
• Maximizing MPI Point-to-Point Communication Performance on RDMA-enabled Clusters with Customized
• Parallel Processing Letters c World Scientific Publishing Company
• A Comparative Study of QoS Routing Schemes That Tolerate Imprecise State Information
• COP5570 Project No. 3 Thread, OpenMP and MPI implementations of the Jacobi method
• An MPI Tool for Automatically Discovering the Switch Level Topologies of Ethernet Clusters
• On Nonblocking Folded-Clos Networks in Computer Communication Environments
• A Wavelength Assignment Heuristic to Minimize SONET ADMs in WDM rings
• Performance of MultiHop Communications Using Logical Topologies on Optical Torus Networks
• LID Assignment In InfiniBand Networks Wickus Nienaber, Xin Yuan, Member, IEEE and Zhenhai Duan, Member, IEEE
• Bandwidth Optimal All-reduce Algorithms for Clusters of Workstations
• Empirical Probability Based QoS Routing Xin Yuan Guang Yang
• COP5621 Project Phase 3 Semantic Analyzer
• A Message Scheduling Scheme for All-to-all Personalized Communication on Ethernet Switched Clusters
• COP5621 Project Phase 4 Code Generator
• An Empirical Study of Behavioral Characteristics of Spammers: Findings and Implications
• Project No. 2: Causal Ordering of Messages DESCRIPTION
• COP5621 Programming Project Part II: Syntax analysis
• A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information
• Processor Affinity and MPI Performance on SMP-CMP Clusters
• COP5611 programming assignment NO. 3 A distributed application and a simplified application
• Oblivious Routing in Fat-Tree Based System Area Networks with Uncertain Traffic Demands
• Algorithms for Supporting Compiled Communication
• Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
• On QoS Routing and Path Establishment in the Presence of Imprecise State Information
• Impact of Resource Reservation on the Distributed Multipath Quality of Service Routing Scheme
• Bandwidth Efficient All-to-All Broadcast on Switched Clusters
• On the Extended BellmanFord Algorithm to Solve TwoConstrained Quality of Service Routing Problems
• Improving Performance of Deterministic Single-path Routing on 2-Level Generalized Fat-trees
• Intrinsics Reference Document Number: 312482-002US
• COP4020 Programming Assignment 2 A CALC interpreter
• COP4020 Programming languages Programming assignment 1: Lexical Analyzer