Bimonthly    Since 1986
ISSN 1004-9037
Indexed in:
Publication Details
Edited by: Editorial Board of Journal of Data Acquisition and Processing
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Distributed by:
China: All Local Post Offices
  • Table of Content
      10 May 1999, Volume 14 Issue 3   
    For Selected: View Abstracts Toggle Thumbnails
    Where Does the Time Go in Software DSMs?—Experiences with JIAJIA
    SHI Weisong; HU weiwu; TANG Zhimin;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 193-205. 
    Abstract   PDF(618KB) ( 1414 )  
    The performance gap between software DSM systems and message passing platforms prevents the prevalence of software DSM system greatly, though great efforts have been delivered in this area in the past decade. In this paper, we take the challenge to find where we should focus our efforts in the future design. The components of total system overhead of software DSM systems are analyzed in detail firstly. Based on a state-of-the-art software DSM system JIAJIA, we measure these components on Dawning parallel sy…
    Reference Implementation of Scalable I/O Low-Level API on Intel Paragon
    SUN Ninghui;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 206-223. 
    Abstract   PDF(800KB) ( 1356 )  
    The Scalable I/O (SIO) Initiative's Low-Level Application Pro- gramming Interface (SIO LLAPI)provides file system implementers with a simplelow-Level interface to support high-level parallel I/O interfaces efficiently and ef fectively. This paper describes a reference implementation and the evaluation of the SIO LLAPI on the Intel Paragon multicomputer. The implementation provides the file system structure and striping algorithm compatible with the Parallel File System (PFS) of Intel Paragon, and runs eithe…
    Hierarchical Bulk Synchronous Parallel Model and Performance Optimization
    HUANG Linpeng; SUN Yongqiang; YUAN Wei;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 224-233. 
    Abstract   PDF(454KB) ( 1413 )  
    Based on the framework of BSP, a Hierarchical Bulk Synchronous Parallel (HBSP) performance model is introduced in this paper to capture the per formance optimization problem for various stages in parallel program development and to accurately predict the performance of a parallel program by considering fac tors causing variance at local computation and global communication. The related methodology has been applied to several real applications and the results show that HBSP is a suitable model for optimizing…
    Asynchronous Heterogeneous Mechanism for Hyper-Distributed Hyper-Parallel Al Processing
    SHUAI Dianxun;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 234-241. 
    Abstract   PDF(397KB) ( 1361 )  
    This paper proposes an asynchronous heterogeneous propagation approach of concurrent competitive waves for hyper-distributed hyper-parallel heuris tic problem-solving. This approach is much more powerful than the synchronous homogeneous mechanisms and the asynchronous superimposition algorithms, and has universal validity and availability. The basic conception, concurrent algorithm and its properties are discussed. The theory and conclusions drawn in this paper are of essential importance for the hardware i…
    Garbage Collection in Uncoordinated Checkpointing Algorithms
    LIU Yunlong; CHEN Junliang;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 242-249. 
    Abstract   PDF(380KB) ( 1521 )  
    In this papert the hard problem of the thorough garbage collection in uncoordinated Checkpointing algorithms is studied. After introduction of the traditional garbage collecting scheme, with which only obsolete checkpoints can be discarded, it is shown that this kind of traditional method may fail to discard any checkpoint in some special cases, and it is necessary and urgent to find a thorough garbage collecting method, with which all the checkpoints useless for any future rollback-recovery including the o…
    Fast Multicast on Multistage Interconnection Networks Using Multi-Head Worms
    WANG Xiaodong; XU Ming; ZHOU Xingming;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 250-258. 
    Abstract   PDF(234KB) ( 1371 )  
    This paper proposes a new approach for implementing fast multicast on multistage interconnection networks (MINs) with multi-head worms. For an MIN with n stages of k×k switches, a single multi-head worm can cover an arbitrary set of destinations with a single communication start-up. Compared with schemes using unicast messages, this approach reduces multicast latency significantly and performs better than multi-destination worms.
    An Assignment Method for IPUs in Distributed Systems
    LI Liang; YANG Guowei;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 259-266. 
    Abstract   PDF(347KB) ( 1248 )  
    In a distributed system, one of the most important things is to establish an assignment method for distributing tasks. It is assumed that a dis tributed system does not have a central administrator, all independent processing units in this system want to cooperate for the best results, but they cannot know the conditions of one another. So in order to undertake the tasks in admirable pro portions, they have to adjust their undertaking tasks only by self-learning. In this paper, the performance of this syste…
    A Model for Dynamic Adaptive Coscheduling
    LU Sanglu; ZHOU Xiaoboand; XIE Li;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 267-275. 
    Abstract   PDF(396KB) ( 1497 )  
    This paper proposes a dynamic adaptive coscheduling model DASIC to take advantage of excess available resources in a network of workstations (NOW).Besides coscheduling related subtasks dynamically, DASIC can scale up or down the process space depending upon the number of available processors on an NOW.Based on the dynamic idle processor group (IPG), DASIC employs three modules:the coscheduling module, the scalable scheduling module and the load balancing module, and uses six algorithms to achieve scalabilit…
    A Multimedia Synchronization Model Based on Timed Petri Net
    LIANG Yongquan; SHI Zhongzhi;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 276-282. 
    Abstract   PDF(294KB) ( 1452 )  
    Multimedia synchronization is a significant requirement for distributed multimedia applications. In this paper, a multimedia synchronization model based on timed Petri nets is presented. Using this model one can give the abstraction and formal description for multimedia object compositions with time-constrained relations. Algorithms for asynchronous user interactions are also presented.
    Video Key Frame Extraction by Unsupervised Clustering and Feedback Adjustment
    ZHUANG Yueting; RUI Yong; Thomas S.Huang;
    Journal of Data Acquisition and Processing, 1999, 14 (3): 283-287. 
    Abstract   PDF(340KB) ( 1461 )  
    In video information retrieval, key frame extraction has been rec ognized as one of the important research issues. Although much progress has been made, the existing approaches are either computationally expensive or ineffective in capturing salient visual content. In this paper, we first discuss the importance of key frame extraction and then briefly review and evaluate the existing approaches. To overcome the shortcomings of the existing approaches, we introduce a new algorithm for key frame extraction ba…
SCImago Journal & Country Rank

ISSN 1004-9037


Editorial Board
Author Guidelines
Journal of Data Acquisition and Processing
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China

E-mail: info@sjcjycl.cn
  Copyright ©2015 JCST, All Rights Reserved