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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

350 篇 会议
19 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

254 篇 工学
- 250 篇 计算机科学与技术...
- 163 篇 软件工程
- 25 篇 电气工程
- 24 篇 信息与通信工程
- 17 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 4 篇 农业工程
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 生物医学工程（可授...
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
151 篇 理学
- 148 篇 数学
- 23 篇 统计学（可授理学、...
- 3 篇 生物学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 化学
13 篇 管理学
- 10 篇 管理科学与工程(可...
- 9 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

83 篇 parallel algorit...
68 篇 parallel process...
12 篇 parallel program...
11 篇 computer program...
9 篇 scheduling
7 篇 computer archite...
7 篇 pram
6 篇 computer systems...
5 篇 graph algorithms
4 篇 performance
4 篇 parallel archite...
4 篇 multithreading
4 篇 transactional me...
4 篇 work stealing
3 篇 parallel process...
3 篇 parallelism
3 篇 approximation al...
3 篇 cilk
3 篇 sorting
3 篇 chip multiproces...

机构

10 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 computer science...
2 篇 univ maryland de...
2 篇 univ of californ...
2 篇 department of ma...
2 篇 swiss fed inst t...
2 篇 digital systems ...
2 篇 t.j. watson rese...

作者

12 篇 gibbons phillip ...
11 篇 blelloch guy e.
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 ramachandran vij...
4 篇 vitter jeffrey s...
4 篇 muthukrishnan s.
4 篇 goodrich michael...
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 cormen thomas h.
3 篇 deng xiaotie
3 篇 tangwongsan kana...
3 篇 sohn andrew
3 篇 leighton tom
3 篇 fineman jeremy t...
3 篇 simhadri harsha ...
3 篇 miller gary l.

语言

356 篇 英文
13 篇 其他

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

共 369 条记录，以下是111-120 订阅

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

详细简洁

排序：

Introducing the hydra parallel programming system 06

Introducing the hydra parallel programming system

引用

proceedings of the eighteenth annual acm symposium on parallelism in algorithms and architectures

作者： Franklin E. Powers Gita Alaghband University of Colorado at Denver and Health & Sciences Center Denver CO

ISBN: (纸本)9781595934529

Hydra PPS is a collection of annotations, classes, a runtime, and a compiler designed to provide Java programmers with a fairly simple method of producing programs for Symmetric Multiprocessing (SMP) architectures. This paper introduces the basics of this new system including the basic constructs for this new programming language and the relationship between the Java VM, the compiler, the runtime, and the parallel program. Hydra will exploit parallelism when the underlying architecture supports it and will run as normal sequential Java program when the architecture does not have support for parallelism. parallelism is expressed through events in Hydra, it is easy to use, and programs run efficiently on parallel architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the price of heterogeneity in parallel systems 06

On the price of heterogeneity in parallel systems

引用

proceedings of the eighteenth annual acm symposium on parallelism in algorithms and architectures

作者： P. Brighten Godfrey Richard M. Karp UC Berkeley Berkeley CA

ISBN: (纸本)9781595934529

Suppose we have a parallel or distributed system whose nodes have limited capacities, such as processing speed, bandwidth, memory, or disk space. How does the performance of the system depend on the amount of heterogeneity of its capacity distribution? We propose a general framework to quantify the worst-case effect of increasing heterogeneity in models of parallel systems. Given a cost function g(C,W) representing the system's performance as a function of its nodes' capacities C and workload W (such as the completion time of an optimum schedule of jobs W on machines C), we say that g has price of heterogeneity α when for any workload, cost cannot increase by more than a factor α if node capacities become arbitrarily more heterogeneous. We give constant bounds on the price of heterogeneity of several well-known job scheduling and graph degree/diameter problems, indicating that increasing heterogeneity can never be much of a disadvantage. On the other hand, with the introduction of timing constraints such as release times or precedence constraints on the jobs, the dependence on node capacities becomes more complex, so that increasing heterogeneity may be quite detrimental.

关键词： majorization scheduling heterogeneity

来源：评论

学校读者我要写书评

暂无评论

An empirical study to compare two parallel programming models 06

An empirical study to compare two parallel programming model...

引用

proceedings of the eighteenth annual acm symposium on parallelism in algorithms and architectures

作者： Lorin Hochstein Victor R. Basili University of Maryland College Park MD

ISBN: (纸本)9781595934529

While there are strong beliefs within the community about whether one particular parallel programming model is easier to use than another, there has been little research to analyze these claims empirically. Currently, the most popular paradigm is message-passing, as implemented by the MPI library [1]. However, MPI is considered to be difficult for developing programs, because it forces the programmer to work at a very low level of abstraction. One alternative parallel programming model is the PRAM model, which supports fine-grained parallelism and has a substantial history of algorithmic theory [2]. It is not possible to program current parallel machines using the PRAM model because modern architectures are not designed to support such a model efficiently. However, current trends towards multicore chips suggest that large-scale, fine-grained uniform-memory access parallel machines may soon be feasible. XMT-C is an extension of the C language that supports parallel directives to provide a PRAM-like model to the programmer. A prototype compiler exists that generates code which runs on a simulator for an XMT architecture [3].To better understand how much benefit a PRAM-like model could provide over a message-passing model, we conducted a feasibility study in an academic setting to compare the effort required to solve a particular problem. The questions under study were: can we measure the effort in developing a program using these two programming models and can we differentiate the amount of effort for each model?.The subjects participating in the study were divided up into two groups. One group solved a problem using the MPI library in either C,C++, or Fortran, and the other group solved the problem using XMT-C. The task was to write a function to multiply a sparse matrix with a dense vector. To obtain subjects, we leveraged existing graduate-level parallel programming courses at two different universities: University of California, Santa Barbara (UCSB), and Universit

关键词： HPC message-passing PRAM XMT empirical study productivity effort parallel programming MPI

来源：评论

学校读者我要写书评

暂无评论

An implementation report for parallel triangular decompositions 06

An implementation report for parallel triangular decompositi...

引用

proceedings of the eighteenth annual acm symposium on parallelism in algorithms and architectures

作者： Marc Moreno Maza Yuzhen Xie University of Western Ontario (UWO) London Ontario Canada

ISBN: (纸本)9781595934529

Since the discovery of Gröbner bases, the algorithmic advances in Commutative Algebra have made possible to tackle many classical problems in Algebraic Geometry that were previously out of reach. However, algorithmic progress is still desirable, for instance when solving symbolically a large system of algebraic non-linear equations. For such a system, in particular if its solution set consists of geometric components of different dimension (points, curves, surfaces, etc) it is necessary to combine Gröbner bases with decomposition techniques, such as triangular decompositions. Ideally, one would like each of the different components to be produced by an independent processor, or set of processors. In practice, the input polynomial system, which is hiding those components, requires some transformations in order to split the computations into sub-systems and, then, lead to the desired components. The efficiency of this approach depends on its ability to detect and exploit geometrical information during the solving *** work addresses two questions: How to discover geometrical information, at an early stage of the solving process, that would be favorable to parallel execution? How to ensure load balancing among the processors? We answer these questions in the context of triangular decompositions [2] which are a popular way of solving polynomial systems symbolically. These methods tend to split the input polynomial system into subsystems and, therefore, are natural candidate for parallel implementation. However, the only such method which has been parallelized so far is the Characteristic Set Method of Wu [5], as reported in [1, 6]. This approach suffers from several limitations. For instance, the solving of the second component cannot start before that of the first one is completed; this is a limitation in view of coarse-grain *** [4] an algorithm, called Triade, for TRIAngular DEcompositions, provides a good management of the intermediate computat

关键词： parallel execution polynomial system solver

来源：评论

学校读者我要写书评

暂无评论

parallel depth first vs. work stealing schedulers on CMP architectures 06

Parallel depth first vs. work stealing schedulers on CMP arc...

引用

proceedings of the eighteenth annual acm symposium on parallelism in algorithms and architectures

作者： Vasileios Liaskovitis Shimin Chen Phillip B. Gibbons Anastassia Ailamaki Guy E. Blelloch Babak Falsafi Limor Fix Nikos Hardavellas Michael Kozuch Todd C. Mowry Chris Wilkerson Carnegie Mellon University Intel Research Pittsburgh Carnegie Mellon University and Intel Research Pittsburgh Intel Microprocessor Research Lab

ISBN: (纸本)9781595934529

In chip multiprocessors (CMPs), limiting the number of off-chip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently scheduled threads share a largely overlapping working set. In this brief announcement, we highlight our ongoing study [4] comparing the performance of two schedulers designed for fine-grained multithreaded programs: parallel Depth First (PDF) [2], which is designed for constructive sharing, and Work Stealing (WS) [3], which takes a more traditional *** of schedulers. In PDF, processing cores are allocated ready-to-execute program tasks such that higher scheduling priority is given to those tasks the sequential program would have executed earlier. As a result, PDF tends to co-schedule threads in a way that tracks the sequential execution. Hence, the aggregate working set is (provably) not much larger than the single thread working set [1]. In WS, each processing core maintains a local work queue of readyto-execute threads. Whenever its local queue is empty, the core steals a thread from the bottom of the first non-empty queue it finds. WS is an attractive scheduling policy because when there is plenty of parallelism, stealing is quite rare. However, WS is not designed for constructive cache sharing, because the cores tend to have disjoint working *** configurations studied. We evaluated the performance of PDF and WS across a range of simulated CMP configurations. We focused on designs that have fixed-size private L1 caches and a shared L2 cache on chip. For a fixed die size (240 mm2), we varied the number of cores from 1 to 32. For a given number of cores, we used a (default) configuration based on current CMPs and realistic projections of future CMPs, as process technologies decrease from 90nm to *** of findings. We studied a variety of benchmark programs to show the following *** several application classes, PDF enable

关键词： scheduling chip multiprocessors caches

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On competitive online read-many parallel disks scheduling 05

On competitive online read-many parallel disks scheduling

引用

proceedings of the seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Rahul Shah Peter J. Varman Jeffrey Scott Vitter Purdue University West Lafayette IN Rice University Houston TX Purdue University West Lafayatte IN

ISBN: (纸本)9781581139860

We consider the natural extension of the single disk caching problem to parallel disk I/O model. We close the existing gap between lower and upper bounds and achieve optimal competitive ratio of O(√D) when lookahead is more than the memory size M. When lookahead is smaller, we derive various upper bounds and lower bounds on the competitive ratio under various adversarial models.

关键词： online algorithms parallel disk model

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 8 9 10 11 12 13 14 15 16 17 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：