Concurrent automata, database computers, and security: a “new” security paradigm for secure parallel processing

  • Authors:
  • T. Y. Lin

  • Affiliations:
  • Department of Mathenmtics and Computer Science, San Jose State University, San Jose, California

  • Venue:
  • NSPW '92-93 Proceedings on the 1992-1993 workshop on New security paradigms
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

Declustering has been proposed to speed up parallel databasemachines. However, the security requires clustering. In this paper,we use temporal clustering to reconcile the apparent conflict.Automata theory is applied to high level architecture design. Basedon Petri net theory a database machine is proposed. The classicalnotion of clustering is extended to temporal dimension and isimported to parallel database systems. The proposed databasemachine not only has the linear speedup, its capability (modelingpower) also is increased in the order of magnitude. Thecomputational model (in terms of automata) of the total system isstrictly higher than the union of that of individual machine. Italso efficiently supports the security.