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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,503 篇 会议
108 篇 期刊文献

馆藏范围

1,611 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,171 篇 工学
- 1,114 篇 计算机科学与技术...
- 557 篇 软件工程
- 118 篇 电气工程
- 75 篇 信息与通信工程
- 46 篇 控制科学与工程
- 37 篇 电子科学与技术（可...
- 13 篇 材料科学与工程（可...
- 13 篇 农业工程
- 11 篇 机械工程
- 11 篇 光学工程
- 8 篇 化学工程与技术
- 8 篇 生物工程
- 7 篇 建筑学
- 7 篇 生物医学工程（可授...
- 6 篇 动力工程及工程热...
- 5 篇 土木工程
- 3 篇 力学（可授工学、理...
582 篇 理学
- 560 篇 数学
- 55 篇 统计学（可授理学、...
- 16 篇 物理学
- 9 篇 生物学
- 9 篇 系统科学
- 8 篇 化学
73 篇 管理学
- 64 篇 管理科学与工程(可...
- 40 篇 工商管理
- 10 篇 图书情报与档案管...
16 篇 农学
- 16 篇 作物学
6 篇 经济学
- 6 篇 应用经济学
3 篇 法学
- 3 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 医学
1 篇 文学
1 篇 军事学

主题

237 篇 parallel algorit...
173 篇 parallel process...
80 篇 computer archite...
73 篇 parallel process...
57 篇 algorithms
57 篇 parallel program...
47 篇 parallel archite...
41 篇 hardware
30 篇 scheduling
27 篇 computer program...
21 篇 graph algorithms
20 篇 computer systems...
18 篇 approximation al...
18 篇 processor schedu...
18 篇 computational mo...
18 篇 field programmab...
17 篇 parallel computi...
16 篇 computer science
16 篇 performance
16 篇 delay

机构

32 篇 carnegie mellon ...
15 篇 swiss fed inst t...
15 篇 carnegie mellon ...
11 篇 univ maryland de...
11 篇 stanford univ st...
10 篇 univ maryland co...
10 篇 mit 77 massachus...
10 篇 univ calif berke...
8 篇 eth zurich
7 篇 georgetown univ ...
7 篇 mit cambridge ma...
7 篇 univ texas austi...
6 篇 penn state univ ...
6 篇 mit csail cambri...
6 篇 carnegie mellon ...
5 篇 univ calif river...
5 篇 princeton univer...
5 篇 university of ma...
5 篇 microsoft res re...
5 篇 carnegie mellon ...

作者

38 篇 blelloch guy e.
20 篇 gu yan
18 篇 gibbons phillip ...
18 篇 shun julian
18 篇 goodrich michael...
16 篇 fineman jeremy t...
15 篇 sun yihan
14 篇 dhulipala laxman
13 篇 vishkin uzi
12 篇 agrawal kunal
11 篇 leiserson charle...
10 篇 ballard grey
10 篇 hoefler torsten
10 篇 anon
10 篇 miller gary l.
10 篇 harris david g.
9 篇 ghaffari mohsen
9 篇 tangwongsan kana...
9 篇 reif john h.
9 篇 demmel james

语言

1,571 篇 英文
40 篇 其他

检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"

共 1611 条记录，以下是1491-1500 订阅

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

详细简洁

排序：

An Efficient Implementation of Distributed Routing algorithms for NoCs

An Efficient Implementation of Distributed Routing Algorithm...

引用

International symposium on Networks-on-Chip (NOCS)

作者： José Flich Samuel Rodrigo José Duato Parallel Architectures Group Technical University of Valencia Spain

ISBN: (纸本)9780769530987;0769530982

The design of NoCs for multi-core chips introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are preferred, heterogeneous blocks, fabrication faults, reliability issues, and chip virtualization may lead to the need of irregular topologies or regions. In this situation, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. LBDR (logic-based distributed routing) is proposed as a new routing method that removes the need of using routing tables at all. LBDR enables the implementation of many routing algorithms on most of the practical topologies we might find in the near future in a multi-core system. From an initial topology and routing algorithm, a set of three bits per switch/output port is computed. Evaluation results show that, by using a small logic, LBDR mimics the performance of routing algorithms when implemented with routing tables, both in regular and irregular topologies.

关键词： Routing Network-on-a-chip Switches Network topology Algorithm design and analysis Delay Fabrication Crosstalk Electromagnetic interference Application virtualization

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for data placement on parallel disks 00

Approximation algorithms for data placement on parallel disk...

引用

Proceedings of the eleventh annual acm-SIAM symposium on Discrete algorithms

作者： L. Golubchik S. Khanna S. Khuller R. Thurimella A. Zhu Department of Computer Science and Institute for Advanced Computer Studies University of Maryland College Park MD Department of Computer and Information Science University of Pennsylvania Philadelphia PA and Bell Laboratories Murray Hill NJ Department of Computer Science The University of Denver Denver CO and University of Maryland Computer Science Department Stanford University Stanford CA and Department of Computer Science at the University of Maryland

来源：评论

学校读者我要写书评

暂无评论

Some Sequential algorithms are Almost Always parallel 17

Some Sequential Algorithms are Almost Always Parallel

引用

Proceedings of the 29th acm symposium on parallelism in algorithms and architectures

作者： Guy E. Blelloch Carnegie Mellon University Pittsburgh PA USA

ISBN: (纸本)9781450345934

Over the years many interesting and efficient parallel algorithms have been developed to solve a wide variety of problems, but not much attention has been paid to studying the inherent parallelism in sequential algorithms---i.e., understanding the depth of their dependence structure, and how shallow dependence structures might beused to develop efficient parallel *** this talk I will describe recent work on analyzing the dependence depth of iterative sequential algorithms---ones that loop over a collection of elements. Many of these algorithms have deep dependence chains in the worst case, but shallow chains (polylog w.h.p.) if the elements are randomly ordered. Examples include many fundamental algorithms: the Knuth shuffle for random permutations, sorting by insertion into a binary search tree, greedy maximal independent set (MIS), greedy maximal matching, greedy graph-coloring, counting cycles in a permutation, incremental k-dimensional linear programming, and incremental 2d Delaunay *** advantage of the approach is that it can lead to very simple and efficient parallel algorithms. Our MIS algorithm, for example can be coded in a dozen or so lines, and is significantly faster than Luby's algorithm on modern multicore machines. Also the approach encourages snapping the view that sequential and parallel algorithms are distinct, and instead thinking of algorithms, in general, as collections of instructions with dependences among them.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizations and oracle parallelism with dynamic translation

Optimizations and oracle parallelism with dynamic translatio...

引用

IEEE/acm International symposium on Microarchitecture (MICRO)

作者： K. Ebcioglu E.R. Altman S. Sathaye M. Gschwind IBM Thomas J. Watson Research Center Yorktown Heights NY USA

We describe several optimizations which can be employed in a dynamic binary translation (DBT) system, where low compilation/translation overhead is essential. These optimizations achieve a high degree of ILP, sometimes even surpassing a static compiler employing more sophisticated, and more time-consuming algorithms. We present results in which we employ these optimizations in a dynamic binary translation system capable of computing oracle parallelism.

关键词： parallel processing Scheduling algorithm Runtime Processor scheduling Optimizing compilers Concurrent computing Hardware Keyboards Mice Data mining

来源：评论

学校读者我要写书评

暂无评论

A Cloud-Agnostic Serverless Architecture for Distributed Machine Learning

A Cloud-Agnostic Serverless Architecture for Distributed Mac...

引用

IEEE/acm International symposium on Big Data Computing (BDC)

作者： Ionut Predoaia Pedro García-López University of York United Kingdom Universitat Rovira i Virgili Spain

ISBN: (数字)9798350367300

ISBN: (纸本)9798350367317

Serverless computing has shown vast potential for big data analytics applications, especially involving machine learning algorithms. Nevertheless, little consideration has been given in the literature to cloud-agnostic serverless architectures that leverage existing parallel implementations of machine learning algorithms. This work bridges this gap by proposing a multicloud serverless architecture for distributed machine learning, that enables machine learning engineers without cloud computing expertise to effortlessly port already implemented parallel machine learning algorithms to serverless, whilst overcoming vendor lock-in. In this work, two stateful machine learning algorithms have been ported to serverless, k-means clustering and logistic regression. The serverless implementation of k-means provided superior performance and scalability compared to a serverful implementation when using a number of workers that is equal to or slightly lower than the total number of vCPUs available on the VM running the serverful implementation. Additionally, it achieved an 87-fold speedup compared to a sequential implementation. Moreover, two storage designs of the shared state will be proposed for the serverless implementations, one that requires locks for updating the shared state, and another that is lock-free. Our experimental evaluation demonstrates that the performance of the lock-free serverless implementation of k-means declines with the increase in the number of clusters.

关键词： Bridges Logistic regression Machine learning algorithms Scalability Serverless computing Clustering algorithms Machine learning Computer architecture Big Data parallel machines

来源：评论

学校读者我要写书评

暂无评论

A fast parallel algorithm for determining all roots of a polynomial with real roots 86

A fast parallel algorithm for determining all roots of a pol...

引用

Proceedings of the eighteenth annual acm symposium on Theory of computing

作者： M Ben-Or E Feig D Kozen P Tiwari Hebrew University Jerusalem Israel IBM Research Yorktown Heights NY Dept. of Computer Science Cornell University Ithaca NY Coordinated Science Lab. University of Illinois at Urbana-Champaign Urbana IL

来源：评论

学校读者我要写书评

暂无评论

parallel machine scheduling to minimize energy consumption 20

Parallel machine scheduling to minimize energy consumption

引用

Proceedings of the Thirty-First annual acm-SIAM symposium on Discrete algorithms

作者： Antonios Antoniadis Naveen Garg Gunjan Kumar Nikhil Kumar Saarland University Germany Indian Institute of Technology Delhi Tata Institute of Fundamental Research Mumbai

Given n jobs with release dates, deadlines and processing times we consider the problem of scheduling them on m parallel machines so as to minimize the total energy consumed. Machines can enter a sleep state and they consume no energy in this state. Each machine requires L units of energy to awaken from the sleep state and in its active state the machine can process jobs and consumes a unit of energy per unit time. We allow for preemption and migration of jobs and provide the first constant approximation algorithm for this problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Type Architecture for Hybrid Micro-parallel Computers

A Type Architecture for Hybrid Micro-Parallel Computers

引用

annual IEEE symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Benjamin Ylvisaker Brian Van Essen Carl Ebeling Department of Computer Science and Engineering University of Washington USA

Platform FPGAs that integrate sequential processors with a spatial fabric have become prevalent. While these hybrid architectures ease the burden of integrating sequential and spatial code in a single application, programming them, and particularly their spatial fabrics remains challenging. The difficulty arises in part from the lack of an agreed upon computational model and family of programming languages. In addition, moving algorithms into hardware is an arcane art far removed from the experience of most programmers. To address this challenge, we present a new type architecture, an abstract model analogous to the von Neumann machine for sequential computers, that can serve as common ground for algorithm designers, language designers, and hardware architects. We show that many parallel architectures, including platform FPGAs, are implementations of this type architecture. Using examples from a variety of application domains, we show how algorithms can be analyzed to estimate their performance on implementations of this type architecture. This analysis is done without having to delve into the details of any architecture in particular. Finally, we describe some of the common features of languages designed for expressing micro-parallelism, highlighting connections with the type architecture

关键词： Computer architecture Algorithm design and analysis Field programmable gate arrays Fabrics Application software Hardware Computational modeling Computer languages Art Programming profession

来源：评论

学校读者我要写书评

暂无评论

An NC parallel 3D convex hull algorithm 93

An NC parallel 3D convex hull algorithm

引用

Proceedings of the ninth annual symposium on Computational geometry

作者： Nancy M. Amato Franco P. Preparata

ISBN: (纸本)9780897915823

In this paper we present an O(log n) time parallel algorithm for computing the convex hull of n points in ℜ3. This algorithm uses O(n1+α) processors on a CREW PRAM, for any constant 0 < α ≤ 1. So far, all adequately documented parallel algorithms proposed for this problem use time at least O (log2 n). In addition, the algorithm presented here is the first parallel algorithm for the three-dimensional convex hull problem that is not based on the serial divide-and-conquer algorithm of Preparata and Hong, whose crucial operation is the merging of the convex hulls of two linearly separated point sets. The contributions of this paper are therefore (i) an O(logn) time parallel algorithm for the three-dimensional convex hull problem, and (ii) a parallel algorithm for this problem that does not follow the traditional divide-and-conquer paradigm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parallel hardware evolvable computer POLYP

A parallel hardware evolvable computer POLYP

引用

annual IEEE symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： U. Tangen L. Schulte J.S. McCaskill Institute for Molekulare Biotechnologie Jena Germany

Previous work (J.S. McCaskill et al., 1996; 1997) has shown the power of massively parallel configurable hardware (NGEN) in conjunction with dataflow architectures for the simulation of evolving populations. NGEN is a flexible computer hardware for rapid custom circuit simulation of fine grained physical processes via a massively parallel architecture, e.g. 144 hardware configurable field programmable gate arrays (FPGAs, XC4008, Xilinx). NGEN is optimized to implement dataflow architectures and systolic algorithms for large problems and is confectioned with high speed distributed SRAM, 144*8*256 kBit, 15ns access time, on the chip to chip interconnect. Microconfigurable FPGAs allow a further step to close the gap between micro electronics and biology on the information processing area. A design for a massively parallel microconfigurable computer (POLYP) is presented. It is designed to allow online evolution in hardware with significant locally controllable memory resources. It is also designed for high throughput dataflow applications with large problem size. Additionally, an evolvable interface between high rate measurement devices is provided to allow adaptive processing coupled with real time experimental environments. The computer represents the next logical step towards evolvable hardware interacting with biology beyond the massively parallel computer NGEN.

关键词： Hardware Concurrent computing Field programmable gate arrays Biology computing Computer architecture Circuit simulation Evolution (biology) Computational modeling Physics computing parallel architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共162页 << < 146 147 148 149 150 151 152 153 154 155 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：