J. Gu, "Local Search for the Satisfiability (SAT) Problem," IEEE Transactions on Systems and Cybernetics, vol. 23, no. 3, Jul./Aug. 1993, pp. 1108-1129.  Home/Search   Document Details and Download   Summary   Related Articles

....For example, if the tasks of an application are not properly scheduled to the machine, the extra inter task communication overhead can offset the gain from parallelization. A large body of research efforts addressing these problems has been reported in the literature [15] 28] 38] 65] [81], 92] 123] 129] 130] 131] 153] 155] 164] 189] 192] Our research focus is on the scheduling aspect. The objective of scheduling is to minimize the completion time of a parallel application by properly allocating the tasks to the processors and sequencing the execution of the ....

....The FAST algorithm is based on an effective search technique [117] The linear time algorithm first generates an initial solution and then refines it using a random neighborhood search technique. Random search based algorithms have been proposed and applied to various problems with good results [81], 98] 127] 149] 189] In addition to simulation studies, the FAST algorithm is evaluated using a prototype computer aided parallelization and scheduling tool called CASCH (Computer Aided Ov 3 ( Oe v ( 76 SCHeduling) with real applications running on the Intel Paragon. The ....

[Article contains additional citation context not shown here]

J. Gu, "Local Search for the Satisfiability (SAT) Problem," IEEE Transactions on Systems and Cybernetics, vol. 23, no. 3, Jul./Aug. 1993, pp. 1108-1129.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC