11481204
Scheduling of MPI-2 one sided operations over InfiniBand
MPI-2 provides interfaces for one sided communication, which is becoming increasingly important in scientific applications. MPI-2 semantics provide the flexibility to reorder the one sided operations within an access epoch. Based on this flexibility, in this paper we try to improve the performance of one sided communication by scheduling one sided operations. We have come up with several re-ordering and aggregating schemes to achieve better network utilization. We have evaluated these schemes on both PCI-X and PCI-Express platforms. With re-ordering scheme, we see an improvement in the throughput up to 76%, latency up to 40%. With aggregation scheme, we observe an improvement of 44% and 42% for MPI/spl I.bar/Put and MPI/spl I.bar/Get latency respectively on PCI-Express platform.
2763282
Can memory-less network adapters benefit next-generation infiniband systems?
InfiniBand is emerging as a high-performance interconnect. It is gaining popularity because of its high performance and open standard. Recently, PCI-Express, which is the third generation high-performance I/O bus used to interconnect peripheral devices, has been released. The third generation of InfiniBand adapters allow applications to take advantage of PCI-Express. PCI-Express offers very low latency access of the host memory by network interface cards (NICs). Earlier generation InfiniBand adapters used to have an external DIMM attached as local NIC memory. This memory was used to store internal information. This memory increases the overall cost of the NIC. In this paper we design experiments, analyze the performance of various communication patterns and end applications on PCI-Express based systems, whose adapters can be chosen to run with or without local NIC memory. Our investigations reveal that on these systems, the memory fetch latency is the same for both local NIC memory and host memory. Under heavy I/O bus usage, the latency of a scatter operation increased only by 10% and only for message sizes IB -4 KB. These memory-less adapters allow more efficient use of overall system memory and show practically no performance impact (less than 0.1%) for the NAS parallel benchmarks on 8 processes. These results indicate that memory-less network adapters can benefit next generation InfiniBand systems.
29243423
Design Alternatives and Performance Trade-Offs for Implementing MPI-2 over InfiniBand
MPICH2 provides a layered architecture to achieve both portability and performance. For implementations of MPI-2 over InfiniBand, it provides the flexibility for researchers at the RDMA channel, CH3 or ADI3 layer. In this paper we analyze the performance and complexity trade-offs associated with implementations at these layers. We describe our designs and implementations, as well as optimizations at each layer. To show the performance impacts of these design schemes and optimizations, we evaluate our implementations with different micro-benchmarks, HPCC and NAS test suite. Our experiments show that although the ADI3 layers adds complexity in implementation, the benefits achieved through optimizations justify moving to the ADI layer to extract the best performance.
2376785
Designing Efficient Asynchronous Memory Operations Using Hardware Copy Engine: A Case Study with I/OAT
Memory copies for bulk data transport incur large overheads due to CPU stalling, small register-size data movement, etc. Intel's I/O Acceleration Technology offers an asynchronous memory copy engine in kernel space which alleviates such overheads. In this paper, we propose a set of designs for asynchronous memory operations in user space for both single process (as an offloaded memcpy()) and lPC using the copy engine. We analyze our design based on overlap efficiency, performance and cache utilization. Our microbenchmark results show that using the copy engine for performing memory copies can achieve close to 87% overlap with computation. Further, the copy engine improves the copy latency of bulk memory data transfers by 50% and avoids cache pollution effects. With the emergence of multi-core architectures, the support for asynchronous memory operations holds a lot of promise in reducing the gap between the memory and processor performance.
1603873
Application-Transparent Checkpoint/Restart for MPI Programs over InfiniBand
Ultra-scale computer clusters with high speed interconnects, such as InfiniBand, are being widely deployed for their excellent performance and cost effectiveness. However, the failure rate on these clusters also increases along with their augmented number of components. Thus, it becomes critical for such systems to be equipped with fault tolerance support. In this paper, we present our design and implementation of checkpoint/restart framework for MPI programs running over InfiniBand clusters. Our design enables low-overhead, application-transparent checkpointing. It uses coordinated protocol to save the current state of the whole MPI job to reliable storage, which allows users to perform rollback recovery if the system runs into faulty states later. Our solution has been incorporated into MVAPICH2, an open-source high performance MPI-2 implementation over InfiniBand. Performance evaluation of this implementation has been carried out using NAS benchmarks, HPL benchmark, and a real-world application called GROMACS. Experimental results indicate that in our design, the overhead to take checkpoints is low, and the performance impact for checkpointing applications periodically is insignificant. For example, time for checkpointing GROMACS is less than 0.3% of the execution time, and its performance only decreases by 4% with checkpoints taken every minute. To the best of our knowledge, this work is the first report of checkpoint/restart support for MPI over InfiniBand clusters in the literature
2799741
Towards integrating semantics of multi-media resources and processes in e-Learning
Internet-based e-Learning has experienced a boom and bust situation in the past 10 years [32]. To bring in new forces to knowledge-oriented e-Learning, this paper addresses the semantic integration issue of multi-media resources and learning processes with theoretical learning supports in an integrated framework. This paper proposes a context-mediated approach that aims to enable semantic-based inter-operations across knowledge domains, even across the WWW and the Semantic Web [8]. The proposed semantic e-Learning framework enables intelligent operations of heterogeneous multi-media contents based on a generic semantic context intermediation model. This framework supports intelligent e-Learning with a knowledge network for knowledge object visualization, an enhanced Kolb's learning cycle [31] to guide learning practices, and a learning health care framework for personalized learning.
40011370
Contextual Knowledge Representation, Retrieval and Interpretation in Multimedia e-Learning
In highly interactive modern multimedia e-learning environments, current e-learning support products based on basic information management technologies are not able to support semantic-based knowledge management and communication beyond heterogeneous multimedia learning resources. Much of desired intelligent e-learning functionality needs further research and technical developments with semantic context-awareness. Proposed framework in this paper is expected to improve the current isolated learning management status, by making the most use of related learning information, and enabling flexible knowledge retrieval, communication and transfer between instructors and learners. To work with related existing e-learning content description standards and enable a semantic-based interactive learning environment, this paper explores a set of novel contextual knowledge discovery and reuse techniques. Based on knowledge communication model analysis in university e-learning, a contextual knowledge representation model is presented. Corresponding knowledge retrieval and semantic knowledge interpretation techniques are presented afterwards towards supporting pedagogical learning approaches such as scenario-based learning.
18017218
Optimal line-sweep-based decompositions for coverage algorithms
Robotic coverage is the problem of moving a sensor or actuator over all points in given region. Ultimately, we want a coverage path that minimizes some cost such as time. We take the approach of decomposing the coverage region into subregions, selecting a sequence of those subregions, and then generating a path that covers each subregion in turn. We focus on generating decompositions based upon the planar line sweep. After a general overview of the coverage problem, we describe how our assumptions lead to the optimality criterion of minimizing the sum of subregion altitudes (which are measured relative to the sweep direction assigned to that subregion). For a line-sweep decomposition, the sweep direction is the same for all subregions. We describe how to find the optimal sweep direction for convex polygonal worlds. We then introduce the minimal sum of altitudes (MSA) decomposition in which we may assign a different sweep direction to each subregion. This decomposition is better for generating an optimal coverage path. We describe a method based on multiple line sweeps and dynamic programming to generate the MSA decomposition.
10270257
Layout Effects on Sociogram Perception
This paper describes a within-subjects experiment in which we compare the relative effectiveness of five sociogram drawing conventions in communicating underlying network substance, based on user task performance and usability preference, in order to examine effects of different spatial layout formats on human sociogram perception. We also explore the impact of edge crossings, a widely accepted readability aesthetic. Subjective data were gathered based on the methodology of Purchase et al.[14] Objective data were collected through an online system. 
 
We found that both edge crossings and conventions pose significant affects on user preference and task performance of finding groups, but either has little impact on the perception of actor status. On the other hand, the node positioning and angular resolution might be more important in perceiving actor status. In visualizing social networks, it is important to note that the techniques that are highly preferred by users do not necessarily lead to best task performance.
17487285
A tapping micropositioning cell
Describes the use of tapping actuators in a "micropositioning cell." Tapping actuators are fixed (both in position and orientation) about the perimeter of the cell. A part in the cell can be precisely positioned by firing a sequence of tapping actuators (sensing the position of the object after each tap for feedback control). Such a system could be used for micropositioning tasks or in parts feeding applications. We show the controllability of this system for circular parts, describe an algorithm to position these objects, and present the results of simulated experiments. We conclude with some future directions and address the issues in extending this work to more efficient algorithms that work on a broader class of parts.