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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

496 篇 会议
38 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

400 篇 工学
- 384 篇 计算机科学与技术...
- 262 篇 软件工程
- 44 篇 信息与通信工程
- 33 篇 电气工程
- 25 篇 控制科学与工程
- 11 篇 电子科学与技术（可...
- 9 篇 农业工程
- 4 篇 材料科学与工程（可...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
267 篇 理学
- 261 篇 数学
- 39 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 2 篇 化学
34 篇 管理学
- 30 篇 管理科学与工程(可...
- 25 篇 工商管理
- 4 篇 图书情报与档案管...
11 篇 农学
- 11 篇 作物学
- 2 篇 农业资源与环境
4 篇 经济学
- 4 篇 应用经济学
1 篇 法学
- 1 篇 社会学

主题

118 篇 parallel process...
103 篇 parallel algorit...
20 篇 parallel program...
15 篇 computer program...
13 篇 scheduling
11 篇 computer archite...
8 篇 approximation al...
7 篇 computer systems...
7 篇 pram
6 篇 parallel process...
6 篇 parallel archite...
6 篇 sorting
5 篇 graph algorithms
5 篇 algorithms
4 篇 performance
4 篇 computational ge...
4 篇 multithreading
4 篇 heterogeneity
4 篇 data structures
4 篇 transactional me...

机构

10 篇 carnegie mellon ...
8 篇 carnegie mellon ...
5 篇 carnegie mellon ...
4 篇 university of ma...
4 篇 univ calif berke...
4 篇 univ of paderbor...
4 篇 carnegie mellon ...
3 篇 uc berkeley unit...
3 篇 paderborn univ p...
3 篇 department of co...
3 篇 university of ma...
3 篇 mit 77 massachus...
3 篇 georgetown unive...
2 篇 duke univ durham...
2 篇 univ calif river...
2 篇 carnegie mellon ...
2 篇 univ of toronto ...
2 篇 univ calif davis...
2 篇 int comp sci ins...
2 篇 heinz nixdorf in...

作者

21 篇 blelloch guy e.
14 篇 gibbons phillip ...
9 篇 goodrich michael...
8 篇 leiserson charle...
8 篇 vishkin uzi
7 篇 tangwongsan kana...
7 篇 fineman jeremy t...
7 篇 reif john h.
6 篇 vitter jeffrey s...
6 篇 gu yan
6 篇 demmel james
5 篇 ballard grey
5 篇 sun yihan
5 篇 bender michael a...
5 篇 schwartz oded
5 篇 muthukrishnan s.
5 篇 simhadri harsha ...
5 篇 miller gary l.
5 篇 matias yossi
4 篇 karp richard m.

语言

520 篇 英文
14 篇 其他

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

共 534 条记录，以下是181-190 订阅

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

详细简洁

排序：

Lexicographic QoS scheduling for parallel I/O 05

Lexicographic QoS scheduling for parallel I/O

引用

Seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Gulati, Ajay Varman, Peter Department of Computer Science Rice University Houston TX 77005 Department of Electrical and Computer Engineering Rice University Houston TX 77005

ISBN: (纸本)9781581139860

High-end shared storage systems serving multiple independent work-loads must assure that concurrently executing clients will receive a fair or agreed-upon share of system I/O resources. In a parallel I/O system an application makes requests for specific disks at different steps of its computation depending on the data layout and its computational state. Different applications contend for disk access making the problem of maintaining fair allocation challenging. We propose a model for differentiated disk bandwidth allocation based on lexicographic minimization, and provide new efficient scheduling algorithms to allocate the I/O bandwidth fairly among contending applications. A major contribution of our model is its ability to handle multiple parallel disks and contention for disks among the concurrent applications. Analysis and simulation-based evaluation shows that our algorithms provide performance isolation, weighted allocation of resources, and are work conserving. The solutions are also applicable to other shared resource environments dealing with non-uniform heterogeneous servers. Copyright 2005 acm.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

parallel scheduling of complex dags under uncertainty 05

Parallel scheduling of complex dags under uncertainty

引用

Seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Malewicz, Grzegorz Department of Computer Science University of Alabama Tuscaloosa AL 35487 United States Division of Mathematics and Computer Science Argonne National Laboratory Argonne IL 60439 United States

ISBN: (纸本)9781581139860

This paper introduces a parallel scheduling problem where a directed acyclic graph modeling t tasks and their dependencies needs to be executed on n unreliable workers. Worker i executes task j correctly with probability p i,j. The goal is to find a regimen Σ, that dictates how workers get assigned to tasks (possibly in parallel and redundantly) throughout execution, so as to minimize expected completion time. This fundamental parallel scheduling problem arises in grid computing and project management fields, and has several practical applications. We show a polynomial time algorithm for the problem restricted to the case when dag width is at most a constant and the number of workers is also at most a constant. These two restrictions may appear to be too severe. However, they are fundamentally required. Specifically, we demonstrate that the problem is NP-hard with constant number of workers when dag width can grow, and is also NP-hard with constant dag width when the number of workers can grow. When both dag width and the number of workers are unconstrained, then the problem is inapproximable within factor less than 5/4, unless P=NP. Copyright 2005 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallelizing time with polynomial circuits 05

Parallelizing time with polynomial circuits

引用

Seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Williams, Ryan Computer Science Department Carnegie Mellon University Pittsburgh PA 15213 United States

ISBN: (纸本)9781581139860

We study the relatively old problem of asymptotically reducing the runtime of serial computations with polynomial size Boolean circuits. To the best of our knowledge, no progress on this problem has been formally reported in the literature for general computational models, although we observe that early work of Chandra, Stockmeyer, and Vishkin implies the existence of non-uniform unbounded fan-in circuits of tO(1) size and O(t/log log n) depth, for time t Turing machines. We give an algorithmic size-depth tradeoff for parallelizing time t random access Turing machines, a model at least as powerful as logarithmic cost RAMs. Our parallel simulation yields logspace-uniform tO(1) size, O(t/log t) depth Boolean circuits having semi-unbounded fan-in gates. In fact, for appropriate d, uniform tO(1)2 O(t/d) size circuits of depth O(d) can simulate time t. One corollary is that any log-cost time t RAM can be simulated by a log-cost CRCW PRAM using tO(1) processors and O(t/ log t) time. This is a major improvement over previous parallel speedups, which could only guarantee an Ω(log t) speedup with an exponential number of processors. Copyright 2005 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Collaborate with strangers to find own preferences 05

Collaborate with strangers to find own preferences

引用

Seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Awerbuch, Baruch Azar, Yossi Lotker, Zvi Patt-Shamir, Boaz Tuttle, Mark R. Dept. of Computer Science Johns Hopkins University School of Computer Science Tel Aviv University Tel Aviv 69978 Israel Kruislaan 413 CWI 1090 GB Amsterdam Netherlands Dept. of Electrical Engineering Tel Aviv University Tel Aviv 69978 Israel HP Cambridge Research Lab. One Cambridge Center Cambridge MA 02142 United States

ISBN: (纸本)9781581139860

We consider a model with n players and m objects. Each player has a "preference vector" of length m that models his grade for each object. The grades are unknown to the players. A player can learn his grade for an object by probing that object, but performing a probe incurs cost. The goal of a player is to learn his preference vector with minimal cost, by adopting the results of probes performed by other players. To facilitate communication, we assume that players collaborate by posting their grades for objects on a shared billboard: reading from the billboard is free. We consider players whose preference vectors are popular, i.e., players whose preferences are common to many other players. We present distributed and sequential algorithms to solve the problem with logarithmic cost overhead. Copyright 2005 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Weighted distributed hash tables 05

Weighted distributed hash tables

引用

Seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Schindelhauer, Christian Schomaker, Gunnar Heinz Nixdorf Institute Computer Science Department University of Paderborn Germany

ISBN: (纸本)9781581139860

We present two methods for weighted consistent hashing also known as weighted distributed hash tables. The first method, called Linear Method, combines the standard consistent hasing introduced by Karger et al. [9] with a linear weighted distance measure. By using node copies and different partitions of the hash space, the balance of this scheme approximates the fair weight relationship with high probability. The second method, called the Logarithmic Method, uses a logarithmic weighted distance between the peers and the data to find the corresponding node. For distributing one data element it provides perfect weighted balance. To provide this distribution for many data elements we use partitions to achieve a fair balance with high probability. These methods provide small fragmentation, which means that the hash space is divided into at most script O sign(n log n) intervals. Furthermore, there is an efficient data structure that assigns data elements to the nodes in expected time script O sign(log n). If small fragmentation is not an issue one can replace the use of partitions by a method we call double hash functions. This method needs script O sign(n) for assigning elements to a node, yet it can be directly used for Storage Area Networks, where the number of nodes is small compared to participating nodes in Peer-to-Peer networks. Copyright 2005 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Windows scheduling of arbitrary length jobs on parallel machines 05

Windows scheduling of arbitrary length jobs on parallel mach...

引用

Seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Bar-Noy, Amotz Ladner, Richard E. Tamir, Tami VanDegrift, Tammy Computer and Information Science Department Brooklyn College 2900 Bedford Ave. Brooklyn NY 11210 Department of Computer Science and Engineering Box 352350 University of Washington Seattle WA 98195 School of Commiter Science Interdisciplinary Center Herzliya Israel Electrical Engineering and Computer Science University of Portland 5000 N. Willamette Blvd. Portland OR 97203

ISBN: (纸本)9781581139860

The generalized windows scheduling problem for n jobs on multiple machines is defined as follows: Given is a sequence, I = 〈(w1, l 1),(w2, l2),....(wn, l n)〉 of n Pairs of positive integers that are associated with the jobs 1, 2,..., n, respectively. The processing length of job i is li slots (a slot is the processing time of one length unit). The goal is to repeatedly and non-preemptively schedule all the jobs on the fewest possible parallel machines such that the gap (window) between two consecutive executions of the first slot of. job i is at most wi slots. This problem arises in push broadcast systems in which data is transmitted on parallel channels. The problem is NP-hard even for unit-length jobs and a (1 + Ε)-approximation algorithm is known for this case by approximating the natural lower bound W(I) = Σi=1n(1/wi). The techniques used for approximating unit-length jobs cannot be applied for arbitrary-length jobs mainly because the optimal number of machines might be arbitrarily larger than the generalized lower bound W (I) = Σi=1n(l i/wi). Our main result is an 8-approximation algorithm for the generalized problem using new methods, different from those used for the unit-length case. We also present an algorithm that uses 2(1 + Ε)W(I) + log wmax machines and a greedy algorithm that is based on a new tree representation of schedules. The greedy algorithm is optimal for some special and simulations show that it performs very well in practice. Copyright 2005 acm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Decentralized algorithms using both local and random probes for p2p load balancing 05

Decentralized algorithms using both local and random probes ...

引用

Seventeenth annual acm symposium on parallelism in algorithms and architectures

作者： Kenthapadi, Krishnaram Manku, Gurmeet Singh Stanford University Google Inc.

ISBN: (纸本)9781581139860

We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (which is oblivious of its index in the sequence) choose its position on the circle by learning the positions of as few existing nodes as possible. At the same time, we desire that that the variation in arc-lengths be small. To this end, we propose a new algorithm that works as follows: The kth node chooses r random points on the circle, inspects the sizes of v arcs in the vicinity of each random point, and places itself at the mid-point of the largest arc encountered. We show that for any combination of r and v satisfying rv ≥ c log k, where c is a small constant, the ratio of the largest to the smallest arc-length is at most eight w.h.p., for an arbitrarily long sequence of n nodes. This strategy of node placement underlies a novel decentralized load-balancing algorithm that we propose for Distributed Hash Tables (DHTs) in peer-to-peer environments. Underlying the analysis of our algorithm is Structured Coupon Collection over n/b disjoint cliques with b nodes per clique, for any n, b ≥ 1. Nodes are initially uncovered. At each step, we choose d nodes independently and uniformly at random. If all the nodes in the corresponding cliques are covered, we do nothing. Otherwise, from among the chosen cliques with at least one uncovered node, we select one at random and cover an uncovered node within that clique. We show that as long as bd ≥ c log n, O(n) steps are sufficient to cover all nodes w.h.p. and each of the first Ω(n) steps succeeds in covering a node w.h.p. These results are then utilized to analyze a stochastic process for growing binary trees that are highly balanced - the leaves of the tree belong to at most four different levels with high probability. Copyright 2005 acm.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Time complexity of practical parallel Steiner point insertion algorithms 04

Time complexity of practical parallel Steiner point insertio...

引用

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

作者： Spielman, Daniel A. Teng, Shang-Hua Üngör, Alper Dept. of Mathematics Massachusets Inst. of Tech. United States Dept. of Computer Science Boston University United States Dept. of Computer Science Duke University United States

ISBN: (纸本)9781581138405

An effective method in practice to compute quality Delaunay triangulations is to apply parallel refinements that insert Steiner points whose prestars in the triangulation do not overlap. We show that these algorithms can be implemented in O(log m) time using m processors, where m is the output size. To our knowledge, this is the first such analysis.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共54页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：