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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,356 篇 会议
65 篇 期刊文献
14 册 图书

馆藏范围

4,435 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,490 篇 工学
- 2,306 篇 计算机科学与技术...
- 1,055 篇 软件工程
- 489 篇 电气工程
- 428 篇 信息与通信工程
- 191 篇 电子科学与技术（可...
- 122 篇 控制科学与工程
- 102 篇 网络空间安全
- 89 篇 动力工程及工程热...
- 73 篇 生物工程
- 48 篇 机械工程
- 47 篇 生物医学工程（可授...
- 42 篇 光学工程
- 34 篇 建筑学
- 30 篇 材料科学与工程（可...
- 22 篇 仪器科学与技术
- 22 篇 土木工程
- 22 篇 化学工程与技术
602 篇 理学
- 426 篇 数学
- 95 篇 物理学
- 83 篇 生物学
- 68 篇 系统科学
- 61 篇 统计学（可授理学、...
- 23 篇 化学
338 篇 管理学
- 252 篇 管理科学与工程(可...
- 139 篇 工商管理
- 100 篇 图书情报与档案管...
60 篇 医学
- 45 篇 临床医学
- 37 篇 基础医学(可授医学...
39 篇 经济学
- 39 篇 应用经济学
38 篇 法学
- 33 篇 社会学
11 篇 教育学
11 篇 农学
6 篇 文学
1 篇 艺术学

主题

1,186 篇 computer archite...
446 篇 hardware
374 篇 high performance...
287 篇 concurrent compu...
280 篇 computational mo...
237 篇 application soft...
231 篇 parallel process...
217 篇 computer science
202 篇 distributed comp...
186 篇 bandwidth
186 篇 costs
183 篇 field programmab...
166 篇 throughput
166 篇 delay
163 篇 cloud computing
156 篇 grid computing
139 篇 computer network...
138 篇 resource managem...
133 篇 laboratories
124 篇 scalability

机构

16 篇 university of ch...
12 篇 school of comput...
12 篇 institute of com...
8 篇 department of co...
8 篇 georgia inst tec...
8 篇 barcelona superc...
8 篇 school of comput...
8 篇 carnegie mellon ...
8 篇 mathematics and ...
8 篇 intel corporatio...
7 篇 department of el...
7 篇 college of compu...
7 篇 univ illinois ur...
7 篇 computer systems...
7 篇 univ chicago dep...
7 篇 department of co...
7 篇 mathematics and ...
7 篇 intel corp santa...
7 篇 univ fed rio gra...
6 篇 univ toronto on

作者

13 篇 navaux philippe ...
11 篇 d.k. panda
9 篇 viktor k. prasan...
9 篇 prasanna viktor ...
9 篇 mutlu onur
9 篇 i. foster
8 篇 dhabaleswar k. p...
8 篇 dongarra jack
8 篇 guedes dorgival
7 篇 borin edson
7 篇 cristal adrian
7 篇 loh gabriel h.
7 篇 kim nam sung
7 篇 zhou huiyang
7 篇 panda dhabaleswa...
7 篇 magoules frederi...
7 篇 ferreira renato
7 篇 xiaowei li
7 篇 buyya rajkumar
6 篇 p.o.a. navaux

语言

4,316 篇 英文
110 篇 其他
13 篇 中文
1 篇 法文
1 篇 葡萄牙文

检索条件"任意字段=16th Symposium on Computer Architecture and High Performance Computing"

共 4435 条记录，以下是3821-3830 订阅

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

详细简洁

排序：

Compression-domain parallel rendering

Compression-domain parallel rendering

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： T. Mitra Tzi-cker Chiueh School of Computing National University of Singapore Singapore Department of Computer Science State University of New York Stony Brook Stony Brook NY USA

the 3D triangle mesh is the dominant representation used in the parallel rendering of 3D geometric models. However, the explosive growth in the complexity of the mesh-based 3D models overwhelms the communication bandwidth of existing parallel rendering systems. An effective solution to this problem is to use a compressed mesh representation. In recent years, researchers have shown a great deal of interest in developing highly efficient mesh compression algorithms. However, using a compressed mesh in a parallel rendering architecture to achieve the highest possible end-to-end performance is a largely unexplored area. We have previously (1998, 2000) developed an efficient mesh compression/decompression algorithm, called "breadth-first traversal" (BFT). In this paper, we design and implement a parallel rendering architecture that can use a BFT mesh representation. the enabling technology is a novel algorithm that can perform a compression-domain subdivision of the BFT mesh for bandwidth-efficient distribution of submeshes to parallel processors. Parallel rendering using a BFT mesh reduces the communication requirement to about one third of that of uncompressed representation.

关键词： Tiles Compression algorithms Rendering (computer graphics) Pipelines Graphics Sorting Concurrent computing Image converters computer science Solid modeling

来源：评论

学校读者我要写书评

暂无评论

A high performance algorithm for incompressible flows using local solenoidal functions 16

A high performance algorithm for incompressible flows using ...

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Sambavaram, S.R. Sarin, V. Department of Computer Science Texas A and M University College StationTX77843 United States

ISBN: (纸本)0769515738

the convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number;time step and the mesh width. this paper presents a class of algorithms to solve these linear systems using local solenoidal functions. An optimal preconditioner is described via an iterative method to solve the resulting reduced system. this paper also suggests inexpensive parallel matrix-vector products using bounded buffers for interprocessor communication. Experimental results for a three dimensional problem show that the preconditioning step need not be solved accurately at each iteration, thereby decreasing the time spent in the potentially expensive routine. these experiments also show that the proposed algorithm assures a constant rate of convergence across the range of flow parameter variation. Scalability of the algorithm is suggested by the experiments on the SGI Origin 2000. © 2002 IEEE.

关键词： computational fluid dynamics divergence-free iterative methods linear system parallel performance preconditioners

来源：评论

学校读者我要写书评

暂无评论

Nonblocking k-fold multicast networks 16

Nonblocking k-fold multicast networks

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Yang, Yuanyuan Wang, Jianchao Dept. of Electrical and Computer Engineering State University of New York at Stony Brook Stony BrookNY11794 United States DataTreasury Corporation MelvilleNY11747 United States

ISBN: (纸本)0769515738

Multicast communication involves transmitting information from a single source to multiple destinations, and is a requirement in high-performance networks. Current trends in networking applications indicate an increasing demand in future networks for multicast capability. Many multicast applications require not only multicast capability but also predictable communication performance, such as guaranteed multicast latency and bandwidth. In this paper, we present a design for a nonblocking k-fold multicast network, in which any destination node can be involved in up to k simultaneous multicast connections in a nonblocking manner. We also develop an efficient routing algorithm for the network. As can be seen, a k-fold multicast network has significantly lower network cost than that of k copies of 1-fold multicast networks and is a cost-effective choice for supporting arbitrary multicast communication. © 2002 IEEE.

关键词： Multicast communication nonblocking quality-of-service (QoS) routing switch-based networks switching networks

来源：评论

学校读者我要写书评

暂无评论

A realistic model and an efficient heuristic for scheduling with heterogeneous processors

A realistic model and an efficient heuristic for scheduling ...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： O. Beaumont V. Boudet Y. Robert LIP UMR CNRS-ENS Lyon-INRIA Lyon France

Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous resources. Moreover, these heuristics often rely on a model where the number of processors is bounded but where the communication capabilities of the target architecture are not restricted. In this paper, we deal with a more realistic model for heterogeneous networks of workstations, where each processor can send and/or receive at most one message at any given time-step. First, we state a complexity result that shows that the model is at least as difficult as the standard one. then, we show how to modify classical list scheduling techniques to cope with the new model. Next we introduce a new scheduling heuristic which incorporates load-balancing criteria into the decision process of scheduling and mapping ready tasks. Experimental results conducted using six classical testbeds (LAPLACE, LU, STENCIL, FORK-JOIN, DOOLITTLE, and LDMt) show very promising results.

关键词： Processor scheduling Delay Electronic mail computer architecture Workstations System testing Communication networks Distributed processing

来源：评论

学校读者我要写书评

暂无评论

the IBiCGStab method on bulk synchronous parallel architectures

The IBiCGStab method on bulk synchronous parallel architectu...

引用

IEEE International symposium on high performance computing Systems and Applications (HPCS)

作者： L.T. Yang R.E. Shaw Department of Computer Science Saint Francis Xavier University Antigonish NS Canada Department of Computer Science University of New Brunswick Saint John Saint John's NB Canada

In this paper, an improved version of the BiCGStab method for the solutions of large and sparse linear systems of equations with unsymmetric coefficient matrices is proposed. the method combines elements of numerical stability and parallel algorithm design without increasing the computational costs. the algorithm is derived such that all inner products of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time of vector updates. therefore, the cost of global communication can be significantly reduced. In this paper, the bulk synchronous parallel (BSP) model is used to design a fully efficient, scalable and portable parallel proposed algorithm and to provide accurate performance prediction of the algorithm for a wide range of architectures including the Cray T3D, the Parsytec, and a cluster of workstations connected by an Ethernet. this performance model provides us useful insight in the time complexity of the method using only a few system dependent parameters based on a simple and accurate cost modelling. the theoretical performance prediction are compared with some preliminary measured timing results of a numerical application from ocean flow simulation.

关键词： Parallel architectures Algorithm design and analysis Costs Predictive models Clustering algorithms Linear systems Equations Sparse matrices Numerical stability Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

the self-tuning dynP job-scheduler 16

The self-tuning dynP job-scheduler

引用

16th International Parallel and Distributed Processing symposium, IPDPS 2002

作者： Streit, A. PC2 - Paderborn Center for Parallel Computing Paderborn University Paderborn33102 Germany

ISBN: (纸本)0769515738

In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. the performance of the used scheduling policies (e.g. FCFS, SJF, LJF) depends on the characteristics of the queued jobs. Hence we developed the dynP scheduler family. the basic idea was to change between different scheduling policies during runtime. the basic dynP scheduler uses the average estimated runtime of all queued jobs together with two input parameters to decide when a policy change may be benefical. A disadvantage is that the performance of the basic dynP scheduler strongly depends on the right setting of the two input parameters. therefore we present the self-tuning dynP scheduler, which is totally independent from any parameter values. the basic concept is that the self-tuning dynP scheduler computes the full (virtual) schedule for each of the three policies in every scheduling step. Each computed schedule is rated by a criterion. then the scheduler switches to that policy which generated the best schedule for the currently queued jobs. In this paper we are using simulations with trace based job sets to evaluate the performance of the scheduler. the achieved results are reasonably good compared to the parameterized dynP variant and the basic policies FCFS, SJF, and LJF. © 2002 IEEE.

关键词： evaluation HPC-cluster job-scheduling self-tuning simulation

来源：评论

学校读者我要写书评

暂无评论

Memory-intensive benchmarks: IRAM vs. cache-based machines

Memory-intensive benchmarks: IRAM vs. cache-based machines

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： B.R. Gaeke P. Husbands X.S. Li L. Oliker K.A. Yelick R. Biswas Computer Science Division University of California Berkeley CA USA NERSC Berkeley CA USA NAS Division NASA Ames Research Center Moffett Field CA USA

the increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive benchmarks to evaluate a mixed logic and DRAM processor called VIRAM as a building block for scientific computing. For each benchmark, we explore the fundamental hardware requirements of the problem as well as alternative algorithms and data structures that can help expose fine-grained parallelism or simplify memory access patterns. Results indicate that VIRAM is significantly faster than conventional cache-based machines for problems that are truly limited by the memory system and that it has a significant power advantage across all the benchmarks.

关键词： Bandwidth Random access memory Registers Parallel processing Application software Hardware Arithmetic Process design Scientific computing computer architecture

来源：评论

学校读者我要写书评

暂无评论

A reliability-aware value-based scheduler for dynamic multiprocessor real-time systems

A reliability-aware value-based scheduler for dynamic multip...

引用

International symposium on Parallel and Distributed Processing (IPDPS)

作者： S. Swaminathan G. Manimaran Dependable Computing & Networking Laboratory Dept of Electrical and Computer Engineering Iowa State University Ames IA USA

来源：评论

学校读者我要写书评

暂无评论

Irregular assignment computations on cc-NUMA multiprocessors

Irregular assignment computations on cc-NUMA multiprocessors

引用

4th International symposium on high performance computing, ISHPC 2002

作者： Arenaz, Manuel Tourino, Juan Doallo, Ramon Computer Architecture Group Department of Electronics and Systems University of A Coruña Campus de Elviña s/n A Coruña15071 Spain

ISBN: (纸本)354043674X

this paper addresses the parallelization of loops with irregular assignment computations on cc-NUMA multiprocessors. this loop pattern is distinguished by the existence of loop-carried output data dependences that can only be detected at run-time. A parallelization technique based on the inspector-executor model is proposed in this paper. In the inspector, loop iterations are reordered so that they can be executed in a conflict-free manner during the executor stage. the design of the inspector ensures load-balancing and uniprocessor data write locality exploitation. Experimental results show the scalability of this technique, which is presented as a clear alternative to other existing methods. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

An enhanced scheduling approach in a distributed parallel environment using mobile agents

An enhanced scheduling approach in a distributed parallel en...

引用

IEEE International symposium on high performance computing Systems and Applications (HPCS)

作者： M.A.R. Dantas J.G.R.C. Lopes T.G. Ramos Department of Computer Science University of Brasilia Brasilia Brazil

Our goal is to apply mobile agent technology to provide a better scheduling for MPI applications executing in a cluster configuration. this approach could represent in a distributed cluster environment an enhancement on the load balancing of the parallel processes. MPI in a cluster of heterogeneous machines could lead parallel programmers to obtain frustrated results, mainly because of the lack of an even distribution of the workload in the cluster. As a result, before submitting a MPI application to a cluster, we use our JOTA mobile agent approach to acquire a more precise information of machine's workload. therefore, with a more precise knowledge of the load and characteristics in each machine, we are ready to gather lightweight workstations to form a cluster. Our empirical results indicate that it is possible to spend less elapsed time when considering the execution of a parallel application using the agent approach in comparison to an ordinary MPI environment.

关键词： Mobile agents Application software Workstations Packaging Processor scheduling Software packages Load management Programming profession Microcomputers throughput

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共444页 << < 379 380 381 382 383 384 385 386 387 388 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：