Haruyasu Ueda

SpaceFusion : a multi-server architecture for shared virtual environments

A louver assembly adapted to be mounted to the rear window assembly of an automotive vehicle having a pair of integrally formed, one piece end cap unit and a plurality of elongated channel members, the end cap unit having a plurality of identical right hand end caps and a plurality of similar but reverse formed left hand end caps, a detent structure for locating and locking the channel members in alignment with the associated one of the end caps with resilient bias means for enhancing the lock and minimizing noise, the channel member being of a preselected length to connect right hand and left hand end caps in a predetermined spaced relationship whereby the louver assembly will be of the desired width to fit the rear window assembly, the end cap units being of a preselected length to provide a selected number of end caps whereby the louver assembly will be of the desired length to fit the rear window assembly, the end cap units being generally flexible between adjacent end caps whereby the end cap units can fit the vertical sweep the rear window, the channel members formed to provide a horizontal sweep, the end caps having tongue members adapted to be received within the associated ends of the channel members and being tapered to permit acceptance of the channel member ends over a wide range of angles while still providing support, guide means operative between the tongues of the end caps and the channel members to guide the same into engagement and including a blocking structure to preclude assembly of the channel members onto the tongues with the sweep in the wrong direction.

Data stream partitioning re-optimization based on runtime dependency mining

In distributed data stream processing, a program made of multiple queries can be parallelized by partitioning input streams according to the values of specific attributes, or partitioning keys. Applying different partitioning keys to different queries requires re-partitioning intermediary streams, causing extra communication and reduced throughput. Re-partitionings can be avoided by detecting dependencies between the partitioning keys applicable to each query. Existing partitioning optimization methods analyze query syntax at compile-time to detect inter-key dependencies and avoid re-partitionings. This paper extends those compile-time methods by adding a runtime re-optimization step based on the mining of temporal approximate dependencies (TADs) between partitioning keys. A TAD is defined in this paper as a type of dependency that can be approximately valid over a moving time window. Our evaluation, based on a simulation of the Linear Road Benchmark, showed a 94.5% reduction of the extra communication cost.

Grid Service Platform: Design and Implementation of Grid Middleware for Telecom Carriers

We have developed the Grid Service Platform (GSP), which is a grid middleware for telecom carriers. GSP can support not only non-interactive batch style services, but also interactive real-time services. Moreover, GSP attains autonomous resource sharing between services based on the priority of each service. We conducted a field trial of GSP on a testbed that consisted of three sites in Japan and France. Two different types of services were implemented on GSP: a video conferencing service (interactive) and a batch queuing service (non-interactive). As a result, the performance of both services were simultaneously enhanced. The session capacity of the video conferencing service was improved by up to 30%, while the total execution time of batch jobs was reduced by 12%.