Sukanya SURANAUWARAT Hideo TANIGUCHI
Traditional process schedulers in operating systems control the sharing of the processor resources among processes using a fixed scheduling policy based on the utilization of a computer system such as a real-time or a timesharing system. Since the control over processor allocation is based on a fixed policy, not based on contents or behavior of processes, this can hinder an effective use of a processor or can extend the processing time of a process unnecessarily in some cases. We have already proposed a process scheduling policy, which responds to the behavior of multiple processes of a WWW server, in order to improve the response time of a WWW server. This policy gives any process of a WWW server that is predicted to be a WWW server process handling a text data request from a browser priority over all other processes by moving it to the head of the ready queue where processes waiting for the processor to become available are placed. In this paper, we present the experimental evaluation of our proposed process scheduling policy with regard to the number of simultaneous accesses from browsers and the processor load of the server machine, and explain the results we obtained.
Inbum JUNG Jongwoong HYUN Joonwon LEE
Shared memory multiprocessors are frequently used as compute servers with multiple parallel programs executing at the same time. In such environments, an operating system switches the contexts of multiple processes. When the operating system switches contexts, in addition to the cost of saving the context of the process being swapped out and that of bringing in the context of the new process to be run, the cache performance of processors also can be affected. The blocked algorithm improves cache performance by increasing the locality of memory references. In a blocked program using this algorithm, program performance can be significantly affected by the reuse of a block loaded into a cache memory. If frequent context switching replaces the block before it is completely reused, the cache locality in a blocked program cannot be successfully exploited. To address this problem, we propose a preemption-safe policy to utilize the cache locality of blocked programs in a multiprogrammed system. The proposed policy delays context switching until a block is fully reused within a program, but also compensates for the monopolized processor time on processor scheduling mechanisms. Our simulation results show that in a situation where blocked programs are run on multiprogrammed shared-memory multiprocessors, the proposed policy improves the performance of these programs due to a decrease in cache misses. In such situations, it also has a beneficial impact on the overall system performance due to the enhanced processor utilization.
This paper concentrates on the model useful for analyzing the error performance of M-estimators of a single unknown signal parameter: that is the error intensity model. We develop the point process representation for the estimation error, the conditional distribution of the estimator, and the distribution of error candidate point process. Then the error intensity function is defined as the probability density of the estimate and the general form of the error intensity function is derived. We compute the explicit form of the intensity functions based on the local maxima model of the error generating point process. While the methods described in this paper are applicable to any estimation problem with continuous parameters, our main application will be time delay estimation. Specifically, we will consider the case where coherent impulsive interference is involved in addition to the Gaussian noise. Based on numerical simulation results, we compare each of the error intensity model in terms of the accuracy of both error probability and mean squared error (MSE) predictions, and the issue of extendibility to multiple parameter estimation is also discussed.
Cheng-Chung HSU Wu-Shiung FENG
This paper describes how to generate, analyze and design a novel current-mode filter model using tunable multiple-output operational transconductance amplifiers and grounded capacitors (MO-OTA-Cs) for synthesizing both transmission poles and zeros. Transfer functions of low-order, high-order, general type, and special type are realized based on the filter model. The theory focuses mainly on establishing a relationship between the cascaded MO-OTA-Cs and the multiple-loop feedback matrix, which makes the structural generation and design formulas. Adopting the theory allows us to systematically generate many interesting new configurations along with some known structures. All the filter architectures contain only grounded capacitors, which can absorb parasitic capacitances and require smaller chip areas than floating ones. The paper also presents numerical design examples and simulation results to confirm the theoretical analysis.
This paper proposes a new parallel high speed mobile radio transmission scheme using cyclic-shifted-codes generated from a modified M-sequence. The modified M-sequence is biased with constant direct current (dc) on an M-sequence and is inserted the guard chips before and after this biased M-sequence. The proposed system has the following features: i) Orthogonality of the codes is kept not only between direct waves of each parallel channels but also between direct and delayed waves within the guard chips; ii) It is possible to reduce the number of kinds of codes allocated to one user; and iii) It is easy to recover both code and chip timings. In this paper, moreover, the performance of the proposed system was evaluated in terms of bit error rate (BER) under additive white Gaussian noise (AWGN), non-selective one path Rayleigh fading and double-spike Rayleigh fading channels. As a result, the proposed transmission scheme can transmit several Mbps in a high-speed double-spike Rayleigh fading channel with better quality in comparison with a conventional multicode CDM transmission scheme based on M-sequences.
Hideaki MATSUE Masahiro UMEHIRA Takehiro MURASE
The ATM Wireless Access (AWA) System allows portable terminals such as notebook PCs to provide up to 10Mbits/s to each user. AWA will be one of the last hops of the fiber system; it seamlessly provides wireless terminals with most of the services available in the fiber system. A prototype is developed to confirm system realization and the technical feasibility of the radio transmission rate of 80 Mbit/s, the highest yet reported in wireless access systems, by employing ATM technology to support multimedia communication with different communication quality requirements. The prototype uses TDMA as the multiple access method. This paper proposes the system concept and technical issues of the AWA system. The design and performance of the AWA prototype are clarified. It is confirmed that the target performance of the prototype can be achieved and technical issues are feasible.
Tadayoshi HORITA Itsuo TAKANAMI
We gave in [1] the software and hardware algorithms for reconfiguring 1 1/2-track switch 2-D mesh arrays with faults of processing elements, avoiding them. This paper shows an implementation of the hardware algorithm using an FPGA device, and by the logical simulation confirms the correctness of the behavior and evaluates reconfiguration time. From the result it is found that a self-repairable system is realizable and the system is useful for the run-time as well as fabrication-time reconfiguration because it requires no host computer to execute the reconfiguration algorithm and the reconfiguration time is very short.
Shin'ichiro SHINOMIYA Masaki AIDA Kazuyoshi SAITOH Noriteru SHINAGAWA Takehiko KOBAYASHI
Recent development of compact and powerful portable computers and mobile phones and proliferation of the Internet will enable mobile multimedia communications. From the viewpoint of implementing multimedia services into mobile communications, it allows us to predict that traffic characteristics of mobile networks change. For planning, designing, and operating mobile multimedia networks, it is important to investigate traffic models which take the effect of multimedia services into consideration. This paper investigates population of active users in a micro-cell and proposes a traffic model for mobile multimedia networks. This model describes a population process of active users in a micro-cell in diffusion model, and its characteristics include self-similarity and activity of mobility. We also made an evaluation of network performance by using simulation, in order to show that characteristics of the proposed traffic model have impact on planning and designing networks.
Yoshinari KAMEDA Takeo TAODA Michihiko MINOH
A high speed 3D shape reconstruction method with multiple video cameras and multiple computers on LAN is presented. The video cameras are set to surround the real 3D space where people exist. Reconstructed 3D space is displayed in voxel format and users can see the space from any viewpoint with a VR viewer. We implemented a prototype system that can work out the 3D reconstruction with the speed of 10.55 fps in 313 ms delay.
We have proposed and demonstrated the circuit, which collectively recognizes header. Comparing with conventional schemes, the proposed circuit consists of simple structure. The proposed recognition circuit enables fast all-optical self-routing and contributes to reduce the buffer size for temporary data storage in each switch.
Shoichi ARAKI Takashi MATSUOKA Naokazu YOKOYA Haruo TAKEMURA
This paper describes a new method for detection and tracking of moving objects from a moving camera image sequence using robust estimation and active contour models. We assume that the apparent background motion between two consecutive image frames can be approximated by affine transformation. In order to register the static background, we estimate affine transformation parameters using LMedS (Least Median of Squares) method which is a kind of robust estimator. Split-and-merge contour models are employed for tracking multiple moving objects. Image energy of contour models is defined based on the image which is obtained by subtracting the previous frame transformed with estimated affine parameters from the current frame. We have implemented the method on an image processing system which consists of DSP boards for real-time tracking of moving objects from a moving camera image sequence.
Pavol ZAVARSKY Nobuo FUJII Masahiro IWAHASHI Noriyoshi KAMBAYASHI Shinji FUKUMA Takeshi MYOKEN
A simple but efficient method to improve readability of discrete pseudo time-frequency representations (TFRs) of nonstationary signals by the reassignment of the representations in discrete frequency dimension is presented. The method does not rely on the nonzero time derivative of the window function employed in the estimation of pseudo TFR. This property of the reassignment method is advantageous because the method can provide an improved readability in the situation when a known reassignment method is unefficient. The reassignment of the TFRs of corrupted signals is discussed. Numerical examples are included to illustrate the performance of the proposed method.
Yoshiki SAMESHIMA Toshiyuki TSUTSUMI
This paper describes User Attribute with Validity Period extension field of public key certificate and Certificate Verification Service with Time Stamp. The field and service solve the problems of unavailability of the latest revoked certificate information, large size of the revocation information and lack of non-repudiation mechanism of the X. 509 Authentication Framework. The proposed extension field is useful to reduce the revoked certificate information sent from CA of an organization where there are periodical personnel changes. The Certificate Verification Service with Time Stamp is an on-line service providing certificate status and non-repudiation service. The paper shows how the combination of the field and service solves the problems and that the server can serve hundreds of thousands of messaging system users, and the security of the service is also discussed.
Shyam S. PANDEY Wataru TAKASHIMA Shuichi NAGAMATSU Keiichi KANETO
Photocarrier transport of regiorandom poly(3-hexylthiophene) P3HT in ITO/P3HT/Al sandwich cell configuration has been investigated by means of Time-of-Flight technique. Characteristics of Schottky diode and the magnitude of hole mobility have been found to be affected by impurities involved during the synthesis. The hole mobility in regiorandom P3HT at room temperature has been estimated to be 2.4 10-5 and 2.6 10-4 cm2/V. s before and after the removal of ferric ions, respectively, at a field of 5.0105 V/cm. Field dependencies of mobility before and after purification show unique feature and have been discussed in terms of the disorder model.
Francois BERRY Philippe MARTINET Jean GALLICE
In visual servoing, most studies are concerned with robotic application with known objects. In this paper, the problem of controlling a motion by visual servoing around an unknown object is addressed. In this case, the approach is interpreted as an initial step towards a perception goal of an unmodeled object. The main goal is to perform motion with regard to the object in order to discover several viewpoint of the object. An adaptive visual servoing scheme is proposed to perform such task. The originality of our work is based on the choice and extraction of visual features in accordance with motions to be performed. The notion of invariant feature is introduced to control the navigational task around the unknown object. During experimentation, a cartesian robot connected to a real time vision system is used. A CCD camera is mounted on the end effector of the robot. The experimental results present a linkage of desired motion around different kind of objects.
File system buffers provide memory space for data being transferred to and from disk and act as caches for the recently used blocks, and the buffer manager usually reads ahead data blocks to minimize the number of disk accesses. However, if several multimedia files with different consumption rates are accessed simultaneously from the file system in which LRU buffer replacement strategy is used, the read-ahead blocks of the low rate file are unloaded from memory to be used for loading a data block of a high data rate file, therefore they should be reloaded again into memory from disk when these blocks are actually referenced. This paper proposes and implements a new buffer cache management scheme for a multimedia file system and analyzes the performance of the proposed scheme by modifying the file system kernel of FreeBSD. In this proposed scheme, initially, some buffers are allocated to each opened multimedia file, privately, then these buffers are reused for other data blocks of that file when they are loaded from the disk. Moreover, the number of private buffers allocated for the file is dynamically adjusted according to its data rate. An admission control scheme is also proposed to prevent opening of a new file which may cause overloads in the file system. Experimental results comparing proposed scheme with the original FreeBSD and a simple CTL-based model show that the proposed buffer management scheme could support the realtime play back of several multimedia files with various data rates concurrently without helps of a realtime CPU and disk scheduling.
Makoto FURUKI Satoshi TATSUURA Osamu WADA Minquan TIAN Yasuhiro SATO Lyong Sun PU
Principle of a single shot demultiplextion by means of time-to-space conversion was investigated using femtosecond nonlinear optical response of absorption bleaching of squarylium dye (SQ) J-aggregates. Spincoated films of squarylium dye J-aggregates on glass substrates exhibit efficient and ultrafast transmittance change, which recovers 73% of its initial level (0 fs) within 1 ps. A simple method for time-to-space conversion was applied for this film. We took our attention to one of the characteristics of femtosecond pulse, which is the spatial thinness in its propagation direction. Femtosecond pulses of a single pump pulse and train of four probe pulses were illuminated to the same area (diameter of 10 mm) of the surface of the SQ J-aggregates film. Direction of the probe beam was normal to the surface of the film and that of the pump beam was oblique angle in horizontal plane. Caused by spatial delay of a pump pulse due to the illumination in oblique angle to the film, four probe pulses with interval time of 1 ps (1 THz) meet separate places on the film. Because of the fast response of the SQ J-aggregates, the film picked out part of each probe pulse, which has narrower shapes in horizontal direction compared to the initial circular one by transmittance change of the film. The spatially separated four lines were observed by a CCD camera for an image of the transmitted probe pulse train. These results suggest that the response time of SQ J-aggregate film, which determines the horizontal width of each line, to be enough for demultiplexing of 1 THz optical signals.
Manjula SANDIRIGAMA Akihiro SHIMIZU Matu-Tarow NODA
In the Internet and Mobile communication environment, authentication of the users is very important. Although at present password is extensively used for authentication, bare password transmission suffers from some inherent shortcomings. Several password-based authentication methods have been proposed to eliminate such shortcomings. Those proposed methods have relative demerits as well as merits. In this letter we propose a method where those demerits are eliminated. The prominent feature is security improvement apart from low processing, storage and transmission overheads compared to previous methods. This method can be used in several applications like remote login, encrypted and authenticated communication and electronic payment etc.
Takeshi MATSUDA Yoshifumi NISHIO Yoshihiro YAMAGAMI Akio USHIDA
We propose here a time-domain shooting algorithm for calculating the steady-state responses of nonlinear RF circuits containing parasitic elements that is based on both a modified Newton and a secant methods. Bipolar transistors and MOSFETs in ICs have small parasitic capacitors among their terminals. We can not neglect them because they will gives large effects to the shooting algorithm at the high frequency. Since our purpose is to develop a user friendly simulator, we mainly take into account the relatively large normal capacitors such as coupling and/or by-pass capacitors and so on, because the parasitic capacitors are usually smaller and contained in the device models. We have developed a very simple simulator only using the fundamental tools of SPICE, which can be applied to relatively large scale ICs, efficiently.
Chunhee WOO Daehyun LEE Hagbae KIM
When a failure or upset occurring in a controller computer induces a task failure durable for a substantial period, system dynamics apparently deviates from its desirable sample paths, and loses its stability in an extreme case for the period to exceed the hard deadline in a real-time control system. In the paper, we propose an algorithm to combine the deadlines of all elementary tasks (derived formerly by our work) executed in several operation modes with multi-sampling periods. This results in computing the hard deadline of the entire system through modifying task-state equations to capture the effects of task failures and inter-correlations among tasks.