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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是161-170 订阅

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

详细简洁

排序：

On the impact of fault list partitioning in parallel implementations for dynamic test compaction considering multicore systems

On the impact of fault list partitioning in parallel impleme...

引用

8th ieee International Design and Test symposium (IDT)

作者： Neophytou, Stelios Hadjitheophanous, Stavros Michael, Maria K. Univ Nicosia KIOS Res Ctr Intelligent Syst & Networks Dept Elect Commun Engn CY-1678 Nicosia Cyprus Univ Cyprus KIOS Res Ctr Intelligent Syst & Networks Dept Elect Commun Engn CY-1678 Nicosia Cyprus

ISBN: (纸本)9781479935253

Modern multicore systems have multiplied the processing power of computing systems, increasing the potential of solving difficult EDA problems. At the same time, careful decomposition of the problem should be made in order to explore the parallelism without compromising the quality of the result with respect to the existing non-parallel solutions. Test. set compaction is one of the major EDA problems that is NPhard and a crucial component of any ATPG methodology. this paper presents a study on the effect of fault list partitioning on a dynamic test set compaction algorithm that has shown to give very good results when considering the entire fault list. the serial algorithm is executed in different subsets of the considered fault list and the obtained results are evaluated in terms of the compaction achieved as well as the execution time. the experimental results demonstrate that the partitioning technique used highly affects the compaction quality while the execution time is significantly reduced.

关键词： fault dictionary execution time compaction dynamic testing Multi-core processors processing power

来源：评论

学校读者我要写书评

暂无评论

Multi-ASIP Platform Synthesis for Real-Time Applications

Multi-ASIP Platform Synthesis for Real-Time Applications

引用

8th ieee International symposium on Industrial Embedded Systems (SIES)

作者： Micconi, Laura Gangadharan, Deepak Pop, Paul Madsen, Jan Tech Univ Denmark DK-2800 Lyngby Denmark

ISBN: (纸本)9781479906581

In this paper we are interested in deriving a distributed platform, composed of heterogeneous processing elements, targeted to applications that have strict timing constraints. We consider that the platform may use multiple Application Specific Instruction Set Processors (ASIPs). An ASIP is synthesized and tuned for a specific set of tasks (i.e., a task cluster). During design space exploration (DSE), we evaluate each platform solution visited in terms of its cost and performance, i.e., its ability to execute the applications such that they meet their timing constraints. To determine if the applications are schedulable, we have to know the worst-case execution time (WCET) of each task. However, we can determine the WCETs only after the ASIPs are synthesized, which is time consuming and therefore cannot be done during DSE. To address this circular dependency (the ASIPs depend on the task clustering, and the WCETs of tasks, used to determine schedulability, depend on how ASIPs are synthesized), we propose an uncertainty model for the WCETs, which captures the range of possible ASIP implementations. Based on this model, we synthesize a multi-ASIP platform, such that the applications have a high chance of being schedulable and the cost constraints imposed on the platform are fulfilled. We propose an Evolutionary Algorithm-based approach, which uses a novel stochastic schedulability analysis to solve this optimization problem. the proposed approach has been evaluated using several benchmarks.

关键词： distributed processing evolutionary computation multiprocessing systems scheduling

来源：评论

学校读者我要写书评

暂无评论

Design Space Exploration of High Level Stream Programs on parallel Architectures: a focus on the Buffer Size Minimization and Optimization Problem

Design Space Exploration of High Level Stream Programs on Pa...

引用

8th International symposium on Image and Signal processing and Analysis (ISPA)

作者： Brunet, Simone Casale Alberti, Claudio Mattavelli, Marco Janneck, Jorn W. Ecole Polytech Fed Lausanne SCI STI MM CH-1015 Lausanne Switzerland

ISBN: (纸本)9789531841948;9789531841870

this paper presents a dataflow design methodology and an associated co-exploration environment, focusing on the optimization of buffer sizes. the approach is applicable to dynamic dataflow designs and its performance is presented and validated by experimental results on the porting of an MPEG-4 Simple Profile decoder to the STM SthORM manycore platform. For the purpose of this work, the decoder has been written using the RVC-CAL dataflow language standardized by ISO/IEC. Starting from this high-level representation it is demonstrated how the buffer size configuration can be optimized, based on a novel buffer size minimization algorithm suitable for a very general class of dataflow programs.

关键词： dataflow co-exploration and optimization

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware Fully Decentralized Service Assembly

QoS-Aware Fully Decentralized Service Assembly

引用

8th International symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)

作者： Grassi, Vincenzo Marzolla, Moreno Mirandola, Raffaela Univ Roma Tor Vergata Dip Ingn Civile & Ingn Informat I-00173 Rome Italy

ISBN: (纸本)9781467344012

Large, distributed software systems are increasingly common in today geographically distributed IT infrastructures. A key challenge for the software engineering community is how to efficiently and effectively manage such complex systems. Extending software services with autonomic capabilities has been suggested as a possible way to address this challenge. Ideally, self-management capabilities should be based on fully distributed, peer-to-peer (P2P) architectures in order to try to overcome the scalability and robustness problems of centralized solutions. Within this context, we propose an approach for the adaptive self-assembly of distributed services, based on a simple epidemic protocol. Our approach is based on the three-layer reference model for adaptive systems, and is centered on the use of a gossip protocol to achieve decentralized information dissemination and decision making. the goal of our system is to build and maintain an assembly of services that, besides functional requirements, is able to fulfill global quality of service (QoS) and structural requirements. A set of simulation experiments is used to assess the effectiveness of our approach in terms of convergence speed towards the optimal solution, and resilience to failures.

关键词： distributed processing peer-to-peer computing protocols quality of service software architecture

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm for approximate string matching with K differences

Parallel algorithm for approximate string matching with K di...

引用

2013 ieee 8th International Conference on Networking, Architecture and Storage, NAS 2013

作者： Guo, Longjiang Du, Shufang Ren, Meirui Liu, Yu Li, Jinbao He, Jing Tian, Ning Li, Keqin Heilongjiang University School of Computer Science and Technology Harbin 150080 China Key Laboratory of Database and Parallel Computing Heilongjiang China Kennesaw State University Department of Computer Science Kennesaw GA 30144 United States State University of New York Department of Computer Science New Paltz NY 12561 United States

ISBN: (纸本)9780769550343

Approximate string matching using the k-difference technique has been widely applied to many fields such as pattern recognition and computational biology. Data dependency exists in the traditional sequential algorithm. therefore, it is hard to design a parallel algorithm for approximate string matching with k differences. this paper presents a technique to eliminate data dependency. Based on this technique, this paper also presents a parallel algorithm which can calculate the elements in the same row of the edit distance matrix in parallel by eliminating data dependency. the algorithm has high parallelism, but requires synchronization. To validate the proposed algorithm, it is implemented on GPU and multiple-core CPUs. Moreover, the CUDA optimization techniques are also presented in the paper. Finally, experimental results show that, compared with the traditional sequential algorithm on CPU with twenty-four cores, the proposed parallel algorithm achieves speedup of 7-42 on GPU. © 2013 ieee.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Contributions to Visualization Algorithm Enabling GPU-Accelerated Image Displaying for Dual Panel High Dynamic Range LCD Display

Contributions to Visualization Algorithm Enabling GPU-Accele...

引用

8th International symposium on Image and Signal processing and Analysis (ISPA)

作者： Szydzik, Tomasz Nunez, Antonio de Paepe, Lode Albani, Luigi Univ Las Palmas Gran Canaria Inst Appl Microelect E-35017 Las Palmas Gran Canaria Spain FIMI Srl BARCO Co Healthcare Div Saronno Italy

ISBN: (纸本)9789531841948;9789531841870

High dynamic range displays based on dual panel LCD are a viable option for building a low-cost solution for providing high bit depth visualization systems. One of the factors limiting the usability of this type of displays are the computation requirements of the algorithm necessary for correct visualization using the two stacked panels. In this work we present the methodology and the results of mapping this algorithm on a CPU+GPU platform using the OpenCL 1.1 API. Visualization of a 2048x2048 image when executed on a CPU+GPU (AMD Radeon V7800) platform is performed up to 7.6 times faster then when only the CPU is used. the first results are promising and encourage the use of GPUs (or APUs) for acceleration of this kind of processing.

关键词： visualization dual-panel displays parallel computing OpenCL optimization methods GPU medicine

来源：评论

学校读者我要写书评

暂无评论

Evaluation of parallel Window-Join Algorithms for Reduction of processing Delay

Evaluation of Parallel Window-Join Algorithms for Reduction ...

引用

8th International Conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Watanabe, Yousuke Yokota, Haruo Tokyo Inst Technol Global Sci Informat & Comp Ctr Meguro Ku 2-12-1 Oh Okayama Tokyo 152 Japan Tokyo Inst Technol Grad Sch Informat Sci & Engn Tokyo 152 Japan

ISBN: (纸本)9780769550947

the number of stream-based information sources is increasing, so query processing on streams is getting more important. Window-join is one of typical operations for stream data processing. It uses sliding-windows to keep recent input tuples, and generate the join result from the tuples in the window. To reduce processing cost of window-join, some parallel window-join algorithms have been proposed in the context of distributed environments. their main objectives are increasing throughput. they do not concern about reducing processing delay, because delay caused network transfer is unavoidable in distributed environments. In our research, we focus on reducing processing delay of window-join by using multi-core environments instead of distributed environments. We propose and evaluate two parallel window-join algorithms for multiple input streams. the first one is parallel Tree-based Join, which makes multiple cores execute multiple join trees with different join orders. Each join tree is optimized to minimize processing delay for tuples from one stream. Another is parallel MJoin, which is an extension of existing MJoin algorithm. parallel MJoin concurrently performs multiple probe processes instead of sequential probe used in original MJoin. this paper also includes experimental evaluation to investigate efficiency of two methods.

关键词： data streams window join parallel processing multi cores

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2013 ieee 8th International Conference on Networking, Architecture and Storage, NAS 2013

Proceedings - 2013 IEEE 8th International Conference on Netw...

引用

2013 ieee 8th International Conference on Networking, Architecture and Storage, NAS 2013

ISBN: (纸本)9780769550343

the proceedings contain 51 papers. the topics discussed include: McDisc: a reliable neighbor discovery protocol in low duty cycle and multi-channel wireless networks;e-HiLow: extended hierarchical routing protocol in 6LoWPAN wireless sensor network;a HW/SW co-design of execution migration for shared-ISA heterogeneous chip multiprocessors;spontaneous reload cache: mimicking a larger cache with minimal hardware requirement;improve effective capacity and lifetime of solid state drives;a new metadata update method for fast recovery of SSD cache;a mechanism of maintaining the survivability of streaming media service in overlay networks;a specific scheme for rate-controlled smooth scheduling based on timeslot-iteration;MCD: overcoming the data download bottleneck in data centers;PEAM: predictive energy-aware management for storage systems;and DynaM: dynamic multiresolution data representation for large-scale scientific analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient transactions for parallel data movement

Efficient transactions for parallel data movement

引用

8th parallel Data Storage Workshop, PDSW 2013 - Held in Conjunction with the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2013

作者： Lofstead, Jay Dayal, Jai Jimenez, Ivo Maltzahn, Carlos Sandia National Laboratories United States Georgia Institute of Technology United States University of California Santa Cruz CA United States

ISBN: (纸本)9781450325059

the rise of Integrated Application Workflows (IAWs) for processing data prior to storage on persistent media prompts the need to incorporate features that reproduce many of the semantics of persistent storage devices. One such feature is the ability to manage data sets as chunks with natural barriers between different data sets. Towards that end, we need a mechanism to ensure that data moved to an intermediate storage area is both complete and correct before allowing access by other processing components. the Doubly distributed Transactions (D2T) protocol offers such a mechanism. the initial development [9] suffered from scalability limitations and undue requirements on server processes. the current version has addressed these limitations and has demonstrated scalability with low overhead. © 2013 ACM.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Dist-RIA Crawler: A distributed Crawler for Rich Internet Applications

Dist-RIA Crawler: A Distributed Crawler for Rich Internet Ap...

引用

8th International Conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Mirtaheri, Seyed M. Zou, Di Bochmann, Gregor V. Jourdan, Guy-Vincent Onut, Iosif Viorel Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON Canada IBM Corp Secur AppScan Enterprise Ottawa ON Canada

ISBN: (纸本)9780769550947

Crawling web applications is important for indexing, accessibility and security assessment. Crawling traditional web applications is an old problem, as old as the web itself. Crawling Rich Internet Applications (RIA) quickly and efficiently, however, is an open problem. Technologies such as AJAX and partial Document Object Model (DOM) updates only makes the problem of crawling RIA more time consuming to the web crawler. To reduce the time to crawl a RIA, this paper presents a new distributed algorithm to crawl a RIA in parallel with multiple computers, called Dist-RIA Crawler. Dist-RIA Crawler uses the JavaScript (R) events in the DOM structure to partition the search space. this paper illustrates a prototype implementation of Dist-RIA Crawler and inspect empirical performance measurements.

关键词： distributed Systems parallel processing Rich Internet Applications Web Crawling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：