### Table 2: Distributed Deadlock Resolution Algorithms

"... In PAGE 2: ... Generally, deadlock resolution cost is measured either in terms of time complexity [14, 24], or in terms of message complexity [6]. The complexity of resolution algorithms is summarized in Table2 , where n is the total number of processes, m the number of processes having the priorities greater than deadlocked processes, Nr the number of resources, and nD the number of deadlocked... ..."

Cited by 1

### Table 2: Distributed Deadlock Resolution Algorithms

2006

"... In PAGE 6: ... Generally, deadlock resolution cost is measured either in terms of time complexity [6, 17, 27], or in terms of message complexity [15, 16, 7]. The complexity of resolution algorithms is summarized in Table2 , where n is the total number of processes, m the number of processes having the priorities greater than deadlocked processes, Nr the number of resources, and nD the size of a deadlock. Note that the message complexities are not given in [17, 27].... ..."

### Table 3: Multidatabase and Mobile System

1999

"... In PAGE 4: ... 3.6 Multidatabase and Mobile Systems A summary of the issues facing a multidatabase and mobile system issues is given in Table3 . Due to these similarities in the objectives of effectively accessing data in a multidatabase and a wireless-mobile computing environment, we propose to superimpose a wireless- mobile computing environment on an MDBMS to realize a system capable of effectively accessing data over a ... ..."

Cited by 1

### Table 1. Comparison of results for various approaches.

"... In PAGE 8: ... 4. Numerical Results Table1 compares the balance and uniformity (t,s) of (n,2) de Bruijn sequences... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. ------------------------- Table1 goes here ------------------------- In Table 1, we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... In PAGE 9: ... In the case of Algorithm II, the characteristics of the sequences obtained by the optimal mappings with respect to both balance and uniformity criteria are shown. -------------------------Table 1 goes here ------------------------- In Table1 , we observe that: 1. Although Algorithm I generates sequences with optimal uniformity (minimum s), the corresponding balance criterion t is rather large.... ..."

### Table 1. Performance Characteristics of Different AM Implementations

1997

"... In PAGE 7: ...ficient, buffered writes in the SCI DSM only. Performance measurements on the UCSB SCI cluster show competitive performance behavior of the SCI AM system ( Table1 ). Our own implementation, depicted in the first row of Table 1, adds little over- head to the raw latency of 9.... ..."

Cited by 13

### Table 2: Technology Mapping results

"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

### Table 5. Computing cost of the conventional EA and multi-database CEA schemes Optimum design

2005

"... In PAGE 5: ... Thus, in the sequel of this example the discussion on databases refers to the SDB-members defined above for the I-shaped cross-sections of columns and beams. Table5 illustrates the performance of the conventional EA(5+5) scheme using all SDB-members. As in the previous test example, coarse databases allow the optimization process to locate optimum designs of significantly higher quality than FDB does.... ..."

### Table 1: Distributed Deadlock Detection Algorithms

"... In PAGE 2: ...Table 1: Distributed Deadlock Detection Algorithms Table1 summarizes the worst-case complexities of dis- tributed deadlock detection algorithms [11, 12], where n is the total number of processes, e the number of edges, d the diameter, and l the number of sink nodes of the WFG. One influential distributed detection algorithm for general- ized deadlocks appeared in [12] by Kshemkalyni and Singhal.... ..."

Cited by 1

### Table 1: Conflict resolution strategies in MHP-2PL Since 2PL is used for non-real-time transactions, a deadlock resolution algorithm is needed for the executions of non-real-time transactions. It is obvious to see that all soft-real-time transactions in MHP-2PL schedules are deadlock-free.

2002

Cited by 1