检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

779 篇 会议
30 篇 期刊文献

馆藏范围

809 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

635 篇 工学
- 529 篇 计算机科学与技术...
- 314 篇 软件工程
- 250 篇 电子科学与技术（可...
- 201 篇 电气工程
- 88 篇 信息与通信工程
- 52 篇 控制科学与工程
- 32 篇 动力工程及工程热...
- 31 篇 机械工程
- 24 篇 仪器科学与技术
- 16 篇 生物工程
- 11 篇 冶金工程
- 10 篇 建筑学
- 10 篇 土木工程
- 10 篇 化学工程与技术
- 9 篇 光学工程
- 8 篇 材料科学与工程（可...
- 8 篇 生物医学工程（可授...
- 3 篇 农业工程
228 篇 理学
- 172 篇 数学
- 47 篇 物理学
- 20 篇 统计学（可授理学、...
- 17 篇 生物学
- 10 篇 系统科学
- 8 篇 化学
55 篇 管理学
- 47 篇 管理科学与工程(可...
- 30 篇 工商管理
- 9 篇 图书情报与档案管...
14 篇 经济学
- 14 篇 应用经济学
14 篇 医学
- 13 篇 特种医学
11 篇 法学
- 9 篇 社会学
3 篇 农学
2 篇 教育学
1 篇 文学

主题

433 篇 field programmab...
232 篇 field programmab...
46 篇 hardware
32 篇 fpga
30 篇 clocks
28 篇 computer archite...
21 篇 table lookup
21 篇 delays
17 篇 random access me...
16 篇 routing
16 篇 software
15 篇 switches
12 篇 digital signal p...
11 篇 throughput
11 篇 system-on-chip
11 篇 algorithm design...
10 篇 multiplexing
10 篇 logic gates
10 篇 bandwidth
10 篇 educational inst...

机构

6 篇 univ of toronto ...
5 篇 school of comput...
5 篇 university of to...
5 篇 univ of toronto
5 篇 univ of californ...
5 篇 altera corporati...
4 篇 univ british col...
4 篇 nanyang technol ...
4 篇 dept. of cs 256-...
4 篇 department of el...
4 篇 state key lab of...
4 篇 intel corporatio...
3 篇 computer science...
3 篇 department of ee...
3 篇 department of el...
3 篇 department of el...
3 篇 xilinx inc. san ...
3 篇 technical univer...
3 篇 northwestern uni...
3 篇 nanyang technolo...

作者

20 篇 cong jason
19 篇 rose jonathan
11 篇 betz vaughn
10 篇 wawrzynek john
9 篇 dehon andré
9 篇 hauck scott
9 篇 zhang zhiru
8 篇 chen deming
7 篇 wilton steven j....
7 篇 schmit herman
7 篇 constantinides g...
7 篇 chow paul
7 篇 langhammer marti...
6 篇 cheung peter y. ...
6 篇 wilton steven j....
6 篇 pasca bogdan
6 篇 li fei
6 篇 prasanna viktor ...
5 篇 jason cong
5 篇 fahmy suhaib a.

语言

798 篇 英文
6 篇 其他
4 篇 中文
1 篇 西班牙文

检索条件"任意字段=2013 ACM/SIGDA International Symposium on Field Programmable Gate Arrays, FPGA 2013"

共 809 条记录，以下是151-160 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

OmpSs@zynq all-programmable soc ecosystem

OmpSs@zynq all-programmable soc ecosystem

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Filgueras, Antonio Gil, Eduard Jimenez-Gonzalez, Daniel Alvarez, Carlos Martorell, Xavier Langer, Jan Noguera, Juanjo Vissers, Kees Barcelona Supercomputing Center Spain Universitat Politecnica de Catalunya Spain Xilinx Research Lab United States

ISBN: (纸本)9781450326711

OmpSs is an OpenMP-like directive-based programming model that includes heterogeneous execution (MIC, GPU, SMP, etc.) and runtime task dependencies management. Indeed, OmpSs has largely inuenced the recently appeared OpenMP 4.0 specication. Zynq All-programmable SoC combines the features of a SMP and a fpga and benets DLP, ILP and TLP parallelisms in order to eciently exploit the new tech-nology improvements and chip resource capacities. In this paper, we focus on programmability and heterogeneous ex-ecution support, presenting a successful combination of the OmpSs programming model and the Zynq All-programmable SoC platforms.

关键词： System-on-chip

来源：评论

学校读者我要写书评

暂无评论

Wordwidth, instructions, looping, and virtualization the role of sharing in absolute energy minimization 14

Wordwidth, instructions, looping, and virtualization the rol...

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： DeHon, André Department of Electrical and Systems Engineering University of Pennsylvania 200 S. 33rd St. Philadelphia PA 19104 United States

ISBN: (纸本)9781450326711

When are fpgas more energy ecient than processors? This question is complicated by technology factors and the wide range of application characteristics that can be ex-ploited to minimize energy. Using a wire-dominated en-ergy model to estimate the absolute energy required for pro-grammable computations, we determine when spatially or-ganized programmable computations (fpgas) require less energy than temporally organized programmable computa-tions (processors). The point of crossover will depend on the metal layers available, the locality, the SIMD wordwidth regularity, and the compactness of the instructions. When the Rent Exponent, p, is less than 0.7, the spatial design is always more energy ecient. When p = 0:8, the technology oers 8-metal layers for routing, and data can be organized into 16b words and processed in tight loops of no more than 128 instructions, the temporal design uses less energy when the number of LUTs is greater than 64K. We further show that heterogeneous multicontext architectures can use even less energy than the p = 0:8, 16b word temporal case.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

Square-rich fixed point polynomial evaluation on fpgas 14

Square-rich fixed point polynomial evaluation on FPGAs

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Xu, Simin Fahmy, Suhaib A. McLoughlin, Ian V. Xilinx Asia Pacific Singapore School of Computer Engineering Nanyang Technological University Singapore School of Information Science and Technology University of Science and Technology of China China

ISBN: (纸本)9781450326711

Polynomial evaluation is important across a wide range of application domains, so signicant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to increased latency due to serial com-putation. Parallel evaluation algorithms such as Estrin's method have shorter latency than Horner's rule, but achieve this at the expense of large hardware overhead. This paper presents an effcient polynomial evaluation algorithm, which reforms the evaluation process to include an increased num-ber of squaring steps. By using a squarer design that is more effcient than general multiplication, this can result in polynomial evaluation with a 57.9% latency reduction over Horner's rule and 14.6% over Estrin's method, while consuming less area than Horner's rule, when implemented on a Xilinx Virtex 6 fpga. When applied in fixed point function evaluation, where precision requirements limit the rounding of operands, it still achieves a 52.4% performance gain compared to Horner's rule with only a 4% area overhead in evaluating 5th degree polynomials.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

A fpga prototype design emphasis on low power technique 14

A FPGA prototype design emphasis on low power technique

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Hanyang, Xu Jian, Wang Jinmei, Lai Fudan University No.825 Zhangheng Rd shanghai China

ISBN: (纸本)9781450326711

In this paper, we propose a fully-functional Nanometer fpga prototype chip. Compared to traditional single supply voltage, single threshold voltage design, we explore low power nanometer fpga design challenges with Multi-Vt, Static Voltage Scaling and sleep mode technique. Compared to Dynamic Voltage Scaling (DVS), we make a table of Voltage-Delay parameter pairs under different voltage conditions so that timing information can be calculated by a Static Timing Analysis (STA) tool. Thus a lowest supply power is chosen among all results which meet the timing requirements. This approach would simplify the hardware design since we don't need a complex workload detection circuit compared to DVS system. By separating supply voltages, we can directly shutdown power supply of the unused circuits. Compared to inserting sleep transistor in pull-up or pull-down networks, we can eliminate the speed penalty cased by the additional sleep transistor. We implement a tile-based heterogeneous architecture with island style routing and embedded specific blocks such as DSP and memory. The array size is 6431 (RowCol) including 6424 CLBs. The final design is fabricated using a 1P10M 65-nm bulk CMOS process. Test results show a 53% reduction in static power compared to a commercial fpga device which is also fabricated in 65nm process and has a similar array size.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

A scalable sparse matrix-vector multiplication kernel for energy-efficient sparse-blas on fpgas 14

A scalable sparse matrix-vector multiplication kernel for en...

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Dorrance, Richard Ren, Fengbo Marković, Dejan EE Department UCLA Los Angeles CA 90095 United States

ISBN: (纸本)9781450326711

Sparse Matrix-Vector Multiplication (SpMxV) is a widely used mathematical operation in many high-performance scientific and engineering applications. In recent years, tuned software libraries for multi-core microprocessors (CPUs) and graphics processing units (GPUs) have become the status quo for computing SpMxV. However, the computational throughput of these libraries for sparse matrices tends to be significantly lower than that of dense matrices, mostly due to the fact that the compression formats required to efficiently store sparse matrices mismatches traditional computing architectures. This paper describes an fpga-based SpMxV kernel that is scalable to efficiently utilize the available memory bandwidth and computing resources. Benchmarking on a Virtex-5 SX95T fpga demonstrates an average computational efficiency of 91.85%. The kernel achieves a peak computational efficiency of 99.8%, a >50x improvement over two Intel Core i7 processors (i7-2600 and i7-4770) and showing a >300x improvement over two NVIDA GPUs (GTX 660 and GTX Titan), when running the MKL and cuSPARSE sparse-BLAS libraries, respectively. In addition, the SpMxV fpga kernel is able to achieve higher performance than its CPU and GPU counterparts, while using only 64 single-precision processing elements, with an overall 38-50x improvement in energy efficiency.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

Hardware acceleration of database operations 14

Hardware acceleration of database operations

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Casper, Jared Olukotun, Kunle Pervasive Parallelism Laboratory Stanford University United States

ISBN: (纸本)9781450326711

As the amount of memory in database systems grows, en-tire database tables, or even databases, are able to t in the system's memory, making in-memory database operations more prevalent. This shift from disk-based to in-memory database systems has contributed to a move from row-wise to columnar data storage. Furthermore, common database workloads have grown beyond online transaction process-ing (OLTP) to include online analytical processing and data mining. These workloads analyze huge datasets that are of-ten irregular and not indexed, making traditional database operations like joins much more expensive. In this paper we explore using dedicated hardware to ac-celerate in-memory database operations. We present hard-ware to accelerate the selection process of compacting a sin-gle column into a linear column of selected data, joining two sorted columns via merging, and sorting a column. Finally, we put these primitives together to accelerate an entire join operation. We implement a prototype of this system using fpgas and show substantial improvements in both absolute throughput and utilization of memory bandwidth. Using the prototype as a guide, we explore how the hardware resources required by our design change with the desired throughput.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

fpga place & route challenges 14

FPGA place & route challenges

引用

2014 acm international symposium on Physical Design, ISPD 2014

作者： Aggarwal, Rajat Xilinx Inc 2100 Logic Dr San Jose CA 95124 United States

In this paper, we describe the challenges that Place and Route tools face to implement the user designs on modern fpgas while meeting the timing and power constraints.

ISBN: (纸本)9781450325929

In this paper, we describe the challenges that Place and Route tools face to implement the user designs on modern fpgas while meeting the timing and power constraints.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

CAD and routing architecture for interposer-based multi-fpga systems 14

CAD and routing architecture for interposer-based multi-FPGA...

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Pereira, Andre Hahn Betz, Vaughn Computer and Digital Systems Engineering Department-Escola Politécnica University of São Paulo São Paulo SP Brazil Department of Electrical and Computer Engineering University of Toronto Toronto ON Canada

ISBN: (纸本)9781450326711

Interposer-based multi-fpga systems are composed of mul-tiple fpga dice connected through a silicon interposer. Such devices allow larger fpga systems to be built than one monolithic die can accomodate and are now commercially available. An open question, however, is how efficient such systems are compared to a monolithic fpga, as the num-ber of signals passing between dice is reduced and the signal delay between dice is increased in an interposer system vs. a monolithic fpga. We create a new version of VPR to investigate the archi-tecture of such systems, and show that by modifying the placement cost function to minimize the number of signals that must cross between dice we can reduce routing demand by 18% and delay by 2%. We also show that the signal count between dice and the signal delay between dice are key archi-tecture parameters for interposer-based fpga systems. We find that if an interposer supplies (between dice) 60% of the routing capacity that the normal (within-die) fpga routing channels supply, there is little impact on the routability of circuits. Smaller routing capacities in the interposer do im-pact routability however: minimum channel width increases by 20% and 50% when an interposer supplies only 40% and 30% of the within-die routing, respectively. The interposer also impacts delay, increasing circuit delay by 34% on aver-age for a 1 ns interposer signal delay and a four-die system. Reducing the interposer delay has a greater benefit in im-proving circuit speed than does reducing the number of dice in the system.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

MPack: Global memory optimization for stream applications in high-level synthesis 14

MPack: Global memory optimization for stream applications in...

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Vasiljevic, Jasmina Chow, Paul Department of Electrical and Computer Engineering University of Toronto 10 King's College Road Toronto ON M5S 3G4 Canada

ISBN: (纸本)9781450326711

One of the challenges in designing high-performance fpga applications is fine-tuning the use of limited on-chip memory storage among many buffers in an application. To achieve desired performance the designer faces the burden of packaging such buffers into on-chip memories and manually optimizing the utilization of each memory and the throughput of each buffer. In addition, the application memories may not match the word width or depth of the physical on-chip memories available on the fpga. This process is time consuming and non-trivial, particularly with a large number of buffers of various depths and bit widths. We propose a tool, MPack, which globally optimizes on-chip memory use across all buffers for stream applications. The goal is to speed up development time by providing rapid design space exploration and relieving the designer of lengthy low-level iterations. We introduce new high-level pragmas allowing the user to specify global memory requirements, such as an application's on-chip memory budget and data throughput. We allow the user to quickly generate a large number of memory solutions and explore the trade-off between memory usage and achievable throughput. To demonstrate the effectiveness of our tool, we apply the new high-level pragmas to an image processing benchmark. MPack effectively explores the design space and is able to produce a large number of memory solutions ranging from 10 to 100% in throughput, and from 12 to 100% in on-chip memory usage.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

Towards interconnect-adaptive packing for fpgas 14

Towards interconnect-adaptive packing for FPGAs

引用

2014 acm/sigda international symposium on field programmable gate arrays, fpga 2014

作者： Luu, Jason Rose, Jonathan Anderson, Jason Dept. Electrical and Computer Engineering University of Toronto Toronto ON Canada

ISBN: (纸本)9781450326711

In order to investigate new fpga logic blocks, fpga ar-chitects have traditionally needed to customize CAD tools to make use of the new features and characteristics of those blocks. The software development effort necessary to cre-ate such CAD tools can be a time-consuming process that can significantly limit the number and variety of architec-tures explored. Thus, architects want flexible CAD tools that can, with few or no software modifications, explore a diverse space. Existing flexible CAD tools suffer from im-practically long runtimes and/or fail to efficiently make use of the important new features of the logic blocks being in-vestigated. This work is a step towards addressing these concerns by enhancing the packing stage of the open-source VTR CAD flow [17] to efficiently deal with common inter-connect structures that are used to create many kinds of use-ful novel blocks. These structures include crossbars, carry chains, dedicated signals, and others. To accomplish this, we employ three techniques in this work: speculative packing , pre-packing, and interconnect-aware pin counting. We show that these techniques, along with three minor modi-fications, result in improvements to runtime and quality of results across a spectrum of architectures, while simultane-ously expanding the scope of architectures that can be ex-plored. Compared with VTR 1.0 [17], we show an average 12-fold speedup in packing for fracturable LUT architectures with 20% lower minimum channel width and 6% lower crit-ical path delay. We obtain a 6 to 7-fold speedup for archi-tectures with non-fracturable LUTs and architectures with depopulated crossbars. In addition, we demonstrate packing support for logic blocks with carry chains.

关键词： field programmable gate arrays (fpga)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共81页 << < 12 13 14 15 16 17 18 19 20 21 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：