{"responseHeader":{"status":0,"QTime":5,"params":{"q":"{!q.op=AND}id:\"99871\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"file_name_t":"Gu-Parallel_Algorithms.pdf","thumb_s":"/89/9b/899bb93fd7b1873c7347bf5a5fccd9be51e2725d.jpg","oldid_t":"compsci 7984","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/17/be/17be9429f3f538d60a71890ae7d473964fdc630a.pdf","title_t":"Page 223","ocr_t":"205 the first for1 computation takes only O(n) time, while 0 (1) time is required for the other three. The worst case time complexity for DRA3 is O (n2m). Since T~c = O(n2m), T1 = O(nem3 ) = O(n3m3 ), the inherent parallelism in parallel DRA3 and M-DRA3 algorithms is: I(DRA3) = O(nm2 ). For problems of practical interest, DRA3 architecture offers 3 to 6 orders of magĀnitude performance improvement (103 to 106 times faster) over currently available DRA algorithms and architectures. Above CMOS chip was simulated using switch-level hardware circuit simulator and was successful to solve the 8-queens problem, for instance. 6.5 An Optimal Look Ahead Processor to Prune the Search Space We now combine our previous work [62,203) and the above ideas and give an optimal parallel DRA5 algorithm for enforcing arc consistency. Compared to other AC algorithms, the algorithmic structure of DRA5 tends to be more general, and much more tractable. It lends itself well to further algorithm parallelization for hardware implementation. 6.5.1 The Optimal DRAS Algorithm An optimal, parallel DRA5 algorithm is illustrated in Figure 6.35. The DRA5 algorithm is optimal in the sense that the optimal time bound, 0( nm ), for parallel AC algorithms is reached. We now show that DRA5 runs in O(nm) time. There are one sequential and four parallel computation procedures in the DRA5 algorithm. The while loop consists of entirely sequential steps . During each iteration step of the while loop (except the last one), the minimum number of labels that may be","id":99871,"created_tdt":"2016-05-25T00:00:00Z","parent_i":99969,"_version_":1679953745576722433}]},"highlighting":{"99871":{"ocr_t":[]}}}