Analytical modeling of communication latency in multi-cluster systems

This paper addresses the problem of performance modeling of large-scale distributed systems with emphasis on communication networks in heterogeneous multi-cluster systems. The study of interconnection networks is important because the overall performance of a distributed system is often critically hinged on the effectiveness of this part. We present an analytical model to predict message latency in multi-cluster systems in the presence of processor heterogeneity. The model is validated through comprehensive simulation, which demonstrates that the proposed model exhibits a good degree of accuracy for various system sizes and under different operating conditions.

Establishment of HIV-1 latency in resting CD4+ T cells depends on chemokine-induced changes in the actin cytoskeleton

Eradication of HIV-1 with highly active antiretroviral therapy (HAART) is not possible due to the persistence of long-lived, latently infected resting memory CD4+ T cells. We now show that HIV-1 latency can be established in resting CD4+ T cells infected with HIV-1 after exposure to ligands for CCR7 (CCL19), CXCR3 (CXCL9 and CXCL10), and CCR6 (CCL20) but not in unactivated CD4+ T cells. The mechanism did not involve cell activation or significant changes in gene expression, but was associated with rapid dephosphorylation of cofilin and changes in filamentous actin. Incubation with chemokine before infection led to efficient HIV-1 nuclear localization and integration and this was inhibited by the actin stabilizer jasplakinolide. We propose a unique pathway for establishment of latency by direct HIV-1 infection of resting CD4+ T cells during normal chemokine-directed recirculation of CD4+ T cells between blood and tissue.

Triceps surae fascicle stretch is poorly correlated with short latency stretch reflex size

INTRODUCTION: The short latency stretch reflex (SLR) is well described, but the stimulus that evokes the SLR remains elusive. One hypothesis states that reflex size is proportional to muscle fiber stretch, so in this study we examined the relationship between these 2 parameters in human triceps surae muscles. METHODS: Achilles tendon taps and dorsiflexion stretches with different amplitudes and preactivation torques were applied to 6 participants while electromyography and muscle fascicle length changes were recorded in soleus and medial gastrocnemius (MG). RESULTS: In response to tendon taps, neither fascicle length nor velocity changes were correlated with SLR size in either muscle, but accelerometer peaks were observed immediately after hammer-tendon contact. Similar results were obtained after dorsiflexion stretches. CONCLUSION: Muscle fascicle stretch is poorly correlated with SLR size, regardless of perturbation parameters. We attribute the SLR trigger to the transmission of vibration through the lower limb, rather than muscle fiber stretch. Muscle Nerve, 2015.

A phenomenological analysis of the experience of security and contentment for latency aged children in shared-time parenting arrangements

This study explored the lived experience of security and contentment, and their absence, for latency-aged children (aged 8-12) living in shared-time parenting arrangements following their parents' separation. A descriptive phenomenological methodology was utilized (Giorgi, 1985, 2009; Giorgi & Giorgi, 2003, 2008). Sixteen children living in shared-time were interviewed about their experiences of two phenomena: "feeling secure and content living in shared-time" and "not feeling secure and content living in shared-time." The eight richest protocols were selected for analysis. The two resultant general structures and their core constituents are presented, and individual variations discussed. Central to each phenomenon is the parent/s' capacity, or incapacity, to create and sustain a physical and emotional space in which the child feels secure and held in the mind, feels the arrangements are responsive to their needs, feels free to access the "absent" parent, and experiences integration between the two parental homes. Implications for phenomenological human science research are considered, including the use of descriptive phenomenology with children.

Latency reduction and market quality: the case of the Australian Stock Exchange

This study investigates the role of latency in market quality in the Australia Securities Exchange following the introduction of the Integrated Trading Platform (ITS) and ASXTrade. We find that the reduction in system latency from 70. ms to 30. ms (ITS) improved liquidity. However, the lower latency has not had a long-lasting downward effect on spreads, as there was no discernible reduction in trading costs when institutional traders already had access to lower-latency co-locations. We contribute to the literature by reporting that low latency improves market liquidity, but privileged participants that have access to trading information prior to others may induce greater information asymmetry and adverse selection.

On the perceived location of global motion

We measured the effects of coherent motion of one set of dots on the perceived location of Gaussian envelopes formed by luminance modulation of a second set of dots. Perceived shifts in envelope location in the direction of coherent motion were obtained even when the dots forming the envelopes did not physically move in the direction of coherent motion. In such cases, perceived shifts coincided with stimulus configurations that permitted motion integration of the envelope dots with the coherently moving dots, for example, when envelope dots moved in random directions as opposed to being static. In subsequent experiments we explored the type of motion integration underlying the positional shifts obtained. We discounted the possibility that the visual system incorrectly attributes motion signals associated with coherently moving dots to envelope dots by demonstrating that positional shifts could be obtained even when the coherent dots were laterally displaced to either side of the envelope dots such that the regions occupied by the dots did not overlap. We also discounted spatio-temporal summation within the receptive fields of low-spatial-frequency motion-sensitive mechanisms by demonstrating that positional shifts persisted even when the dot displays were high-pass filtered. These results, coupled with the observation that the proportion of coherently moving dots required to produce positional shifts correlated well with global motion thresholds measured for the same dot configurations, suggests that visual processes which underlie motion-dependent positional shifts are based at least in part on cooperative interactions of the type implicated in global motion.

Accessing database information using mobile agents

Many real-world applications on the Internet require accessing database information and typical technology employed is client/server plus Web (C/S + Web). Although past few years saw many success applications by using this technique, there are still some drawbacks that need to be overcome. One of the drawbacks is that the transaction often fails if the network connection is unstable. Another disadvantage is high bandwidth requirement and latency. This paper argues that mobile agent technology provide an easy way to overcome the shortcomings in CIS + Web in database access on the Internet. A success case study using mobile agents to admit new students to China's institutions is then presented. The mobile agent was created by using IBM's Aglets Software Development Kit (SDK). Based on the experimental results, it is evident that mobile agent technology is well suited for such applications.

File replacement algorithm for storage resource managers in data grids

The main problem in data grids is how to provide good and timely access to huge data given the limited number and size of storage devices and high latency of the interconnection network. One approach to address this problem is to cache the files locally such that remote access overheads are avoided. Caching requires a cache-replacement algorithm, which is the focus of this paper. Specifically, we propose a new replacement policy and compare it with an existing policy using simulations. The results of the simulation show that the proposed policy performs better than the baseline policy.

Reducing the bandwidth requirements of P2P keyword indexing

This paper describes the design and evaluation of a federated, peer-to-peer indexing system, which can be used to integrate the resources of local systems into a globally addressable index using a distributed hash table. The salient feature of the indexing systems design is the efficient dissemination of term-document indices using a combination of duplicate elimination, leaf set forwarding and conventional techniques such as aggressive index pruning, index compression, and batching. Together these indexing strategies help to reduce the number of RPC operations required to locate the nodes responsible for a section of the index, as well as the bandwidth utilization and the latency of the indexing service. Using empirical observation we evaluate the performance benefits of these cumulative optimizations and show that these design trade-offs can significantly improve indexing performance when using a distributed hash table.

A review on current work in mobility prediction for wireless networks

The vision of next generation networks (4G & beyond) is to make possible seamless mobility across heterogeneous networks and to support real-time multimedia services. This would require intra/inter-domain handovers and service reconfiguration procedures to be completed with minimum latency. Mobility Prediction has been identified as a key abettor to this goal. The increasing ease of coupling between the mobile user and the network requires that a mobility prediction scheme that is to be deployed in next generation networks be capable of high levels of prediction accuracy despite randomness in user movement. In this work we have presented a survey on mobility prediction schemes that have been proposed for wireless networks. The results of our simulation study focused on the robustness of different schemes to randomness in user movement are also presented.

Load balance algorithms for anycast

Increasingly, replicated anycast servers are being used to deliver network applications and service ever increasing user requests. Therefore, the strategies used to guarantee network bandwidth prerequisites and perform load balancing across the nodes of an anycast group are critical to the performance of online applications. In this paper, we model user requests, network congestion and latency, and server load using a combination of hydro-dynamics and queuing theory to develop an efficient job distribution strategy. Current, anycast research does not explicitly consider the system load of nodes within an anycast groups when distributing requests. Therefore, the performance of a heavily loaded anycast system can quickly become congested and uneven as jobs are routed to closely linked nodes which are already saturated with requests. In comparison, the nodes of further away systems remain relatively unused because of other issues such as network bandwidth and latency during these times. Our system redirects requests from busy systems to the idle, remotely linked nodes, to process requests faster in spite of slower network access. Using an empirical study, we show this technique can improve request performance, and throughput with minimal network probing overhead.

Haptic control of multi-axis robotic systems

Control of tele-operated remote robot’s is nothing new; the public was introduced to this 'new' field in 1986 when the Chernobyl cleanup began. Pictures of weird and wonderful robotic workers pouring concrete or moving rubble flooded the world. Integration of force feedback or 'haptics' to remote robot's is a new development and one that is likely to make a big difference in man-machine interaction. Development of haptic capable tele-operation schema is a challenge. Often platform specific software is developed for one off tasks. This research focussed on the development of an open software platform for haptic control of multiple remote robotic platforms. The software utilises efficient server/client architecture for low data latency, while efficiently performing required kinematic transforms and data manipulation in real time. A description of the algorithm, software interface and hardware is presented in this paper. Preliminary results are encouraging as haptic control has been shown to greatly enhances remote positioning tasks.

Analytical modeling of interconnection networks in heterogeneous multi-cluster systems

In data-intensive distributed systems, replication is the most widely used approach to offer high data availability, low bandwidth consumption, increased fault-tolerance and improved scalability of the overall system. Replication-based systems implement replica control protocols that enforce a specified semantics of accessing the data. Also, the performance depends on a number of factors, the chief of which is the protocol used to maintain consistency among object replica. In this paper, we propose a new low-cost and high data availability protocol called the box-shaped grid structure for maintaining consistency of replicated data on networked distributed computing systems. We show that the proposed protocol provides high data availability, low communication costs, and increased fault-tolerance as compared to the baseline replica control protocols.

The cost of storing checkpoints to multiple volatile storage locations using at-least-k semantics

Using the volatile memory of other computers within a system to store checkpoints is an alternative to the traditional approach of using stable storage. The objective of this study is to develop a storage mechanism using at-least-k delivery semantics. This semantics allows data to be saved to a minimum number of computers simultaneously using group communications, without requiring that each group computer successfully acknowledge the receipt. The new storage mechanism is implemented in the GENESIS checkpointing facility v2.0. The results showed that at-least-k storage mechanisms provide low storage latency times; however, the incurred execution overheads on the applications executing within the system are higher than that when using remote stable storage to store checkpoints.

Performance analysis of interconnection networks for multi-cluster systems

With the current popularity of cluster computing systems, it is increasingly important to understand the capabilities and potential performance of various interconnection networks. In this paper, we propose an analytical model for studying the capabilities and potential performance of interconnection networks for multi-cluster systems. The model takes into account stochastic quantities as well as network heterogeneity in bandwidth and latency in each cluster. Also, blocking and non-blocking network architecture model is proposed and are used in performance analysis of the system. The model is validated by constructing a set of simulators to simulate different types of clusters, and by comparing the modeled results with the simulated ones.