Chih-Chien Tu

Learn More
Fault-tolerant Parallel Processing Combining Linda, Checkpointing, and Transactions Karpjoo Jeong Research Advisor: Professor Dennis Shasha With the advent of high performance workstations and fast LANs, networks of workstations have recently emerged as a promising computing platform for long-running coarse grain parallel applications. Their advantages are(More)
ÐIn this paper, we study the spectral methods for graph bisection problems and conclude certain numerical results. Spectral methods contain two topics: eigenvalue bounds for graph bisection width and bisection algorithms with eigenvector space. Two graph bisection problems are mainly investigated: ®nding the best bisection for the equal-size graph bisection(More)
Graph partitioning problems are NP-hard problems and very important in VLSI design. We study relations among several eigenvalue bounds and algorithms for graph partitioning problems. Also, we design an algorithm for the problems which performs the following: ®rst it computes the k largest eigenvalues of the ane symmetric matrix function to attain(More)
The paper is to present a simulation method to search for an optimal (z, Z) (z < Z) values for the (z, Z) production control policy so that the expected inventory cost rate (i.e. expected total cost due to both inventory holding and backlog per unit time) is minimal for a single machine system with buffer. The system is subject to operationdependent failure(More)
Fault-tolerant Parallel Processing Combining Linda, Checkpointing, and Transactions Karpjoo Jeong Research Advisor: Professor Dennis Shasha With the advent of high performance workstations and fast LANs, networks of workstations have recently emerged as a promising computing platform for long-running coarse grain parallel applications. Their advantages are(More)
  • 1