Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(packing arrays). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Toronto

1. Luu, Jason. A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs.

Degree: 2010, University of Toronto

The complexity of Field-Programmable Gate Array (FPGAs) logic blocks have undergone constant evolution to the point where both the basic soft logic blocks that implement combinational logic and the fixed-function hard blocks contain complex interconnects, hierarchy and modes. The goal of this thesis is to both support that complexity and enable future architecture exploration of even increased complexity and new kinds of hard functionality. To accomplish this, a Computer-Aided Design (CAD) flow that can map a user circuit to an FPGA with these complex blocks is needed. We propose a new language that can describe these complex blocks and a new area-driven tool for the packing stage of that CAD flow. The packing stage groups components of a user circuit into the complex blocks available on the FPGA. We conduct experiments to illustrate the quality of the packing tool and to demonstrate the newly-enabled architecture exploration capabilities.

MAST

Advisors/Committee Members: Rose, Jonathan S., Anderson, Jason, Electrical and Computer Engineering.

Subjects/Keywords: FPGA; CAD; Packing; Clustering; Field-Programmable Gate Arrays; Computer-Aided Design; Architecture; 0544

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Luu, J. (2010). A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/24601

Chicago Manual of Style (16th Edition):

Luu, Jason. “A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs.” 2010. Masters Thesis, University of Toronto. Accessed September 26, 2020. http://hdl.handle.net/1807/24601.

MLA Handbook (7th Edition):

Luu, Jason. “A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs.” 2010. Web. 26 Sep 2020.

Vancouver:

Luu J. A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs. [Internet] [Masters thesis]. University of Toronto; 2010. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1807/24601.

Council of Science Editors:

Luu J. A Hierarchical Description Language and Packing Algorithm for Heterogenous FPGAs. [Masters Thesis]. University of Toronto; 2010. Available from: http://hdl.handle.net/1807/24601

2. Francetic, Nevena. Covering Arrays with Row Limit.

Degree: 2012, University of Toronto

Covering arrays with row limit, CARLs, are a new family of combinatorial objects which we introduce as a generalization of group divisible designs and covering arrays. In the same manner as their predecessors, CARLs have a natural application as combinatorial models for interaction test suites. A CARL(N;t,k,v:w), is an N×k array with some empty cells. A component, which is represented by a column, takes values from a v-set called the alphabet. In each row, there are exactly w non-empty cells, that is the corresponding components have an assigned value from the alphabet. The parameter w is called the row limit. Moreover, any N×t subarray contains every of v^t distinct t-tuples of alphabet symbols at least once. This thesis is concerned with the bounds on the size and with the construction of CARLs when the row limit w(k) is a positive integer valued function of the number of columns, k. Here we give a lower bound, and probabilistic and algorithmic upper bounds for any CARL. Further, we find improvements on the upper bounds when w(k)ln(w(k)) = o(k) and when w(k) is a constant function. We also determine the asymptotic size of CARLs when w(k) = Θ(k) and when w(k) is constant. Next, we study constructions of CARLs. We provide two combinatorial constructions of CARLs, which we apply to construct families of CARLs with w(k)=ck, where c<1. Also, we construct optimal CARLs when t=2 and w=4, and prove that there exists a constant δ, such that for any v and k≥4, an optimal CARL(2,k,v:4) differs from the lower bound by at most δ rows, with some possible exceptions. Finally, we define a packing array with row limit, PARL(N;t,k,v:w), in the same way as a CARL(N;t,k,v:w) with the difference that any t-tuple is contained at most once in any N×t subarray. We find that when w(k) is a constant function, the results on the asymptotic size of CARLs imply the results on the asymptotic size of PARLs. Also, when t=2, we consider a transformation of optimal CARLs with row limit w=3 to optimal PARLs with w=3.

PhD

Advisors/Committee Members: Mendelsohn, Eric, Mathematics.

Subjects/Keywords: group divisible designs; covering arrays; group divisible covering desings; graph covering problem; packing arrays; group divisible packing designs; 0405

…row limit four. Finally, we study a related family of objects called packing arrays with row… …of this problem. In Chapter 7 (Packing arrays with row limit with constant block size… …also define the packing version of the problem, that is, packing arrays with row limit, P… …divisible packing design 32 us 1 u2 K − DGDD of type (n, hu 1 h2 . . . hs ) double… …P ARL(N ; t, k, v : w) packing array with row limit for which all com- 31… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Francetic, N. (2012). Covering Arrays with Row Limit. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/34006

Chicago Manual of Style (16th Edition):

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Doctoral Dissertation, University of Toronto. Accessed September 26, 2020. http://hdl.handle.net/1807/34006.

MLA Handbook (7th Edition):

Francetic, Nevena. “Covering Arrays with Row Limit.” 2012. Web. 26 Sep 2020.

Vancouver:

Francetic N. Covering Arrays with Row Limit. [Internet] [Doctoral dissertation]. University of Toronto; 2012. [cited 2020 Sep 26]. Available from: http://hdl.handle.net/1807/34006.

Council of Science Editors:

Francetic N. Covering Arrays with Row Limit. [Doctoral Dissertation]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/34006

.