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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,363 篇 会议
68 篇 期刊文献
14 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

1,189 篇 computer archite...
447 篇 hardware
377 篇 high performance...
287 篇 concurrent compu...
280 篇 computational mo...
237 篇 application soft...
231 篇 parallel process...
217 篇 computer science
213 篇 distributed comp...
186 篇 bandwidth
186 篇 costs
179 篇 field programmab...
173 篇 delay
166 篇 throughput
159 篇 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 篇 univ chicago dep...
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 篇 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 篇 chong frederic t...
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

语言

4,305 篇 英文
131 篇 其他
13 篇 中文
1 篇 法文
1 篇 葡萄牙文

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

共 4445 条记录，以下是3491-3500 订阅

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

详细简洁

排序：

performance issues of bandwidth reservations for grid computing 15

Performance issues of bandwidth reservations for grid comput...

引用

15th symposium on computer architecture and high performance computing

作者： Burchard, LO Heiss, HU De Rose, CAF Tech Univ Berlin Commun & Operating Syst Grp D-1000 Berlin Germany

ISBN: (纸本)0769520464

In general, two types of resource reservations in computer networks can be distinguished: immediate reservations which are made in a just-in-time manner and advance reservations which allow to reserve resources a long time before they are actually used. Advance reservations are especially useful for grid computing but also for a variety of other applications that require network quality-of-service, such as content distribution networks or even mobile clients, which need advance reservation to support handovers for streaming video. With the emerged MPLS standard, explicit routing can be implemented also in IP networks, thus overcoming the unpredictable routing behavior which so far prevented the implementation of advance reservation services. the impact of such advance reservation mechanisms on the performance of the network with respect to the amount of admitted requests and the allocated bandwidth has so far not been examined in detail. In this paper we show that advance reservations can lead to a reduced performance of the network with respect to both metrics. the analysis of the reasons shows a fragmentation of the network resources. In advance reservation environments, additional new services can be defined such as malleable reservations which are introduced in this paper and can lead to an increased performance of the network. Four strategies for scheduling malleable reservations are presented and compared. the results of the comparisons show that some strategies increase the resource fragmentation and are therefore unsuitable in the considered environment while others lead to a significantly better performance of the network. Besides discussing the performance issue, in this paper the software architecture of a management system for advance reservations is presented.

关键词： Application software Bandwidth computer networks Grid computing IP networks Mobile computing Multiprotocol label switching Quality of service Software architecture Streaming media

来源：评论

学校读者我要写书评

暂无评论

An evaluation of cJava system architecture 15

An evaluation of cJava system architecture

引用

15th symposium on computer architecture and high performance computing

作者： da Silva, AF Lobosco, M de Amorim, CL Univ Fed Rio de Janeiro COPPE BR-21945 Rio De Janeiro Brazil

ISBN: (纸本)0769520464

In this work, we propose a new distributed run-time environment, which we called cJava, that enables multithread Java applications to execute in clusters transparently. Our implementation of cJava supports the distributed shared memory (DSM) which required significant extensions to the original Java virtual machine (JVM). First, a distributed object manager was incorporated to the JVM's memory management subsystem for creating a global object space. Second, synchronized accesses to the global object space were extended so that they could use the lock() and unlock() primitives that cJava's DSM supports. third, cJava adapted the thread subsystem to enable remote creation and global monitors. Last, a subsystem for remote signaling was added to the original JVM. the main advantage of cJava is that it can execute existing multithread Java applications straightaway. Most importantly, our results of cJava's performance across several benchmarks show that cJava offers an efficient run-time system for executing transparently multithread Java applications in clusters.

关键词： Application software computer architecture Instruction sets Java Multiprocessing systems Programming profession Runtime Systems engineering and theory Virtual machining Yarn

来源：评论

学校读者我要写书评

暂无评论

Applying scheduling by edge reversal to constraint partitioning 15

Applying scheduling by edge reversal to constraint partition...

引用

15th symposium on computer architecture and high performance computing

作者： Pereira, MR Vargas, PK França, FMG de Castro, MCS Dutra, ID Univ Fed Rio de Janeiro COPPE BR-21945 Rio De Janeiro Brazil

ISBN: (纸本)0769520464

Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. this work uses SER to perform constraint partitioning of Constraint Satisfaction Problems (CSP). In order to apply the SER mechanism, the graph representing the constraints must receive an acyclic orientation. Since obtaining an optimal acyclic orientation is an NP-hard problem, this work studies three non-deterministic strategies known in the literature: Alg-Neigh, Alg-Edges, and Alg-Colour. We implemented the three algorithms and the SER scheduling mechanism, applying them to the CSP constraint networks generated from 3 applications. Our results show that SER has a great potential to perform a good partitioning of the constraint graphs.

关键词： Concurrent computing Distributed algorithms Distributed computing NP-hard problem Partitioning algorithms Processor scheduling Programming environments Scheduling algorithm System recovery Time factors

来源：评论

学校读者我要写书评

暂无评论

high performance floating-point unit with 116 bit wide divider

High performance floating-point unit with 116 bit wide divid...

引用

16th IEEE symposium on computer Arithmetic

作者： Gerwig, G Wetter, H Schwarz, EM Haess, J IBM Corp Server Div Armonk NY 10504 USA

ISBN: (纸本)076951894X

the next generation zSeries floating-point unit is unveiled which is the first IBM mainframe with a fused multiply-add dataflow. It supports both S/390 hexadecimal floating-point architecture and the IEEE 754 binary floating-point architecture which was first implemented in S/390 on the 1998 S/390 G5 floating-point unit. the new floating-point unit supports a total of 6 formats including single, double, and quadword formats implemented in hardware. the floating-point pipeline is 5 cycles with a throughput of 1 multiply-add per cycle. Both hexadecimal and binary floating-point instructions are capable of this performance due to a novel way of handling both formats. Other key developments include new methods for handling denormalized numbers and quad precision divide engine dataflow. this divider uses a radix-4 SRT algorithm and is able to handle quad precision divides in multiple floating-point and fixed-point formats. the number of iterations for fixed-point divisions depend on the effective number of quotient bits. It uses a reduced carry-save form for the partial remainder, with only 1 carry bit for every 4 sum bits, to save area and power.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

A BSP/CGM algorithm for computing Euler tours in graphs 15

A BSP/CGM algorithm for computing Euler tours in graphs

引用

15th symposium on computer architecture and high performance computing

作者： Cáceres, EN Nasu, CY Univ Fed Mato Grosso Sul Campo Grande MS Brazil

ISBN: (纸本)0769520464

In this paper we describe a parallel algorithm using the BSP/CGM model (Bulk Synchronous Parallel/Coarse Grained Multicomputer) to obtain the Euler tours in graphs. It is based on the PRAM (Parallel Random Access Machine) algorithm by Caceres et al. For an input graph of n vertices and m edges, the algorithm requires local computation time of O((m + n)/p), O((m + n'p) memory and O(log p) communication rounds, where p is the number of processors. To our knowledge there are no other parallel algorithms under the coarse-grained models for the Euler tours in graphs. the proposed algorithm is implemented using MPI (Message Passing Interface) and the C language. the parallel program runs on a Beowulf with 66 nodes. the implementation results confirm the theoretical complexity results of the algorithm.

关键词： Bridges Cities and towns Data structures Graph theory Message passing Parallel algorithms Phase change random access memory Rivers Search methods User-generated content

来源：评论

学校读者我要写书评

暂无评论

New parallel algorithms for frequent itemset mining in very large databases 15

New parallel algorithms for frequent itemset mining in very ...

引用

15th symposium on computer architecture and high performance computing

作者： Veloso, A Meira, W Parthasarathy, S Univ Fed Minas Gerais Dept Comp Sci Belo Horizonte MG Brazil

ISBN: (纸本)0769520464

Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of data in order to produce compact summaries or models of the database. these models are typically used to generate association rules, but recently they have also been used in far reaching domains like e-commerce and bio-informatics. Because databases are increasing in terms of both dimension (number of attributes) and size (number of records), one of the main issues in a frequent itemset mining algorithm is the ability to analyze very large databases. Sequential algorithms do not have this ability, especially in terms of run-time performance, for such very large databases. therefore, we must rely on high performance parallel and distributed computing. We present new parallel algorithms for frequent itemset mining. their efficiency is proven through a series of experiments on different parallel environments, that range from shared-memory multiprocessors machines to a set of SMP clusters connected together through a high speed network. We also briefly discuss an application of our algorithms to the analysis of large databases collected by a Brazilian web portal.

关键词： Algorithm design and analysis Association rules Data analysis Data mining Databases Distributed computing high-speed networks Itemsets Parallel algorithms Runtime

来源：评论

学校读者我要写书评

暂无评论

Finite difference simulations of the Navier-Stokes equations using parallel distributed computing 15

Finite difference simulations of the Navier-Stokes equations...

引用

15th symposium on computer architecture and high performance computing

作者： De Angeli, JP Valli, AMP Reis, NC De Souza, AF UFES Dept Informat BR-29060970 Vitoria ES Brazil

ISBN: (纸本)0769520464

this paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel computing platforms with distributed-memory, particularly for clusters of workstations. the solution algorithm for the Navier-Stokes equations utilizes an explicit scheme for pressure and an implicit scheme for velocities, i.e., the velocity field at a new time step can be computed once the corresponding pressure is known. the parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a separate processing node. All nodes then execute computations in parallel, each node on its associated subdomain. the parallel computations include initialization, coefficient generation, linear solution on the sub-domain, and inter-node communication. the exchange of information across the sub-domains, or processors, is achieved using the message passing interface standard, MPI. the use of MPI ensures portability across different computing platforms ranging from massively parallel machines to clusters of workstations. the execution time and speed-up are evaluated through comparing the performance of different numbers of processors. the results indicate that the parallel code can significantly improve prediction capability and efficiency for large-scale simulations.

关键词： Clustering algorithms Computational modeling Concurrent computing Design methodology Distributed computing Finite difference methods Fluid flow Navier-Stokes equations Numerical simulation Workstations

来源：评论

学校读者我要写书评

暂无评论

A modeling methodology and pre-run-time scheduling for embedded real-time software 15

A modeling methodology and pre-run-time scheduling for embed...

引用

15th symposium on computer architecture and high performance computing

作者： Barreto, R Maciel, P Cavalcante, S Univ Fed Amazonas UFAM DCC BR-69077000 Manaus Amazonas Brazil

ISBN: (纸本)0769520464

One of the most intricate problem in the synthesis of real-time systems is the scheduling. this paper presents a formal modeling methodology based on time Petri nets (TPN) and a framework for application-specific scheduler synthesis. Finding a feasible scheduling is not an easy task because this problem, in its general form, is NP-hard. the method proposed in this paper finds a scheduling, whether one exists, using state space exploration. the problem with this approach is the space size, which can be very large for medium to large systems. this paper shows how to minimize this problem using behavior restrictions at system modeling, and a partial-order reduction method. Additionally, the algorithm proposed for finding a feasible schedule uses a depth-first search based method. therefore, states are only generated if strictly necessary. It is verified through real-world experimental results that a schedule is found examining a reduced number of states.

关键词： Embedded computing Embedded software Modeling Petri nets Processor scheduling Real time systems Scheduling algorithm Space exploration State-space methods Timing

来源：评论

学校读者我要写书评

暂无评论

Adaptive compressed caching: Design and implementation 15

Adaptive compressed caching: Design and implementation

引用

15th symposium on computer architecture and high performance computing

作者： de Castro, RS do Lago, AP Da Silva, D Univ Sao Paulo Dept Comp Sci BR-05508 Sao Paulo Brazil

ISBN: (纸本)0769520464

In this paper, we reevaluate the use of adaptive compressed caching in order to improve system performance through reduction of accesses to the backing stores. We propose a new and simple adaptability policy that adjusts the compressed cache size on-the-fly, and evaluate a compressed caching system with this policy through an implementation in a widely used operating system, Linux. We also redesign compressed caching in order to provide performance improvements for all tested workloads and address the problems faced in previous works and implementations that led to non-conclusive results. Among these fundamental modifications, our compressed cache is the first one to also compress file cache pages, to adaptively disable compression of clean pages when necessary and to address applications with poor compressibility. We tested a system with our adaptive compressed cache under many applications and benchmarks, each one with different memory pressures. the results showed performance improvements (up to 171.4%) in all of them if under memory pressure, and minimal overhead (up to 0.39%) when there is very light memory pressure. We believe this work shows that this adaptive compressed cache design should be actually considered as an effective mechanism for improvement in system performance.

关键词： Adaptive systems Benchmark testing computer science Data compression Hard disks Kernel Linux Operating systems System performance System testing

来源：评论

学校读者我要写书评

暂无评论

Efficient Data Allocation for a Cluster of Workstations 16

Efficient Data Allocation for a Cluster of Workstations

引用

16th International Conference on Parallel and Distributed computing Systems, PDCS 2003

作者： Mohamed, Ahmed M. Ammar, Reda A. Lipsky, Lester Dept. of Computer Science and Engineering University of Connecticut StorrsCT06269 United States

ISBN: (纸本)9781618398161

the development and use of cluster based computing is increasingly becoming an effective approach for solving high performance computing problems. the trend of moving away from specialized traditional supercomputing platforms such as Cray / SGI T3E to cheap and general-purpose systems consisting of loosely coupled components is expected to continue. In [1], we presented an analytical model for evaluating the performance of such platforms. the model covers the effect of storage limitations, interconnection networks and the impact of data partitioning and allocation. the model can also detect the bottlenecks in the system, which can lead to a more effective utilization of the available resources. In this paper, we use our model to find the best data allocation method that maximizes the throughput of the system based on the cluster architecture. © PDCS 2003. All rights reserved.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共445页 << < 346 347 348 349 350 351 352 353 354 355 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：