The multicast ATM switch has been developed for the purpose of the point-to-multipoint cell transmission. The basic structure of conventional multicast ATM switches is mainly based on a T. T. Lee's multicast switch, since it has a very simple and expandable structure. However, in spite of these benefits, it requires excessive hardware for the loss-free cell transmission, since it employs the blocking network, i.e., the banyan network as a copy network and a routing network. In this paper, we propose a new network for the multicast ATM switching. In proposed copy network, we adopt a new structure, the parallel broadcast banyan network with bypass links between switch planes, to offer the maximum cell transmission capacity and the fault tolerance. All conflict cells, which are blocked during the cell routing process, are bypassed to the next switch plane through bypass links and try to be routed. And to support the highly efficient cell transmission, we propose Alternate Path Scheme (APS) and copy-number (CN) comparator in the proposed copy network. APS is a kind of cell transmission schemes and guarantees multicasting capability to achieve a high performance. To estimate the performance of a proposed copy network, we provide several simulation results.

In this letter we analyze the economic worth of GPU on analytical processing of GPU-accelerated database management systems (DBMSes). To this end, we conducted rigorous experiments with TPC-H across three popular GPU DBMSes. Consequently, we show that co-processing with CPU and GPU in the GPU DBMSes was cost-effective despite exposed concerns.

In this paper, we suggest a new probabilistic model of semantic role labeling, which uses the frameset of the predicate as explicit linguistic knowledge for providing global information on the predicate-argument structure that local classifier is unable to catch. The proposed model consists of three sub-models: role sequence generation model, frameset generation model, and matching model. The role sequence generation model generates the semantic role sequence candidates of a given predicate by using the local classification approach, which is a widely used approach in previous research. The frameset generation model estimates the probability of each frameset that the predicate can take. The matching model is designed to measure the degree of the matching between the generated role sequence and the frameset by using several features. These features are developed to represent the predicate-argument structure information described in the frameset. In the experiments, our model shows that the use of knowledge about the predicate-argument structure is effective for selecting a more appropriate semantic role sequence.

The banyan network is a popular and basic structure of the multi-stage ATM switches. This paper presents a novel approach to resolve the internal blocking of the banyan network by using a Non-Blocking Permutation Generator (NBPG). The NBPG performs two functions, i.e., the first is to extract the conflict cells from the incoming cells and the second is to re-assign new input port addresses to the conflict cells. As a result, NBPG generates non-blocking I/O permutations. To estimate the performance of the NBPG, we provide the results of several simulations.