A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh 


Vol. 6,  No. 11, pp. 2946-2953, Nov.  1999
10.3745/KIPSTE.1999.6.11.2946


PDF
  Abstract

In this paper, we propose the mod%uB514 %uC0C8 measure and compare the performances of the Linux, PC_Solaris and FreeBSD which are the heterogeneous PC based UNIX kernels connected by network. Using the stop-watch timer with the %u33B2 unit, we measure the important performance indices of UNIX kernels which are the primitive and command execution time and disk I/O time. Also we measure the message transfer time using the TCP, UDP and RPC methods to compare the network performance of UNIX kernels. And we compare the performance of NFS for each UNIX kernels. And we display the measured data on internet.

  Statistics
  Cite this article

[IEEE Style]

Y. H. Kim, "A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 11, pp. 2946-2953, 1999. DOI: 10.3745/KIPSTE.1999.6.11.2946.

[ACM Style]

Young Hak Kim. 1999. A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 11, (1999), 2946-2953. DOI: 10.3745/KIPSTE.1999.6.11.2946.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals