Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Compatibility graph

As well as imparting improved fire retardancy these materials may also result in volume cost savings if they can be purchased for a lower price than the commodity phthalate. Precise knowledge of the compatibility between standard plasticizers and chlorinated paraffins is required because some mixtures become incompatible with each other and the PVC resins in use at certain temperatures. Phthalate—chlorinated paraffin compatibility decreases as the molecular mass of the phthalate and the plasticizer content of the PVC formulation increase. Many compatibility graphs are available (1). [Pg.123]

Figure 1 On the left-hand side, a protein receptor site and a ligand are schematically drawn. Some features are highlighted marked by letters. The corresponding distance compatibility graph is shown on the right. Each distance compatible pair of matched features is connected by an edge. The three encircled nodes are an example for a clique. Figure 1 On the left-hand side, a protein receptor site and a ligand are schematically drawn. Some features are highlighted marked by letters. The corresponding distance compatibility graph is shown on the right. Each distance compatible pair of matched features is connected by an edge. The three encircled nodes are an example for a clique.
Structure matching is based on the selection of maximal common patterns of biophoric centers that lead to a compatibility graph [23], Vertices of this graph correspond to pairs of equivalent centers, whereas edges correspond to pairs of centers having equivalent distances. Two centers are considered to be equivalent if they have at least one equal property within a preset tolerance. [Pg.254]

First, decompose the graph of the compatibility relation over (1-) into its connected components. This is a classical graph theory problem, and is done by a depth-first traversal of the graph. The decomposition is unique, and the algorithm is of complexity 0(m+q), where m is E(r), and q is the number of edges of the compatibility graph. [Pg.136]

Decompose the compatibility graph over (r) into its connected components ... [Pg.137]

D.L. Springer and D.E. Thomas, Exploiting the Special Structure of Conflict and Compatibility Graphs in High-Level Synthesis, Proceedings ICCAD 90, pp. 254-267, Santa Clara, CA, November 1990. [Pg.35]

Builds a compatibility graph, with one node per variable, and an edge connecting variables that can be assigned to the same register (variables that are live in different control steps). Then finds the minimum number of cliques, thus minimizing the number of registers. [Pg.42]

Builds a compatibility graph, with one node per data operator, and an edge connecting operators that can be assigned to the... [Pg.42]

In a post-processing phase, Busser then adds buses to the design, replacing multiplexors as necessary. A compatibility graph is... [Pg.69]

Exploiting conflict and compatibility graphs, and bus-merging using a compatibility graph. [Pg.71]

Operations are assigned using a weighted compatibility graph, with the nodes (operations) connected by the lowest-cost edge... [Pg.82]

The concurrency factor of Q can be computed by first constructing an undirected disjoint compatibility graph. Vertices of the disjoint compatibility graph, denoted by Gq = Q,Eq), correspond to elements of Q. Undirected edges Eq indicate when vertices are temporally disjoint, i.e. they cannot execute in parallel. [Pg.94]

Lemma 5,2.1 Given a sequencing graph Gm without conditional and loop vertices, the concurrency factor of a subset cf shareable operations Q CV is equal to the clique cover number of the corresponding disjoint compatibility graph Gq. [Pg.95]

Proof An edge in the disjoint compatibility graph Gq implies that two vertices cannot execute in parallel. Th fore, a clique in Gq corresponds to a subset of vertices that cannot execute in parallel. A clique cover partitions the elements of Q into cliques, and therefore the clique cover number for Gq is equal to the maximum number of elements in Q that can execute in parallel, which is in turn equal to the concurrency factor of Q. ... [Pg.96]

Returning to the example of Figure 5.6, the disjoint compatibility graph G q for the set Q = vi, V2, v, V4 is shown in Figure 5.7(b). A minimum clique cover is shown in (c) where operations within a clique are enclosed in ovals. The concurrency factor is equal to the clique cover number, which is 2. [Pg.96]

Figure S.IO illustrates the derivation of an augmented compatibility graph for a graph Gi. The number of vertices in the augmented compatibility graph is equal to the sum of the vertex weights. Figure S.IO illustrates the derivation of an augmented compatibility graph for a graph Gi. The number of vertices in the augmented compatibility graph is equal to the sum of the vertex weights.
Figure 5.10 Derivation of the augmented disjoint compatibility graph from a graph G,- and impropriate weights (a) sequencing graph with weights, (b) disjoint compatibility graph, (c) augmented disjoint compatibility graph. Figure 5.10 Derivation of the augmented disjoint compatibility graph from a graph G,- and impropriate weights (a) sequencing graph with weights, (b) disjoint compatibility graph, (c) augmented disjoint compatibility graph.

See other pages where Compatibility graph is mentioned: [Pg.495]    [Pg.140]    [Pg.6]    [Pg.7]    [Pg.497]    [Pg.187]    [Pg.138]    [Pg.23]    [Pg.24]    [Pg.24]    [Pg.82]    [Pg.190]    [Pg.196]    [Pg.272]    [Pg.272]    [Pg.273]    [Pg.273]    [Pg.313]    [Pg.96]    [Pg.96]    [Pg.96]    [Pg.99]    [Pg.100]   
See also in sourсe #XX -- [ Pg.497 ]

See also in sourсe #XX -- [ Pg.23 ]

See also in sourсe #XX -- [ Pg.272 , Pg.273 ]




SEARCH



© 2024 chempedia.info