David Cashman
Altera
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by David Cashman.
field programmable gate arrays | 2005
David Lewis; Elias Ahmed; Gregg William Baeckler; Vaughn Betz; Mark Bourgeault; David Cashman; David Galloway; Michael D. Hutton; Christopher F. Lane; Andy L. Lee; Paul Leventis; Sandy Marquardt; Cameron McClintock; Ketan Padalia; Bruce B. Pedersen; Giles Powell; Boris Ratchev; Srinivas T. Reddy; Jay Schleicher; Kevin Stevens; Richard Yuan; Richard G. Cliff; Jonathan Rose
This paper describes the Altera Stratix II™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15% in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perform two bits of arithmetic per ALM, and perform a sum of up to three inputs. The routing fabric adds a new set of fast inputs to the routing multiplexers for another 3% improvement in performance, while other improvements in routing efficiency cause another 6% reduction in area. These changes in combination with other circuit and architecture changes in Stratix II contribute 27% of an overall 51% performance improvement (including architecture and process improvement). The architecture changes reduce area by 10% in the same process, and by 50% after including process migration.
ACM Transactions on Algorithms | 2011
David Cashman; Avner Magen
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is defined syntactically and without any complexity limitations and hence our approximation bounds are independent of the P versus NP question. Using the stack model, we bound the performance of a broad class of primal-dual and local-ratio algorithms and supply a (log n+1)/2 inapproximability result for set cover, a 4/3 inapproximability for min Steiner tree, and a 0.913 inapproximability for interval scheduling on two machines.
field programmable gate arrays | 2009
David Lewis; Elias Ahmed; David Cashman; Tim Vanderhoek; Chris Lane; Andy L. Lee; Philip Pan
field programmable gate arrays | 2013
David Lewis; David Cashman; Mark T. Chan; Jeffrey Christopher Chromczak; Gary Lai; Andy L. Lee; Tim Vanderhoek; Haiming Yu
Archive | 2009
David Lewis; David Cashman
Archive | 2010
David Lewis; David Cashman; Jeffrey Christopher Chromczak
Archive | 2013
David Cashman; David Lewis; Valavan Manohararajah
Archive | 2005
David Cashman; David Lewis; Gregg William Baeckler; Ketan Padalia
Archive | 2003
Ketan Padalia; David Cashman; David Lewis; Andy L. Lee; Jay Schleicher; Jinyong Yuan; Henry Kim
Archive | 2007
David Lewis; David Cashman