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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

30 篇 会议
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

12 篇 工学
- 12 篇 计算机科学与技术...
- 8 篇 软件工程
- 4 篇 信息与通信工程
- 2 篇 电气工程
6 篇 理学
- 6 篇 数学
- 3 篇 统计学（可授理学、...
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...

主题

2 篇 computer archite...
2 篇 chip multiproces...
1 篇 computer science
1 篇 parallel algorit...
1 篇 performance
1 篇 shared memory ar...
1 篇 coherence
1 篇 computer systems...
1 篇 multi-core archi...
1 篇 green computing ...
1 篇 communication-av...
1 篇 dense linear alg...
1 篇 stream programmi...
1 篇 data affinity
1 篇 caches
1 篇 computer program...
1 篇 data-flow parall...
1 篇 heterogeneity
1 篇 telecommunicatio...
1 篇 scheduling

机构

1 篇 stony brook univ...
1 篇 univ jaume 1 dep...
1 篇 univ illinois co...
1 篇 univ texas austi...
1 篇 intel research p...
1 篇 univ calif san d...
1 篇 intel microproce...
1 篇 stanford univ co...
1 篇 univ illinois de...
1 篇 carnegie-mellon ...
1 篇 research and aca...
1 篇 carnegie mellon ...
1 篇 carnegie mellon ...
1 篇 uc berkeley berk...

作者

1 篇 ballard grey
1 篇 chan ernie
1 篇 vasileios liasko...
1 篇 babak falsafi
1 篇 gearhart andrew
1 篇 michael kozuch
1 篇 park jongsoo
1 篇 dally william j.
1 篇 anastassia ailam...
1 篇 brown jeffery a.
1 篇 shimin chen
1 篇 van de geijn rob...
1 篇 agha gul
1 篇 quintana-orti gr...
1 篇 wedig robert
1 篇 kumar rakesh
1 篇 bender michael a...
1 篇 newell allen
1 篇 guy e. blelloch
1 篇 limor fix

语言

32 篇 英文

检索条件"任意字段=Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"

共 32 条记录，以下是1-10 订阅

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

详细简洁

排序：

SPAA 2005 - seventeenth annual acm symposium on parallelism in algorithms and architectures

SPAA 2005 - Seventeenth Annual ACM Symposium on Parallelism ...

引用

seventeenth annual acm symposium on parallelism in algorithms and architectures

The proceedings contain 39 papers. The topics discussed include: randomized queue management for DiffServ;randomization does not reduce the average delay in parallel packet switches;dynamic circular work-stealing deque;coloring unstructured radio networks;name independent routing for growth bounded networks;windows scheduling of arbitrary length jobs on parallel machines;parallel scheduling of complex dags under uncertainty;on distributed smooth scheduling;scheduling malleable tasks with precedence constraints;an adaptive power conservation scheme for heterogeneous wireless sensor networks with node redeployment;irrigating ad hoc networks ion constant time;and constant density spanners for wireless ad-hoc networks.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

SPAA 2004 - Sixteenth annual acm symposium on parallelism in algorithms and architectures

SPAA 2004 - Sixteenth Annual ACM Symposium on Parallelism in...

引用

SPAA 2004 - Sixteenth annual acm symposium on parallelism in algorithms and architectures

The proceedings contains 40 papers from the conference on SPAA 2004 - Sixteenth annual acm symposium on parallelism in algorithms and architectures. The topics discussed include: On delivery times in packet networksunder adversarial traffic;balanced graph partitioning;online hierarchical cooperative caching;scheduling against an adversarial network;effectively sharing a cache among threads;online algorithms for network design and dynamic analysis of the arrow distributed protocol.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

SPAA 2003 fifteenth annual acm symposium on parallelism in algorithms and architectures

SPAA 2003 fifteenth annual ACM symposium on parallelism in a...

引用

Fifteenth annual acm symposium on parallelism in algorithms and architectures

The proceedings contains 46 papers from the conference on SPAA 2003 Fifteenth annual acm symposium on parallelism in algorithms and architectures. The topics discussed include: optimal sharing of bags of tasks in heterogeneous clusters;minimizing total flow time and total completion time with immediate dispatching;a practical algorithm for constructing oblivious routing schemes;a polynomial-time tree decomposition to minimize congestion and online oblivious routing.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Communication Bounds for Heterogeneous architectures 11

Brief Announcement: Communication Bounds for Heterogeneous A...

引用

23rd annual symposium on parallelism in algorithms and architectures

作者： Ballard, Grey Demmel, James Gearhart, Andrew UC Berkeley Berkeley CA USA

ISBN: (纸本)9781450307437

As the gap between the cost of communication (i.e., data movement) and computation continues to grow, the importance of pursuing algorithms which minimize communication also increases. Toward this end, we seek asymptotic communication lower bounds for general memory models and classes of algorithms. Recent work [2] has established lower bounds for a wide set of linear algebra algorithms on a sequential machine and on a parallel machine with identical processors. This work extends these previous bounds to a heterogeneous model in which processors access data and perform floating point operations at differing speeds. We also present an algorithm for dense matrix multiplication which attains the lower bound.

关键词： communication-avoiding heterogeneity

来源：评论

学校读者我要写书评

暂无评论

symposium on parallelism in algorithms and architectures, SPAA 2003: 15th annual symposium on parallelism in algorithms and architectures

Symposium on Parallelism in Algorithms and Architectures, SP...

引用

4th acm Federated Computing Research Conference, FCRC 2003

The proceedings contain 7 papers from the symposium on parallelism in algorithms and architectures, SPAA 2003: 15th annual symposium on parallelism in algorithms and architectures. The topics discussed include: a practical algorithm for constructing oblivious routing schemes;novel architectures for P2P applications: the continuous-discrete approach;quantifying instruction criticality for shared memory multiprocessors;relaxing the problem-size bound for out-of-core columnsort;the complexity of verifying memory coherence;a near optimal scheduler for switch-memory-switch routers;and on local algorithms for topology control and routing in ad hoc networks.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Towards Optimizing Energy Costs of algorithms for Shared Memory architectures 10

Towards Optimizing Energy Costs of Algorithms for Shared Mem...

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： Korthikanti, Vijay Anand Agha, Gul Univ Illinois Dept Comp Sci Urbana IL USA

ISBN: (纸本)9781450300797

Energy consumption by computer systems has emerged as an important concern However, the energy consumed in executing an algorithm cannot be inferred from its performance alone it must be modeled explicitly This paper analyzes energy consumption of parallel algorithms executed on shared memory multicore processors Specifically, we develop a methodology to evaluate how energy consumption of a given parallel algorithm changes as the number of cores and their frequency is varied We use this analysis to establish the optimal number of cores to minimize the energy consumed by the execution of a parallel algorithm for a specific problem size while satisfying a given performance requirement We study the sensitivity of our analysis to changes in parameters such as the ratio of the power consumed by a computation step versus the power consumed in accessing memory The results show that the relation between the problem size and the optimal number of cores is relatively unaffected for a wide range of these parameters.

关键词： Energy Performance Parallel algorithms Shared Memory architectures

来源：评论

学校读者我要写书评

暂无评论

annual acm symposium on parallelism in algorithms and architectures

Annual ACM Symposium on Parallelism in Algorithms and Archit...

引用

29th acm symposium on parallelism in algorithms and architectures, SPAA 2017

ISBN: (纸本)9781450345934

The proceedings contain 45 papers. The topics discussed include: randomized composable coresets for matching and vertex cover;almost optimal streaming algorithms for coverage problems;bicriteria distributed submodular maximization in a few rounds;on energy conservation in data centers;asymptotically optimal approximation algorithms for coflow scheduling;online flexible job scheduling for minimum span;minimizing total weighted flow time with calibrations;brief announcement: scheduling parallelizable jobs online to maximize throughput;brief announcement: a new improved bound for coflow scheduling;and a communication-avoiding parallel algorithm for the symmetric eigenvalue problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Buffer-space Efficient and Deadlock-free Scheduling of Stream Applications on Multi-core architectures 10

Buffer-space Efficient and Deadlock-free Scheduling of Strea...

引用

22nd acm symposium on parallelism in algorithms and architectures

作者： Park, Jongsoo Dally, William J. Stanford Univ Comp Syst Lab Stanford CA 94305 USA

ISBN: (纸本)9781450300797

We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling Compared to previous multi-core stream scheduling algorithms, team scheduling achieves 1) similar synchronization overhead, 2) coverage of a larger class of applications, 3) better control over buffer space, 4) deadlock-free feedback loops, and 5) lower latency We compare team scheduling to the latest stream scheduling algorithm, SGMS, by evaluating 14 applications on a multi-core architecture with 16 cores. Team scheduling successfully targets applications that cannot be validly scheduled by SGMS clue to excessive buffer requirement or deadlocks in feedback loops (e.g., GSM and W-cDmA) For applications that can be validly scheduled by SGMS, team scheduling shows on average 37% higher throughput within the same buffer space constraints

关键词： Compiler and Tools for Concurrent Programming Stream Programming Green Computing and Power-Efficient architectures Multi-core architectures

来源：评论

学校读者我要写书评

暂无评论

SPAA'10 - proceedings of the 22nd annual symposium on parallelism in algorithms and architectures

SPAA'10 - Proceedings of the 22nd Annual Symposium on Parall...

引用

22nd acm symposium on parallelism in algorithms and architectures, SPAA'10

ISBN: (纸本)9781450300797

The proceedings contain 45 papers. The topics discussed include: buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures;scheduling to minimize power consumption using submodular functions;collaborative scoring with dishonest participants;securing every bit: authenticated broadcast in radio networks;brief announcement: on speculative replication of transactional systems;data-aware scheduling of legacy kernels on heterogeneous platforms with distributed memory;basic network creation games;on the bit communication complexity of randomized rumor spreading;algorithms and application for grids and clouds;towards optimizing energy costs of algorithms for shared memory architectures;brief announcement: on regenerator placement problems in optical networks;best-effort group service in dynamic networks;and implementing and evaluating nested parallel transactions in software transactional memory.

关键词：

来源：评论

学校读者我要写书评

暂无评论

annual acm symposium on parallelism in algorithms and architectures

Annual ACM Symposium on Parallelism in Algorithms and Archit...

引用

31st acm symposium on parallelism in algorithms and architectures, SPAA 2019

ISBN: (纸本)9781450361842

The proceedings contain 45 papers. The topics discussed include: the price of clustering in bin-packing with applications to bin-packing with delays;faster matrix multiplication via sparse decomposition;NC algorithms for computing a perfect matching, the number of perfect matchings, and a maximum flow in one-crossing-minor-free graphs;improved MPC algorithms for edit distance and ulam distance;brief announcement: scalable diversity maximization via small-size composable core-sets;brief announcement: eccentricities via parallel set cover;dynamic algorithms for the massively parallel computation model;massively parallel computation via remote memory access;and brief announcement: ultra-fast asynchronous randomized rumor spreading.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：