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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

693 篇 会议
181 篇 期刊文献
2 册 图书
1 篇 学位论文

馆藏范围

877 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

270 篇 工学
- 160 篇 电气工程
- 131 篇 计算机科学与技术...
- 70 篇 软件工程
- 30 篇 电子科学与技术（可...
- 24 篇 控制科学与工程
- 19 篇 信息与通信工程
- 14 篇 仪器科学与技术
- 13 篇 核科学与技术
- 7 篇 机械工程
- 6 篇 动力工程及工程热...
- 5 篇 力学（可授工学、理...
- 3 篇 测绘科学与技术
- 3 篇 石油与天然气工程
- 3 篇 生物医学工程（可授...
- 2 篇 航空宇航科学与技...
49 篇 理学
- 23 篇 物理学
- 17 篇 数学
- 7 篇 系统科学
- 5 篇 化学
- 2 篇 地球物理学
- 2 篇 生物学
- 2 篇 统计学（可授理学、...
21 篇 管理学
- 18 篇 管理科学与工程(可...
- 2 篇 工商管理
7 篇 医学
- 5 篇 临床医学
4 篇 经济学
- 3 篇 理论经济学
- 2 篇 应用经济学
4 篇 文学
- 4 篇 新闻传播学
3 篇 法学
- 2 篇 社会学
- 1 篇 法学
1 篇 教育学
1 篇 军事学
1 篇 艺术学

主题

877 篇 data flow comput...
174 篇 computer archite...
152 篇 concurrent compu...
152 篇 flow graphs
118 篇 hardware
113 篇 computer network...
110 篇 computational mo...
109 篇 computer science
108 篇 application soft...
107 篇 parallel process...
73 篇 processor schedu...
66 篇 algorithm design...
62 篇 distributed comp...
60 篇 control systems
56 篇 costs
56 篇 delay
53 篇 data analysis
47 篇 digital signal p...
46 篇 signal processin...
40 篇 programming prof...

机构

5 篇 department of el...
5 篇 department of co...
4 篇 computer science...
4 篇 polish japanese ...
3 篇 mitre corporatio...
3 篇 department of el...
3 篇 purdue universit...
3 篇 imec leuven
3 篇 institute of com...
3 篇 department of el...
3 篇 department of el...
3 篇 department of co...
3 篇 faculty of techn...
3 篇 department of co...
3 篇 stanford univ st...
3 篇 dipartimento di ...
2 篇 eecs department ...
2 篇 univ london impe...
2 篇 dipartimento di ...
2 篇 school of comput...

作者

5 篇 r.a. ammar
5 篇 e.a. lee
5 篇 g.r. gao
5 篇 j.w. stoughton
4 篇 m. tudruj
4 篇 b. zavidovique
4 篇 r.r. mielke
4 篇 s. som
4 篇 m.l. soffa
4 篇 m.j. harrold
3 篇 m. sami
3 篇 r.a. walker
3 篇 j. krinke
3 篇 raulet mickael
3 篇 palumbo francesc...
3 篇 a. smyk
3 篇 m.n.s. swamy
3 篇 sau carlo
3 篇 b. qin
3 篇 j. teich

语言

844 篇 英文
30 篇 其他
2 篇 中文
1 篇 俄文

检索条件"主题词=Data Flow Computing"

共 877 条记录，以下是371-380 订阅

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

详细简洁

排序：

Algorithmic aspects of uncertainty driven scheduling

Algorithmic aspects of uncertainty driven scheduling

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： S.O. Memik A. Srivastava E. Kursun M. Sarrafzadeh Computer Science Department University of California Los Angeles USA Computer Science Department University of California Los Angeles

In this paper we discuss the algorithmic aspects of uncertainty driven scheduling which is a new design paradigm. Slack oriented design flow could be used to address the uncertainty problem in high level synthesis. We formalize the concept of slack and discuss different variations of the slack driven scheduling problem. The complexity issues are studied in detail and algorithms are proposed to solve the problem. These algorithms and proofs heavily exploit the concepts and techniques of graph theory and combinatorial optimization problems.

关键词： Uncertainty Processor scheduling Clocks Timing Scheduling algorithm Cost function Robustness data flow computing flow graphs Computer science

来源：评论

学校读者我要写书评

暂无评论

Pancyclicity of Mobius cubes

Pancyclicity of Mobius cubes

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Wen-Tzeng Huang Woei-kae Chen Chin-Hsing Chen Department of Computer and Information Science National Taipei University of Technology Taipei Taiwan Department of Management Information System Chungtai Institute of Health Science and Technology Taichung Taiwan

ISBN: (纸本)0769517609

The problem of containing pancyclic interconnection networks is an important research topic. An n-dimensional Mobius cube, MQ/sub n/, is a variant of hypercubes according to specific rules. In this paper, we prove that Mobius cubes are all pancyclic networks. Similarly, both an n-dimensional crossed cube, CQ/sub n/, and an n-dimensional twisted cube, TQ/sub n/, are also variants of hypercubes according to specific rules. Moreover although the pancyclic property of a crossed cube and a twisted cube had been proved, we propose an alternative proof of this property.

关键词： Hypercubes Multiprocessor interconnection networks Network topology Circuit topology Token networks Local area networks Computer networks data flow computing Distributed computing Councils

来源：评论

学校读者我要写书评

暂无评论

Early evaluation techniques for low power binding

Early evaluation techniques for low power binding

引用

International Symposium on Low Power Electronics and Design (ISLPED)

作者： E. Kursun A. Srivastava S.G. Memik M. Sarrafzadeh Computer Science Department University of California Los Angeles CA USA

This paper presents effective metrics to evaluate the power dissipation of scheduled data flow graphs (DFGs). This enables early evaluation of schedules without performing the computationally expensive resource-binding step. Our metrics correlate heavily (as high as 0.95 and > 0.75 for most test cases) with power dissipation values obtained after resource binding and rescheduling for power optimization steps. An experimental flow that integrates path-based scheduling, power optimal binding and power driven iterative rescheduling stages is constructed. The flow integrates commercial tools; like Synopsys, VSS and academic compilers like SUIF in a common optimization framework. Experimental results on DFGs from MediaBench suit also demonstrate the fact that metric evaluation is on average 42.6 times faster than performing optimal binding and iterative power improvement. Hence metric based evaluation enables fast design exploration at early stages.

关键词： Power dissipation Processor scheduling Job shop scheduling Testing data flow computing Performance evaluation High level synthesis Design optimization Energy consumption Optimization methods

来源：评论

学校读者我要写书评

暂无评论

Microarchitectural support for precomputation microthreads

Microarchitectural support for precomputation microthreads

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： R.S. Chappell F. Tseng A. Yoaz Y.N. Patt EECS Department University of Michigan Ann Arbor MI USA ECE Department University of Texas Austin Austin TX USA Texas Development Center Intel Corporation Austin TX USA

Research has shown that precomputation microthreads can be useful for improving branch prediction and prefetching. However, it is not obvious how to provide the necessary microarchitectural support, and few details have been given in the literature. By judiciously constraining microthreads, we can easily adapt a superscalar machine to support many simultaneous microthreads. The nature of precomputation microthreads also requires efficient usage of resources. Our proposed implementation addresses this issue by dynamically identifying and aborting useless microthreads.

关键词： Microarchitecture Yarn Hardware Prefetching Electronic switching systems Computer architecture data flow computing Bandwidth Algorithm design and analysis Multithreading

来源：评论

学校读者我要写书评

暂无评论

A novel hybrid motion estimator supporting diamond search and fast full search

A novel hybrid motion estimator supporting diamond search an...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Wei-Min Chao Chih-Wei Hsu Yung-Chi Chang Liang-Gee Chen DSP/IC Design Laboratory Department of Electrical Engineering National Taiwan University Taiwan

ISBN: (纸本)0780374487

We present a novel hardware architecture supporting diamond search and fast full search for block matching motion estimation. It can handle irregular data flow of these fast algorithms without pipeline bubbles, and reduce computation of duplicated search positions. The proposed architecture needs preprocessing with a small amount of computational power while performing fast full search and is suitable for the platform-based video coding system. While the diamond search mode can be applied for real-time requirements, we can choose the fast full search mode, which adapts the processing cycles to picture contents and preserves the same quality of full search block matching (FSBM), for applications of high picture quality or compression ratio. It needs only 9K gates and one additional memory of search range size and is more cost-effective than the conventional systolic array architecture.

关键词： Motion estimation Systolic arrays Computer architecture Hardware Video coding Pipelines data flow computing Chaos Digital signal processing Power engineering computing

来源：评论

学校读者我要写书评

暂无评论

Integrating a computational model and a run time system for image processing on a UAV

Integrating a computational model and a run time system for ...

引用

Euromicro Symposium on Digital System Design

作者： P. Andersson K. Kuchcinski K. Nordberg P. Doherty Lunds University Lund Sweden Linkoping University Sweden

Recently substantial research has been devoted to Unmanned Aerial Vehicles (UAVs). One of a UAV's most demanding subsystem is vision. The vision subsystem must dynamically combine different algorithms as the UAVs goal and surrounding change. To fully utilize the available hardware, a run time system must be able to vary the quality and the size of regions the algorithms are applied to, as the number of image processing tasks changes. To allow this the run time system and the underlying computational model must be integrated. In this paper we present a computational model suitable for integration with a run time system. The computational model is called Image Processing data flow Graph (IP-DFG). IP-DFG has been developed for modeling of complex image processing algorithms. IP-DFG is based on data flow graphs, but has been extended with hierarchy and new rules for token consumption, which makes the computational model more flexible and more suitable for human interaction. In this paper we also show that IP-DFGs are suitable for modelling expressions, including data dependent decisions and iterations, which are common in complex image processing algorithms.

关键词： Computational modeling Image processing Unmanned aerial vehicles Helicopters Educational institutions data flow computing Humans Heuristic algorithms flow graphs Machine vision

来源：评论

学校读者我要写书评

暂无评论

Supporting a multicast communication for large scale groups

Supporting a multicast communication for large scale groups

引用

Mediterranean Electrotechnical Conference (MELECON)

作者： M.N. El-Derini H.H. Aly M.A. Yassin Computers & Automatic Control Department Alexandria University Egypt

Recently, there has been a growing interest in multicast communication, in which a group of applications works together and a multicast message is sent to only the members of the desired group. New multicast algorithms are required to increase the efficiency of multicast communication. Current multicast algorithms, such as the source-based tree algorithms, become inefficient, especially in the case of large-scale groups, due to the large amount of stored data. The shared based tree (SBT) algorithms are more efficient than the source-based tree algorithms, because they use a single spanning tree shared by all members. But in case of large groups, these algorithms do not try to make use of the large size to reduce the total overhead of sending messages. We present a mechanism belonging to the SBT family to enhance the performance of multicast communication over large scale multicast groups.

关键词： Multicast communication Large-scale systems Multicast algorithms Multicast protocols Algorithm design and analysis Automatic control Application software Routing protocols Scalability data flow computing

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable SoC design with hierarchical FSM and synchronous dataflow model 02

Reconfigurable SoC design with hierarchical FSM and synchron...

引用

Proceedings of the tenth international symposium on Hardware/software codesign

作者： Sunghyun Lee Sungjoo Yoo Kiyoung Choi Seoul National Univ. Seoul Korea TIMA Lab. 46 Avenue Felix Viallet 38031 Grenoble France Seoul National Univ. Seoul 151-742 Korea

ISBN: (纸本)9781581135428

We present a method of runtime configuration scheduling in reconfigurable SoC design. As a model of computation in system representation, we use a popular formal model of computation, hierarchical FSM (HFSM) with synchronous dataflow (SDF) model, in short HFSM-SDF model. In reconfigurable SoC design with the HFSM-SDF model, the problem of configuration scheduling is challenging due to the dynamic behavior of the system such as concurrent execution of state transitions (by AND relation), complex flow (in the HFSM), and complex schedules of SDF actor firing. Thus, compile-time static configuration scheduling may not efficiently hide configuration *** resolve the problem, it is necessary to know the exact order of required configurations during runtime and to perform runtime configuration scheduling. To obtain the exact order of configuration, we exploit the inherent property of HFSM-SDF that the execution order of SDF actors can be determined before the execution of state transition of top FSM. After obtaining the order information in a queue called ready configuration queue, we execute the state transition. During the execution, whenever there is new available FPGA resource, a new configuration is selected from the queue and fetched by the runtime configuration scheduler. We applied the method to an MPEG4 decoder design and obtained up to 21.8% improvement in system runtime with a negligible overhead of runtime (1.4%) and memory usage (0.94%).

关键词： reconfigurable architectures data flow computing field programmable gate arrays runtime configuration scheduling reconfigurable SoC design system representation formal model synchronous dataflow model configuration scheduling dynamic behavior state transitions order information ready configuration queue FPGA resource MPEG4 decoder design

来源：评论

学校读者我要写书评

暂无评论

Optimal code size reduction for software-pipelined and unfolded loops

Optimal code size reduction for software-pipelined and unfol...

引用

International Symposium on System Synthesis

作者： Qingfeng Zhuge Bin Xiao Zili Shao E.H.-M. Sha Chantana Chantrapornchai Department of Computer Science University of Texas Dallas Richardson TX USA Faculty of Science Silpakorn University Nakhon Pathom Thailand

ISBN: (纸本)1581135769

Software pipelining and unfolding are commonly used techniques to increase parallelism for DSP applications. However, these techniques expand the code size of the application significantly. For most DSP systems with limited memory resources, code size becomes one of the most critical concerns for the high-performance applications. In this paper, we present the code size reduction theory based on retiming and unfolding concepts. We propose a code size reduction framework to achieve the optimal code size of software-pipelined and unfolded loops by using conditional registers. The experimental results on several well-known benchmarks show the effectiveness of our code size reduction technique in controlling the code size of optimized loops.

关键词： flow graphs data flow computing Processor scheduling Pipeline processing Delay effects Law Legal factors Application software Constraint optimization Memory management

来源：评论

学校读者我要写书评

暂无评论

dataflow frequency analysis based on whole program paths

Dataflow frequency analysis based on whole program paths

引用

International Conference on Parallel Architecture and Compilation Techniques (PACT)

作者： B. Scholz E. Mehofer Institute of Computer Languages University of Technology Vienna Vienna Austria Institute for Software Science University of Technology Vienna Vienna Austria

Efficient use of machine resources in high-performance computer systems requires highly optimizing compilers with sophisticated analyses. Static analysis often fails to identify frequently executed portions of a program which are the places where optimizations achieve the greatest benefit. This paper introduces a novel data flow frequency analysis framework that computes the frequency with which a data flow fact will hold at some program point based on profiling information. Several approaches which approximate the frequencies based on k-edge profiling have been presented. However, no feasible approach for obtaining the accurate solution exists so far. Recently, efficient techniques for recording whole program paths (WPPs) have been developed. Our approach for computing data flow frequencies results in an accurate solution and utilizes WPPs to obtain the solution in reasonable time. In our experiments we show that the execution time of WPP-based frequency analysis is in case of the SPEC benchmark suite only a fraction of the overall compilation time.

关键词： Frequency data analysis data flow computing Instruments Information analysis Optimizing compilers Feedback History Open loop systems Computer languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：