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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

319 篇 会议
20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

280 篇 工学
- 275 篇 计算机科学与技术...
- 170 篇 软件工程
- 24 篇 信息与通信工程
- 18 篇 控制科学与工程
- 14 篇 电气工程
- 10 篇 电子科学与技术（可...
- 3 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 光学工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 交通运输工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
- 1 篇 安全科学与工程
154 篇 理学
- 152 篇 数学
- 21 篇 统计学（可授理学、...
- 4 篇 系统科学
- 1 篇 物理学
- 1 篇 生物学
14 篇 管理学
- 11 篇 管理科学与工程(可...
- 10 篇 工商管理
- 2 篇 图书情报与档案管...
4 篇 农学
- 4 篇 作物学
- 2 篇 农业资源与环境
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

82 篇 parallel process...
72 篇 parallel algorit...
20 篇 parallel archite...
12 篇 computer archite...
10 篇 concurrent compu...
10 篇 parallel program...
9 篇 computer science
7 篇 parallel process...
6 篇 algorithm design...
6 篇 scheduling
5 篇 approximation al...
5 篇 hypercubes
5 篇 multiprocessor i...
5 篇 hardware
4 篇 graph algorithms
4 篇 sorting
4 篇 educational inst...
4 篇 program processo...
4 篇 costs
4 篇 parallel computi...

机构

4 篇 carnegie mellon ...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 massachusetts in...
3 篇 univ of californ...
3 篇 mit 77 massachus...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ calif davis...
2 篇 at and t bell la...
2 篇 univ nevada dept...
2 篇 new jersey inst ...
2 篇 univ of californ...
2 篇 intel res pittsb...
2 篇 department of ma...
2 篇 digital systems ...
2 篇 t.j. watson rese...
2 篇 max planck inst ...
2 篇 univ of maryland...

作者

8 篇 gibbons phillip ...
6 篇 reif john h.
5 篇 matias yossi
4 篇 rao satish
4 篇 ramachandran vij...
4 篇 blelloch guy e.
4 篇 muthukrishnan s.
4 篇 sarkar vivek
3 篇 snir marc
3 篇 cormen thomas h.
3 篇 taniar d
3 篇 sohn andrew
3 篇 leighton tom
3 篇 vitter jeffrey s...
3 篇 sudborough ih
3 篇 miller gary l.
3 篇 gu yan
3 篇 meyer auf der he...
3 篇 biswas rupak
2 篇 lang kevin

语言

323 篇 英文
16 篇 其他

检索条件"任意字段=Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures"

共 339 条记录，以下是81-90 订阅

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

详细简洁

排序：

Deterministic sorting and randomized median finding on the BSP model 96

Deterministic sorting and randomized median finding on the B...

引用

proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures

作者： Gerbessiotis, Alexandros V. Siniolakis, Constantinos J. Oxford Univ Oxford United Kingdom

ISBN: (纸本)9780897918091

We present new BSP algorithms for deterministic sorting and randomized median finding. We sort n general keys by using a partitioning scheme that achieves the requirements of efficiency (one-optimality) and insensitivity against data skew (the accuracy of the splitting keys depends solely on the step distance, which can be adapted to meet the worst-case requirements of our application). Although we employ sampling in order to realize efficiency, we can give a precise worst-case estimation of the maximum imbalance which might occur. We also investigate optimal randomized BSP algorithms for the problem of finding the median of n elements that require, with high-probability, 3n/(2p)+o(n/p) number of comparisons, for a wide range of values of n and p. Experimental results for the two algorithms are also presented.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Analysis of first-come-first-serve parallel job scheduling

Analysis of first-come-first-serve parallel job scheduling

引用

proceedings of the 1998 9th annual acm SIAM symposium on Discrete algorithms

作者： Schwiegelshohn, Uwe Yahyapour, Ramin Univ Dortmund Dortmund Germany

this paper analyzes job scheduling for parallel computers by using theoretical and experimental means. Based on existing architectures we first present a machine and a job model. then, we propose a simple on-line algorithm employing job preemption without migration and derive theoretical bounds for the performance of the algorithm. the algorithm is experimentally evaluated with trace data from a large computing facility. these experiments show that the algorithm is highly sensitive on parameter selection and that substantial performance improvements over existing (non-preemptive) scheduling methods are possible.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

proceedings of the annual acm symposium on theory of Computing

Proceedings of the Annual ACM Symposium on Theory of Computi...

引用

6th annual acm symposium on theory of Computing, STOC 1974

the proceedings contain 35 papers. the topics discussed include: storage requirements for deterministic polynomial time recognizable languages;linear time algorithm for isomorphism of planar graphs;testing graph connectivity;efficient stable sorting with minimal extra space;an efficient algorithm for computing optimal disk merge patterns;limitations of synchronization primitives with conditional branching and global variables;and construction with parallel derivatives of the closure of a parallel program schema.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fast set operations using treaps 98

Fast set operations using treaps

引用

proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Blelloch, G.E. Reid-Miller, M. Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897919890

We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the algorithms run in expected O(m lg(n/m)) work and O(lg n) depth (parallel time) on an EREW PRAM with scan operations (implying O(lg2 n) depth on a plain EREW PRAM). As with the sequential algorithms on treaps for insertion and deletion the main advantage of our algorithms are their simplicity. In fact our algorithms for set operations seem simpler than previous sequential algorithms with the same work bounds, and might therefore also be useful in a sequential context. To analyze the effectiveness of the algorithms we implemented both sequential and parallel versions of the algorithms and ran several experiments on them. Our parallel implementation uses the Cilk [5] shared memory runtime system on a 16 processor SGI Power Challenge and a 6 processor Sun Ultra Enterprise 3000. It shows reasonable speedup: 6.3 to 6.8 speedup on 8 processors of the SGI, and 4.1 to 4.4 speedup on 5 processors of the Sun.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract) 94

Dynamic load balancing in parallel and distributed networks ...

引用

6th annual acm symposium on parallel algorithms and architectures, SPAA 1994

作者： Ghosh, Bhaskar Muthukrishnan, S. Department of Computer Science Yale University P.O. Box 208285 New HavenCT06520 United States Courant Institute of Mathematical Sciences New York University 251 Mercer Street New YorkNY10012-1185 United States

ISBN: (纸本)0897916719

the fundamental problems in dynamic load balancing and job scheduling in parallel and distributed computers involve moving load between processors. In this paper, we consider a new model for load movement in synchronous parallel and distributed machines. In each step of our model, each processor can transfer load to at most one neighbor;also, any amount of load can be moved along a communication link between two processors in one step. this is a reasonable model for load movement in significant classes of dynamic load balancing problems. We derive efficient algorithms for a number of task reallocation problems under our model of load movement. these include dynamic load balancing on processor networks, adaptive mesh re-partitioning such as those in finite element methods, and progressive job migration under dynamic generation and consumption of load. To obtain the above-mentioned results, we introduce and solve the abstract problem of Incremental Weight Migration (IWM) on arbitrary graphs. Our main result is a simple, randomized, algorithm for this problem which provably results in asymptotically optimal convergence towards the state where weights on the nodes of the graph are all equal. this algorithm utilizes an appropriate random set of edges forming a matching. Our algorithm for the IWM problem is used in deriving efficient algorithms for all the problems mentioned above. Our results are very general. the algorithms we derive are local, and hence, scalable. they work for arbitrary load distributions and for networks of arbitrary topology which can possibly undergo link failures. Of independent interest is our proof technique which we use to lower bound the convergence of our algorithms in terms of the eigenstructure of the underlying graph. Finally, we present preliminary experimental results analyzing issues in load balancing related to our algorithms. © 1994 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

On the analysis of randomized load balancing schemes 97

On the analysis of randomized load balancing schemes

引用

proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA

作者： Mitzenmacher, Michael Digital Systems Research Cent Palo Alto CA United States

ISBN: (纸本)9780897918909

It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper, we provide new analyses for several such dynamic randomized load balancing schemes. Unlike previous analyses, we do not assume that in equilibrium each server is stochastically independent from other servers. Our work extends a previous analysis of the supermarket model, a model that abstracts a simple, efficient load balancing scheme in the setting where jobs arrive at a large system of parallel processors. In this model, customers arrive at a system of n servers as a Poisson stream of rate λn, λ

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

SPAA 2023 - proceedings of the 35th acm symposium on parallelism in algorithms and architectures

SPAA 2023 - Proceedings of the 35th ACM Symposium on Paralle...

引用

35th acm symposium on parallelism in algorithms and architectures, SPAA 2023

ISBN: (纸本)9781450395458

the proceedings contain 47 papers. the topics discussed include: Quancurrent: a concurrent quantiles sketch;an efficient scheduler for task-parallel interactive applications;efficient synchronization-light work stealing;balanced allocations in batches: the tower of two choices;massively parallel tree embeddings for high dimensional spaces;deterministic massively parallel symmetry breaking for sparse graphs;an associativity threshold phenomenon in set-associative caches;increment - and - freeze: every cache, everywhere, all of the time;multidimensional approximate agreement with asynchronous fallback;a tight characterization of fast failover routing: resiliency to two link failures is possible;releasing memory with optimistic access: a hybrid approach to memory reclamation and allocation in lock-free programs;transactional composition of nonblocking data structures;applying hazard pointers to more concurrent data structures;and nearly optimal parallel algorithms for longest increasing subsequence.

关键词：

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 6th International parallel Processing symposium

Proceedings of the 6th International Parallel Processing Sym...

引用

proceedings of the 6th International parallel Processing symposium

the symposium materials contain 118 papers on new developments in parallel processing. algorithms, architectures, mapping/scheduling, applications, special-purpose architectures, interconnection networks, software, an... 详细信息

ISBN: (纸本)0818626720

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling Jobs with Work-Inefficient parallel Solutions 24

Scheduling Jobs with Work-Inefficient Parallel Solutions

引用

36th acm symposium on parallelism in algorithms and architectures (SPAA)

作者： Kuszmaul, William Westover, Alek Harvard Univ Cambridge MA 02138 USA MIT Cambridge MA USA

ISBN: (纸本)9798400704161

this paper introduces the serial-parallel decision problem. Consider an online scheduler that receives a series of tasks, where each task has both a parallel and a serial implementation. the parallel implementation has the advantage that it can make progress concurrently on multiple processors, but the disadvantage that it is (potentially) work-inefficient. As tasks arrive, the scheduler must decide for each task which implementation to use. We begin by studying total awake time. We give a simple decide-on-arrival scheduler that achieves a competitive ratio of 3 for total awake time-this scheduler makes serial/parallel decisions immediately when jobs arrive. Our second result is an parallel-work-oblivious scheduler that achieves a competitive ratio of 6 for total awake time-this scheduler makes all of its decisions based only on the size of each serial job and without needing to know anything about the parallel implementations. Finally, we prove a lower bound showing that, if a scheduler wishes to achieve a competitive ratio of O(1), it can have at most one of the two aforementioned properties (decide-on-arrival or parallel-work-oblivious). We also prove lower bounds of the form 1 + Omega(1) on the optimal competitive ratio for any scheduler. Next, we turn our attention to optimizing mean response time. Here, we show that it is possible to achieve an O(1) competitive ratio with O(1) speed augmentation. this is the most technically involved of our results. We also prove that, in this setting, it is not possible for a parallel-work-oblivious scheduler to do well. In addition to these results, we present tight bounds on the optimal competitive ratio if we allow for arrival dependencies between tasks (e.g., tasks are components of a single parallel program), and we give an in-depth discussion of the remaining open questions.

关键词： Scheduling parallel Work-Inefficient Competitive-Analysis

来源：评论

学校读者我要写书评

暂无评论

Provably efficient scheduling for languages with fine-grained parallelism 95

Provably efficient scheduling for languages with fine-graine...

引用

proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95

作者： Blelloch, Guy E. Gibbons, Phillip B. Matias, Yossi Carnegie Mellon Univ Pittsburgh PA United States

ISBN: (纸本)9780897917179

Most high-level parallel programming languages allow for fine-grained parallelism. Programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to processors. When executing such programs, the major concern is to dynamically schedule tasks to processors in order to minimize execution time and the amount of memory needed. In this paper, a class of parallel schedules that are provably efficient in both time and space, even for programs whose task structure is revealed only during execution are identified. Following this, an efficient dynamic scheduling algorithm that generates schedules in this class, for languages with nested fine-grained parallelism is described.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共34页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：