Squashed embedding of E-R schemas in hypercubes
- Advanced Computer Architecture Lab., Dept. of Electrical Engineering and Computer Science, Univ. of Michigan, Ann Arbor, MI (US)
The authors have been investigating an approach to parallel database processing based on treating entity-relationship (E-R) schema graphs as dataflow graphs. A prerequisite is to find appropriate embeddings of the schema graphs into a processor graph, in this case a hypercube. This paper studies a class of adjacency preserving embeddings that map a node in the schema graph into a subcube (relaxed squashed or RS embeddings) or into adjacent subcubes (relaxed extended squashed or RES embeddings) of a hypercube. The mapping algorithm is motivated by the technique used for state assignment in asynchronous sequential machines. In general, the dimension of the cube required for squashed embedding of a graph is called the weak cubical dimension or WCD of the graph.
- OSTI ID:
- 6473526
- Journal Information:
- Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 8:4; ISSN 0743-7315; ISSN JPDCE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Mapping parallel algorithms into hypercubes
Embedding of rings and meshes onto faulty hypercubes using free dimensions