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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

416 篇 会议
20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

306 篇 工学
- 299 篇 计算机科学与技术...
- 192 篇 软件工程
- 31 篇 电气工程
- 27 篇 信息与通信工程
- 20 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 4 篇 农业工程
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 建筑学
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
172 篇 理学
- 165 篇 数学
- 25 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 1 篇 化学
16 篇 管理学
- 13 篇 管理科学与工程(可...
- 11 篇 工商管理
- 3 篇 图书情报与档案管...
6 篇 农学
- 6 篇 作物学
- 2 篇 农业资源与环境
1 篇 经济学
- 1 篇 应用经济学

主题

92 篇 parallel algorit...
81 篇 parallel process...
14 篇 parallel program...
13 篇 computer program...
10 篇 computer archite...
10 篇 scheduling
8 篇 computer systems...
8 篇 pram
7 篇 parallel process...
6 篇 parallel archite...
5 篇 graph algorithms
5 篇 multithreading
4 篇 performance
4 篇 approximation al...
4 篇 computational ge...
4 篇 bandwidth
4 篇 processor schedu...
4 篇 pipeline process...
4 篇 transactional me...
4 篇 concurrency

机构

11 篇 carnegie mellon ...
4 篇 univ maryland de...
4 篇 carnegie mellon ...
4 篇 univ of paderbor...
3 篇 carnegie mellon ...
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 篇 dipartimento di ...
2 篇 dept. of compute...
2 篇 at and t bell la...
2 篇 sandia national ...
2 篇 ibm t.j. watson ...
2 篇 computer science...
2 篇 univ of californ...
2 篇 department of ma...

作者

12 篇 blelloch guy e.
12 篇 gibbons phillip ...
6 篇 reif john h.
6 篇 leiserson charle...
5 篇 muthukrishnan s.
5 篇 goodrich michael...
5 篇 matias yossi
4 篇 uzi vishkin
4 篇 ramachandran vij...
4 篇 tangwongsan kana...
4 篇 vitter jeffrey s...
4 篇 simhadri harsha ...
4 篇 gu yan
4 篇 phillip b. gibbo...
3 篇 snir marc
3 篇 tarjan robert e.
3 篇 cormen thomas h.
3 篇 dhulipala laxman
3 篇 deng xiaotie
3 篇 monien burkhard

语言

422 篇 英文
14 篇 其他

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

共 436 条记录，以下是231-240 订阅

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

详细简洁

排序：

MediaBench: A tool for evaluating and synthesizing multimedia and communications systems

MediaBench: A tool for evaluating and synthesizing multimedi...

引用

30th annual IEEE/acm International symposium on Microarchitecture (MICRO-30)

作者： Lee, CH Potkonjak, M Mangione-Smith, WH Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90024 USA

ISBN: (纸本)0818679778

Over the last decade, significant advances have been made in compilation technology for capitalizing on instruction-level parallelism (ILP). The vast majority of ILP compilation research has been conducted in the context of general-purpose computing, and more specifically the SPEC benchmark suite. At the same time, number of microprocessor architectures have emerged which have VLIW and SIMD structures that are well matched to the needs of the ILP compilers. Most of these processors are targeted at embedded applications such as multimedia and communications, rather than general-purpose systems. Conventional wisdom, and a history of hand optimization of inner-loops, suggests that ILP compilation techniques are well suited to these applications. Unfortunately, there currently exists a gap between the compiler community and embedded applications developers. This paper presents MediaBench, a benchmark suite that has been designed to fill this gap. This suite has been constructed through a three-step process: intuition and market driven initial selection, experimental measurement to establish uniqueness, and integration with system synthesis algorithms to establish usefulness.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimal weighted loop fusion for parallel programs 97

Optimal weighted loop fusion for parallel programs

引用

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

作者： Megiddo, Nimrod Sarkar, Vivek IBM Almaden Research Cent CA San Jose United States

ISBN: (纸本)9780897918909

Much of the computation involved in parallel programs occurs within loops, either nested loops as in parallel scientific applications or collections of loops as in stream-based applications. Loop fusion is a well-known program transformation that has shown to be effective in improving data locality in parallel programs by reducing inter-processor communication and improving register and cache locality. Weighted loop fusion is the problem of finding a legal partition of loop nests into fusible clusters so as to minimize the total inter-cluster weights. The loop nests may contain parallel or sequential loops;care is taken to ensure that a parallel loop does not get serialized after fusion. It has been shown in past work that the weighted loop fusion problem is NP-hard. Despite the NP-hardness property, we show how optimal solutions can be found efficiently (i.e., within the compile-time constraints of a product-quality optimizing compiler) for weighted loop fusion problem sizes that occur in practice. In this paper, we present an integer programming formulation for weighted loop fusion with size (number of variables and constraints) that is linearly proportional to the size of the input weighted loop fusion problem. The linear-sized formulation is key to making the execution time small enough for use in a product-quality optimizing compiler, since the natural integer programming formulation for this problem has cubic size for which the execution time would be too large to be practical. The linear-sized integer programming formulation can be solved efficiently using any standard optimization package but we also present a custom branch-and-bound algorithm that can be used if greater efficiency is desired. A prototype implementation of this approach has been completed, and preliminary compile-time measurements are included in the paper as validation of the practicality of this approach.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds

Approximation algorithms for precedence-constrained scheduli...

引用

proceedings of the 1996 8th annual acm-SIAM symposium on Discrete algorithms

作者： Chudak, Fabian A. Shmoys, David B. Cornell Univ Ithaca United States

We present new approximation algorithms for the problem of scheduling precedence-constrained jobs on parallel machines that are uniformly related. That is, there are n jobs and m machines;each job j requires pj units of processing, and is to be processed on one machine without interruption;if it is assigned to machine i, which runs at a given speed si, it takes pj/si time units. There also is a partial order max = maxjCj, where Cj denotes the completion time of job j, and ∑j wjCj, where wj is a weight that is given for each job j. For the first objective, the best previously known result is an O(√m)-approximation algorithm, which was shown by Jaffe more than 15 years ago. We shall give an O(log m)-approximation algorithm. We shall also show how to extend this result to obtain an O(log m)-approximation algorithm for the second objective, albeit with a somewhat larger constant. These results also extend to settings in which each job j has a release date rj before which the job may not begin processing. In addition, we obtain stronger performance guarantees if there are a limited number of distinct speeds. Our results are based on a new linear programming-based technique for estimating the speed at which each job should be run, and a variant of the list scheduling algorithm of Graham that can exploit this additional information.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A parallel and fault-tolerant LAN with dual communication subnetworks

A parallel and fault-tolerant LAN with dual communication su...

引用

2nd AIZU International symposium on parallel algorithms/Architecture Synthesis

作者： Wang, HQ Yin, ZL Wang, D Department of Computer and Information Science Harbin Engineering of Technology Harbin China

ISBN: (纸本)0818678704

In this paper a parallel and fault-tolerant LAN (P_FTLAN) with dual communication subnetworks is presented to improve LANs' reliability. Its function modes, technical characters, hardware and software architectures and some key, implementation techniques, such as logical addresses and parallel mechanisms, are described in details. Our prototype system and analyzing results suggest that the scheme presented in the paper not only provides an effective approach to high reliable LANs, but also can improve their performance greatly.

关键词： parallel P_FTLAN LAN reliability fault-tolerant dual communication subnetworks

来源：评论

学校读者我要写书评

暂无评论

SCL-Chan: An asynchronous data-parallel language for irregular algorithms

SCL-Chan: An asynchronous data-parallel language for irregul...

引用

2nd International Workshop on High-Level parallel Programming Models and Supportive Environments / 11th International parallel Processing symposium

作者： Melin, E Raffin, B Rebeuf, X Virot, B LIFO - IIIA Universite d'Orleans Orleans France

ISBN: (纸本)0818678836

parallelism suffers from a lack of programming languages both simple to handle and able to take advantage of the power of present parallel computers. If parallelism expression is too high level, compilers have to perform complex optimizations leading often to poor performances. One the other hand, too low level parallelism transfers difficulties reward the programmer. In this paper, we propose a new programming language that integrates both a synchronous data-parallel progamming model and an asynchronous execution model. The synchronous data-parallel programming model allows a safe program designing. The asynchronous execution model yields an efficient execution on present MIMD architectures without any program transformation. Our language relies on a logical instruction ordering exploited by specific send/receive communications. It allows to express only the effective data dependences between processors. This ability is enforced by a possible send/receive unmatching useful for irregular algorithms. A sparse vector computation exemplifies our language potentialities.

关键词： design of parallel programming languages synchronous and data-parallel programming model asynchronous execution model structural clock irregular algorithm

来源：评论

学校读者我要写书评

暂无评论

Allocating weighted jobs in parallel 97

Allocating weighted jobs in parallel

引用

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

作者： Berenbrink, Petra auf der Heide, Friedhelm Meyer Schroeder, Klaus Univ Paderborn Paderborn Germany

ISBN: (纸本)9780897918909

It is well known that after placing m≥n balls independently and uniformly at random (i.u.r.) into n bins, the fullest bin contains Θ(log n/log log n+m/n) balls, with high probability. It is also known (see [Ste96]) that a maximum load of O (m/n) can be obtained for all m≥n if a ball is allocated in one (suitably chosen) of two (i.u.r.) bins. Stemann ([Ste96]) shows that r communication rounds suffice to guarantee a maximum load of max {r√log n, O (m/n)}, with high probability. In particular, O(log log n) communication rounds suffice to guarantee optimal load O(m/n) for m≥n, with high probability. Adler et al. have shown in [acmR95] that Stemanns protocol is optimal for constant r. In this paper we extend the above results in two directions: We generalize the lower bound to arbitrary r≤log log n. This implies that the result of Stemanns protocol is optimal for all r. Our main result is a generalization of Stemanns upper bound to weighted jobs: Let WA (WM) denote the average (maximum) weight of the balls. Further let Δ = WA/WM. Note that the maximum load is at least Ω(m/n·WA+WM). We present a protocol that achieves maximum load of γ·(m/n·WA+WM) using O (log log n/log(γ·((m/n)·Δ+1))) rounds of communication. For uniform weights this matches the results of Stemann. In particular, for log log n rounds we achieve optimal load of O (m/n·WA+WM). Using this lower bound it is also shown that our algorithm is optimal in the case of weighted balls for various degrees of uniformity. All the balls into bins games model Load Balancing problems: The balls are jobs, the bins are resources, the task is to allocate the jobs to the resources so that they are evenly distributed. From this interpretation, considering weighted balls is very important because the weights may e.g. model the runtime of jobs. Applications of such Load Balancing problems occur e.g. for client-server networks and for Multimedia-Servers using disk arrays.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Approximating total flow time on parallel machines 97

Approximating total flow time on parallel machines

引用

proceedings of the 1997 29th annual acm symposium on Theory of Computing

作者： Leonardi, Stefano Raz, Danny Universita di Roma `La Sapienza' Rome Italy

ISBN: (纸本)9780897918886

We consider the problem of optimizing the total flow time a stream of jobs that are released over time in a multi-processor setting. This problem is NP-hard even when we allow preemption, and have only two machines. Although the total (or average) flow time is widely accepted as a good measurement of the overall quality of service, no approximation algorithms were known for this basic scheduling problem. This paper contains two main results. We first prove that when preemption is allowed, Shortest Remaining Processing Time (SRPT) is an O(log(min{n/m, P})) approximation algorithm for the total flow time, where n is the number of jobs, m is the number of machines, and P is the ratio between the maximum and the minimum processing time of a job. We also provide an Ω(log n/m) and an Ω(log P) lower bounds on the (worst case) competitive ratio of any randomized algorithm for the on-line problem in which jobs are known at their release times. Thus, we show that up to a constant factor SRPT is an optimal on-line algorithm. Our second main result addresses the non-preemptive case. We present a general technique that allows to transform any preemptive solution into a non-preemptive solution at the expense of an O(√n/m) factor in the approximation ratio of the total flow time. Combining this technique with our previous result yields an O(√n/m log n/m) approximation algorithm for this case. We also show an Ω(n1/3-Ε) lower bound on the approximability of this problem (assuming P≠NP).

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A localized algorithm for parallel association mining 97

A localized algorithm for parallel association mining

引用

proceedings of the ninth annual acm symposium on parallel algorithms and architectures

作者： Mohammed Javeed Zaki Srinivasan Parthasarathy Wei Li Department of Computer Science University of Rochester Rochester NY

来源：评论

学校读者我要写书评

暂无评论

Can shared-memory model serve as a bridging model for parallel computation? 97

Can shared-memory model serve as a bridging model for parall...

引用

proceedings of the ninth annual acm symposium on parallel algorithms and architectures

作者： Phillip B. Gibbons Yossi Matias Vijaya Ramachandran Bell Laboratories Lucent Technologies 600 Mountain Ave. Murray Hill NJ Dept. of Computer Sciences University of Texas at Austin Austin TX

来源：评论

学校读者我要写书评

暂无评论

Modeling parallel bandwidth: local vs. global restrictions 97

Modeling parallel bandwidth: local vs. global restrictions

引用

proceedings of the ninth annual acm symposium on parallel algorithms and architectures

作者： Micah Adler Phillip B. Gibbons Vijaya Ramachandran Yossi Matias Heinz Nixdorf Institute Room F1-119 Fürstenallee 11 D-33102 Paderborn Germany Bell Laboratories Lucent Technologies 600 Mountain Ave. Murray Hill NJ Dept. of Computer Sciences University of Texas at Austin Austin TX

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共44页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：