Chandrasekhar, Suresh2014-03-142014-03-141998-08-05etd-71798-84748http://hdl.handle.net/10919/36909This thesis addresses the partitioning problem for configurable computing machines. Specifically, this thesis presents algorithms to partition chain-structured task graphs across configurable computing machines. The algorithms give optimal solutions for throughput and total execution time for these problems under constraints on area, pin count, and power consumption. The algorithms provide flexibility for applying these constraints while remaining polynomial in complexity. Proofs of correctness as well as an analysis of runtime complexity are given. Experiments are performed to illustrate the runtime of these algorithms.In CopyrightPartitioningCCMField programmable gate arraysAlgorithmPartitioning Methods and Algorithms for Configurable Computing MachinesThesishttp://scholar.lib.vt.edu/theses/available/etd-71798-84748/