19123449
Operating System Kernel for a Reconfigurable Multiprocessor System
19852972
Distributed Instruction Set Computer Architecture
The Distributed Instruction Set Computer Architecture (DISC) is proposed as a fine-grained multiprocessing computer architecture. DISC uses a parallel instruction set and a distributed control mechanism to explore fine-grained, parallel processing in a multiple-functional-unit system. Multiple instructions are executed in parallel and/or out of order at the highest speed of n instructions/cycle, where n is the number of functional units. Based on this architecture, a hardware system is developed. Extensive studies were conducted on a behavioral DISC system model to investigate the performance level, the effect of program sizes, and the hardware utilization. Simulation showed that a DISC system incorporating 16 functional units can run 7.7 times faster than a single-functional-unit DISC system. >
27793990
Fail Safe Distributed Fault Diagnosis of Multiprocessor Systems
41641437
Network Facility for a Reconfigurable Computer Architecture
31789422
Performance Analysis of Multistage Interconnection Network Configurations and Operations
A performance evaluation using both analytical and simulation models, of circuit-switching multistage interconnection networks in aspects of configurations and operations is presented. Two configurations of the networks, single and dual, are evaluated. Network operations considered include conflict resolution strategies and communication strategies. Two different conflict resolution strategies, drop and hold, are analyzed. New analyses using Markov chains, are given, and are verified by simulation results. In the single-network configuration, it is shown that the drop strategy is better than the hold strategy for randomly distributed traffic. In the dual network configuration, five different communication strategies are investigated, and the optimum performance level is shown to be dependent on the length of the data transfer time. >
15881866
Performance analysis of circuit switching, baseline interconnection networks
Performance evaluation, using both analytical and simulation models, of circuit switching baseline networks is presented. Two configurations of the baseline networks, single and dual, are evaluated. In each configuration, two different conflict resolution strategies, drop and hold, are tried to see the performance difference. Our analytical models are based on a more realistic assumption. New analyses are given and are verified by simulation results. In single network configuration, it is shown that the drop strategy is better than the hold strategy in the case that the data transfer time is longer than 10 cycles under a high request rate. In the dual network configuration, five different communication strategies are investigated and the optimum performance level is shown to be dependent on the length of the data transfer time.
38476421
Design Trade-offs for Process Scheduling in Tightly Coupled Multiprocessor Systems
1308934
A World-Wide Web server on a multicomputer system
As the number of people browsing the world-wide web increases explosively, the workload of popular web servers also increases rapidly. A multicomputer system that was designed for I/O intensive applications has been found to be quite suitable for serving as a web server. The system is composed of multiple clusters of multiprocessors interconnected by an interconnection network. The interconnection network is an ATM-like cell-based switching network which can be restructured so that the system can be scaled up to meet the increasing demands of web service. It is also found that the multicomputer system can support video streams effectively. Design of the system as well as porting of web servers on to it are discussed in this paper.
6684027
iProLINK: an integrated protein resource for literature mining
The exponential growth of large-scale molecular sequence data and of the PubMed scientific literature has prompted active research in biological literature mining and information extraction to facilitate genome/proteome annotation and improve the quality of biological databases. Motivated by the promise of text mining methodologies, but at the same time, the lack of adequate curated data for training and benchmarking, the Protein Information Resource (PIR) has developed a resource for protein literature mining--iProLINK (integrated Protein Literature INformation and Knowledge). As PIR focuses its effort on the curation of the UniProt protein sequence database, the goal of iProLINK is to provide curated data sources that can be utilized for text mining research in the areas of bibliography mapping, annotation extraction, protein named entity recognition, and protein ontology development. The data sources for bibliography mapping and annotation extraction include mapped citations (PubMed ID to protein entry and feature line mapping) and annotation-tagged literature corpora. The latter includes several hundred abstracts and full-text articles tagged with experimentally validated post-translational modifications (PTMs) annotated in the PIR protein sequence database. The data sources for entity recognition and ontology development include a protein name dictionary, word token dictionaries, protein name-tagged literature corpora along with tagging guidelines, as well as a protein ontology based on PIRSF protein family names. iProLINK is freely accessible at http://pir.georgetown.edu/iprolink, with hypertext links for all downloadable files.
5461786
Analysis and Comparison of Geometric and Algebraic Multigrid for Convection-Diffusion Equations
The discrete convection-diffusion equations obtained from streamline diffusion finite element discretization are solved on both uniform meshes and adaptive meshes. Estimates of error reduction rates for both geometric multigrid (GMG) and algebraic multigrid (AMG) are established on uniform rectangular meshes for a model problem. Our analysis shows that GMG with line Gauss-Seidel smoothing and bilinear interpolation converges if $h\gg \epsilon^{2/3}$, and AMG with the same smoother converges more rapidly than GMG if the interpolation constant $\beta$ in the approximation assumption of AMG satisfies $\beta \ll (\frac{h}{\sqrt{\epsilon}})^{\alpha}, \hs{1mm} \mbox{where $ \alpha = \Big\{ {\begin{smallmatrix} 1, & {h < \sqrt \varepsilon, } \\ 2, & {h \ge \sqrt \varepsilon.} \\ \end{smallmatrix}}$}$ On unstructured triangular meshes, the performance of GMG and AMG, both as solvers and as preconditioners for GMRES, are evaluated. Numerical results show that GMRES with AMG preconditioning is a robust and reliable solver on both type of meshes.
14697178
Design of integrated multimedia compression and encryption systems
Two approaches for integrating encryption with multimedia compression systems are studied in this research, i.e., selective encryption and modified entropy coders with multiple statistical models. First, we examine the limitations of selective encryption using cryptanalysis, and provide examples that use selective encryption successfully. Two rules to determine whether selective encryption is suitable for a compression system are concluded. Next, we propose another approach that turns entropy coders into encryption ciphers using multiple statistical models. Two specific encryption schemes are obtained by applying this approach to the Huffman coder and the QM coder. It is shown that security is achieved without sacrificing the compression performance and the computational speed. This modified entropy coding methodology can be applied to most modern compressed audio/video such as MPEG audio, MPEG video, and JPEG/JPEG2000 images.