6692312
Evaluation of architectural support for global address-based communication in large-scale parallel machines
Large-scale parallel machines are incorporating increasingly sophisticated architectural support for user-level messaging and global memory access. We provide a systematic evaluation of a broad spectrum of current design alternatives based on our implementations of a global address language on the Thinking Machines CM-5, Intel Paragon, Meiko CS-2, Cray T3D, and Berkeley NOW. This evaluation includes a range of compilation strategies that make varying use of the network processor; each is optimized for the target architecture and the particular strategy. We analyze a family of interacting issues that determine the performance trade-offs in each implementation, quantify the resulting latency, overhead, and bandwidth of the global access operations, and demonstrate the effects on application performance.
11858758
Improving the performance of log-structured file systems with adaptive methods
File system designers today face a dilemma. A log-structured file system (LFS) can offer superior performance for many common workloads such as those with frequent small writes, read traffic that is predominantly absorbed by the cache, and sufficient idle time to clean the log. However, an LFS has poor performance for other workloads, such as random updates to a full disk with little idle time to clean. In this paper, we show how adaptive algorithms can be used to enable LFS to provide high performance across a wider range of workloads. First, we show how to improve LFS write performance in three ways: by choosing the segment size to match disk and workload characteristics, by modifying the LFS cleaning policy to adapt to changes in disk utilization, and by using cached data to lower cleaning costs. Second, we show how to improve LFS read performance by reorganizing data to match read patterns. Using trace-driven simulations on a combination of synthetic and measured workloads, we demonstrate that these extensions to LFS can significantly improve its performance.
208003557
Serverless network file systems
We propose a new paradigm for network file system design: serverless network file systems. While traditional network file systems rely on a central server machine, a serverless system utilizes workstations cooperating as peers to provide all file system services. Any machine in the system can store, cache, or control any block of data. Our approach uses this location independence, in combination with fast local area networks, to provide better performance and scalability than traditional file systems. Furthermore, because any machine in the system can assume the responsibilities of a failed component, our serverless design also provides high availability via redundatn data storage. To demonstrate our approach, we have implemented a prototype serverless network file system called xFS. Preliminary performance measurements suggest that our architecture achieves its goal of scalability. For instance, in a 32-node xFS system with 32 active clients, each client receives nearly as much read or write throughput as it would see if it were the only active client.
907891
Segank: A Distributed Mobile Storage System
This paper presents a distributed mobile storage system designed for storage elements connected by a network of non-uniform quality. Flexible data placement is crucial, and it leads to challenges for locating data and keeping it consistent. Our system employs a location- and topology-sensitive multicast-like solution for locating data, lazy peer-to-peer propagation of invalidation information for ensuring consistency, and a distributed snapshot mechanism for supporting sharing. The combination of these mechanisms allows a user to make the most of what a non-uniform network has to offer in terms of gaining fast access to fresh data, without incurring the foreground penalty of keeping distributed elements on a weak network consistent.
6622555
A quantitative analysis of cache policies for scalable network file systems
Current network file system protocols rely heavily on a central server to coordinate file activity among client workstations. This central server can become a bottleneck that limits scalability for environments with large numbers of clients. In central server systems such as NFS and AFS, all client writes, cache misses, and coherence messages are handled by the server. To keep up with this workload, expensive server machines are needed, configured with high-performance CPUs, memory systems, and I/O channels. Since the server stores all data, it must be physically capable of connecting to many disks. This reliance on a central server also makes current systems inappropriate for wide area network use where the network bandwidth to the server may be limited.
In this paper, we investigate the quantitative performance effect of moving as many of the server responsibilities as possible to client workstations to reduce the need for high-performance server machines. We have devised a cache protocol in which all data reside on clients and all data transfers proceed directly from client to client. The server is used only to coordinate these data transfers. This protocol is being incorporated as part of our experimental file system, xFS. We present results from a trace-driven simulation study of the protocol using traces from a 237 client NFS installation. We find that the xFS protocol reduces server load by more than a factor of six compared to AFS without significantly affecting response time or file availability.
14669009
Considering the energy consumption of mobile storage alternatives
This paper is motivated by a simple question: what are the energy consumption characteristics of mobile storage alternatives? To answer this question, we are faced with a design space of multiple dimensions. Two important dimensions are the type of storage technologies and the type of file systems. In this paper, we explore some options along each of these two dimensions. We have constructed a logical-disk system, which can be configured to run on different storage technologies and to emulate the behavior of different file systems. As we explore these configuration options, we find that the energy behavior is determined by a complex interaction of three factors: the power management mechanism of the storage device, the distribution of idleness in the workload, and the file system strategies that attempt to exploit and bridge these first two factors.
2587881
Isomap Based on the Image Euclidean Distance
Scientists find that the human perception is based on the similarity on the manifold of data set. Isometric feature mapping (isomap) is one of the representative techniques of manifold. It is intuitive, well understood and produces reasonable mapping results. However, if the input data for manifold learning are corrupted with noises, the isomap algorithm is topologically unstable. In this paper, we present an improved manifold learning method when the input data are images - the image Euclidean distance based isomap (imisomap), in which we use a new distance for images called image Euclidean distance (IMED). Experimental results demonstrate a consistent performance improvement of the algorithm imisomap over the traditional isomap based on Euclidean distance
36952841
Textual CBR for Incident Report Retrieval
Incident Management Systems can play a crucial role in helping to reduce the number of workplace accidents by providing support for incident analysis. In particular, the retrieval of relevant similar incident reports can help safety personnel to identify factors and patterns that have contributed or might potentially contribute to accidents. Incident Report Retrieval is a relatively new research topic in the field of Accident Reporting and Analysis, and we are interested in developing intelligent computational support for retrieving incident information that leverages both the featural and textual components of incident reports. This paper describes InRet-T, an Incident Report Retrieval system that incorporates approaches from textual case-based reasoning to integrate both featural and textual aspects in retrieving civil aviation incident reports. It also provides a preliminary evaluation of InRet-T that offers some insight into the use of textual CBR approaches to incident analysis.
36876991
Cooperative dynamics coordinated by stochastic noise in a multi-cell system
We investigate a general coupled noisy system with time delays for cooperative behavior in a multi-cell system. The main conclusion is that appropriate noise intensity and coupling are capable of driving the coupled system to synchrony or resonance, which may be exploited by biological organisms actively to facilitate mutual communication. A multi-cell system with a synthetic gene network, which consists of both intracellular and extracellular noise and time delays, is adopted to demonstrate the effect of noise and coupling on collective dynamics.
7961359
LexTrim: A Lexical Cohesion Based Approach to Parse-and-Trim Style Headline Generation
In this paper we compare two parse-and-trim style headline generation systems. The Topiary system uses a statistical learning approach to finding topic labels for headlines, while our approach, the LexTrim system, identifies key summary words by analysing the lexical cohesion structure of a text. The performance of these systems is evaluated using the ROUGE evaluation suite on the DUC 2004 news stories collection.
18780724
Synchronizing a multicellular system by external input: an artificial control strategy
MOTIVATION
Although there are significant advances on elucidating the collective behaviors on biological organisms in recent years, the essential mechanisms by which the collective rhythms arise remain to be fully understood, and further how to synchronize multicellular networks by artificial control strategy has not yet been well explored.


RESULTS
A control strategy is developed to synchronize gene regulatory networks in a multicellular system when spontaneous synchronization cannot be achieved. We first construct an impulsive control system to model the process of periodically injecting coupling substances with constant or random impulsive control amounts into the common extracellular medium, and further study its effects on the dynamics of individual cells. We derive the threshold of synchronization induced by the periodic substance input. Therefore, we can synchronize the multicellular network to a specific collective behavior by changing the frequency and amplitude of the periodic stimuli. Moreover, a two-stage scheme is proposed to facilitate the synchronization in this paper. We show that the presence of the external input may also initiate different dynamics. The multicellular network of coupled repressilators is used to show the effectiveness of the proposed method. The results not only provide a perspective to understand the interactions between external stimuli and intrinsic physiological rhythms, but also may lead to development of realistic artificial control strategy and medical therapy.


AVAILABILITY



CONTACT
aihara@sat.t.u-tokyo.ac.jp.