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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

768 篇 会议
27 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

384 篇 工学
- 362 篇 计算机科学与技术...
- 194 篇 软件工程
- 58 篇 信息与通信工程
- 51 篇 电气工程
- 27 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 材料科学与工程（可...
- 7 篇 安全科学与工程
- 7 篇 网络空间安全
- 4 篇 生物医学工程（可授...
- 3 篇 光学工程
- 3 篇 动力工程及工程热...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 冶金工程
- 2 篇 土木工程
- 2 篇 交通运输工程
101 篇 理学
- 95 篇 数学
- 18 篇 统计学（可授理学、...
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
72 篇 管理学
- 51 篇 管理科学与工程(可...
- 38 篇 工商管理
- 24 篇 图书情报与档案管...
8 篇 经济学
- 8 篇 应用经济学
7 篇 医学
- 7 篇 临床医学
- 2 篇 基础医学(可授医学...
3 篇 法学
- 3 篇 社会学
1 篇 教育学
1 篇 文学
1 篇 农学
1 篇 军事学

主题

121 篇 computer science
94 篇 concurrent compu...
94 篇 distributed comp...
83 篇 distributed data...
79 篇 parallel process...
78 篇 application soft...
76 篇 databases
74 篇 database systems
73 篇 parallel process...
55 篇 delay
53 篇 distributed comp...
52 篇 processor schedu...
45 篇 computer archite...
43 篇 transaction data...
41 篇 algorithm design...
40 篇 costs
39 篇 relational datab...
35 篇 protocols
34 篇 computational mo...
33 篇 hardware

机构

6 篇 ibm thomas j. wa...
5 篇 ieee
4 篇 school of comput...
4 篇 department of co...
4 篇 department of co...
3 篇 center for paral...
3 篇 department of co...
3 篇 lip ens-lyon lyo...
3 篇 department of co...
2 篇 department of co...
2 篇 institute of inf...
2 篇 department of co...
2 篇 institute of inf...
2 篇 computer systems...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of el...
2 篇 department of co...
2 篇 school of comput...

作者

7 篇 a. choudhary
6 篇 a. boukerche
5 篇 j. saltz
4 篇 s.k. das
4 篇 t. kurc
4 篇 a. el abbadi
3 篇 a. rau-chaplin
3 篇 o. wolfson
3 篇 f. dehne
3 篇 p.s. yu
3 篇 a. singh
3 篇 casanova henri
3 篇 c. liu
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 d. agrawal
3 篇 x. shen
2 篇 grove matthew
2 篇 a. burger

语言

792 篇 英文
4 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是311-320 订阅

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

详细简洁

排序：

A numerical study of some parallel algebraic preconditioners

A numerical study of some parallel algebraic preconditioners

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Cai, Xing Sosonkina, Masha Simula Research Laboratory University of Oslo P.O. Box 1080 Blindern Oslo0316 Norway University of Minnesota DuluthMN55812 United States

ISBN: (纸本)0769519261

We present a numerical study of several parallel algebraic preconditioners, which speed up the convergence of Krylov iterative methods when solving large-scale linear systems. The studied algebraic preconditioners are of two types. The first type includes simple block preconditioners using incomplete factorizations or preconditioned Krylov solvers on the subdomains. The second type is an enhancement of the first type in that Schur complement techniques are added to treat subdomain-interface unknowns. The numerical experiments show that the scalability properties of the preconditioners are highly problem dependent, and a simple Schur complement technique is favorable for achieving good overall efficiency. © 2003 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

GridBank: A Grid Accounting Services Architecture (GASA) for distributed systems sharing and integration

GridBank: A Grid Accounting Services Architecture (GASA) for...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Barmouta, Alexander Buyya, Rajkumar Dept. of Computer Science and Software Engineering University of Western Australia NedlandsWA6009 Australia Lab Dept. of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)0769519261

Computational Grids are emerging as a new infrastructure for Internet-based parallel and distributed computing. They enable the sharing, exchange, discovery, and aggregation of resources distributed across multiple administrative domains, organizations and enterprises. To accomplish this, Grids need infrastructure that supports various services: security, uniform access, resource management, scheduling, application composition, computational economy, and accounting. Although several initiatives are engaged in the development of Grid technologies, Grid accounting issues are yet to be addressed. To overcome this limitation, we propose a new infrastructure called GridBank that provides services for accounting. The support of computational economy and accounting services can lead to a self-regulated accountability in Grid computing. This paper presents requirements of Grid accounting and different economic models within which it can operate and proposes a Grid Accounting Services Architecture to meet them. The paper highlights implementation issues with a detailed discussion on the format for various records/databases that the GridBank needs to maintain. It also presents protocols for interaction between the GridBank and various components within Grid computing environments. © 2003 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

A general framework for searching in distributed data repositories

A general framework for searching in distributed data reposi...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Bakiras, Spiridon Kalnis, Panos Loukopoulos, Thanasis Ng, Wee Siong Department of Electrical and Electronic Engineering University of Hong Kong Pokfulam Road Hong Kong Hong Kong School of Computing National University of Singapore 3 Science Drive 2 Singapore117543 Singapore Department of Computer Science Hong Kong University of Science and Technology Clearwater Bay Hong Kong

ISBN: (纸本)0769519261

This paper proposes a general framework for searching large distributed repositories. Examples of such repositories include sites with music/video content, distributed digital libraries, distributed caching systems, etc. The framework is based on the concept of neighborhood;each client keeps a list of the most beneficial sites according to past experience, which are visited first when the client searches for some particular content. Exploration methods continuously update the neighborhoods in order to follow changes in access patterns. Depending on the application, several variations of search and exploration processes are proposed. Experimental evaluation demonstrates the benefits of the framework in different scenarios. © 2003 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Several parallel algorithms for solving nonlinear systems with symmetric and positive definite Jacobians

Several parallel algorithms for solving nonlinear systems wi...

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Peinado, Jesús Vidal, Antonio M. Departamento de Sistemas Informáticos y Computación Universidad Politécnica de Valencia Apartado 22012 Valencia46071 Spain

ISBN: (纸本)0769519261

In this work we describe two sequential algorithms and their parallel counterparts for solving nonlinear systems, when the Jacobian matrix is symmetric and positive definite. This case appears frequently in unconstrained optimization problems. Both algorithms are based on Newton's method. The first solves the inner iteration with Cholesky decomposition while the second is based on the inexact Newton methods family, where a preconditioned CG method has been used for solving the linear inner iteration. In this latter case and to control the inner iteration as far as possible and avoid the oversolving problem, we also parallelized several forcing term criteria and used parallel preconditioning techniques. We implemented the parallel algorithms using the SCALAPACK library. Experimental results have been obtained using a cluster of Pentium II PC connected through a Myrinet network. To test our algorithms we used four different problems. The algorithms show good scalability in most cases. © 2003 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance modeling for entity-level simulations

Performance modeling for entity-level simulations

引用

international parallel and distributed Processing symposium, IPDPS 2003

作者： Su, Alan Berman, Fran Casanova, Henri Computer Science and Engineering Department University of California San Diego United States San Diego Supercomputer Center University of California San Diego United States

ISBN: (纸本)0769519261

Advances across many fields of study are driving changes in the basic nature of scientific computing applications. Scientists have recognized a growing need to study phenomena by explicitly modeling interactions among individual entities, rather than by simply modeling approximate collective behavior. This entity-level approach has emerged as a promising new direction in a number of scientific fields. One of the challenges inhibiting the entity-level approach is the substantial resource requirements it entails. Unfortunately, such applications exhibit characteristics and behaviors which render traditional parallel computing techniques ineffective. Well-defined methodologies for achieving scalable performance on distributed computing platforms are needed. As an important first step, we present an abstract application model for entity-level applications, and we instantiate it for a case-study immunology application. Our experiments confirm that this model tracks application performance trends sufficiently well to study scheduling issues pertaining to entity-level applications. We identify a scalability problem inherent to the entity-level approach and use our model to quantify the potential performance improvements that remapping strategies may yield. © 2003 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Slipstream execution mode for CMP-based multiprocessors 9

Slipstream execution mode for CMP-based multiprocessors

引用

9th international symposium on High-Performance Computer Architecture

作者： Ibrahim, KZ Byrd, GT Rotenberg, E N Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

ISBN: (纸本)0769518710

Scalability of applications on distributed shared-memory (DSM) multiprocessors is limited by communication overheads. At some point, using more processors to increase parallelism yields diminishing returns or even degrades performance. When increasing concurrency is futile, we propose an additional mode of execution, called slipstream mode, that instead enlists extra processors to assist parallel tasks by reducing perceived overheads. We consider DSM multiprocessors built from dual-processor chip multiprocessor (CMP) nodes with shared L2 cache. A task is allocated on one processor of each CMP node. The other processor of each node executes a reduced version of the same task. The reduced version skips shared-memory stores and synchronization, running ahead of the true task. Even with the skipped operations, the reduced task makes accurate forward progress and generates an accurate reference stream, because branches and addresses depend primarily on private data. Slipstream execution mode yields two benefits. first, the reduced task prefetches data on behalf of the true task. Second, reduced tasks provide a detailed picture of future reference behavior, enabling a number of optimizations aimed at accelerating coherence events, e.g., self-invalidation. For multiprocessor systems with up to 16 CMP nodes, slipstream, mode outperforms running one or two conventional tasks per CMP in 7 out of 9 parallel scientific benchmarks. Slipstream mode is 12-19% faster with prefetching only and up to 29% faster with self-invalidation enabled.

关键词： Acceleration Character generation Coherence Concurrent computing Degradation Multiprocessing systems parallel processing Performance gain Prefetching Scalability

来源：评论

学校读者我要写书评

暂无评论

Scheduling distributed applications: The SimGrid simulation framework

Scheduling distributed applications: The SimGrid simulation ...

引用

3rd IEEE/ACM international symposium on Cluster Computing and the Grid (CCGrid2003)

作者： Legrand, A Marchal, L Casanova, H Ecole Normale Super Lyon Lab Informat Parallelisme Lyon France

ISBN: (纸本)0769519199

Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach is to employ scheduling heuristics that approximate an optimal schedule. Unfortunately, it is often impossible to obtain analytical results to compare the efficacy of these heuristics. One possibility is to conducts large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms (i.e. Grids) as it is labor-intensive and does not enable repeatable results. The solution is to resort to simulations. Simulations not only enables repeatable results but also make it possible to explore wide ranges of platform and application scenarios. In this paper we present the SimGrid framework which enables the simulation of distributed applications in distributed computing environments for the specific purpose of developing and evaluating scheduling algorithms. This paper focuses on SimGrid v2, which greatly improves on the first version of the software with more realistic network models and topologies. SimGrid v2 also enables the simulation of distributed scheduling agents, which has become critical for current scheduling research in large-scale platforms. After describing and validating these features, we present a case study by which we demonstrate the usefulness of SimGrid for conducting scheduling research.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

10th international symposium on String Processing and Information Retrieval, SPIRE 2003

10th International Symposium on String Processing and Inform...

引用

10th international symposium on String Processing and Information Retrieval, SPIRE 2003

ISBN: (纸本)3540201777

The proceedings contain 29 papers. The special focus in this conference is on Web Algorithms, Bit-parallel Algorithms, Compression and Music Retrieval. The topics include: Link information as a similarity measure in web classification;a three level search engine index based in query log distribution;alternative algorithms for bit-parallel string matching;bit-parallel approximate string matching algorithms with transposition;processing of Huffman compressed texts with a super-alphabet;an optimized compression code for natural language text databases;linear-time off-line text compression by longest-first substitution;structural contexts model for improving compression in semistructured text databases;ranking structured documents using utility theory in the Bayesian network retrieval model;an empirical comparison of text categorization methods;improving text retrieval in medical collections through automatic categorization;flexible and efficient bit-parallel techniques for transposition invariant approximate matching in music retrieval;analysis and evaluation of a Turkish stemming algorithm;non-adjacent digrams improve matching of cross-lingual spelling variants;the implementation and evaluation of a lexicon-based stemmer;new refinement techniques for longest common subsequence algorithms;distributed query processing using suffix arrays;bit filtration technique for approximate string join in biological databases;using wordnet for word sense disambiguation to support concept map construction;memory-adaptative dynamic spatial approximation trees and large edit distance with multiple block operations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ESCC: a new deadline-driven extension of the SCC protocol

ESCC: a new deadline-driven extension of the SCC protocol

引用

international symposium on parallel and distributed Computing

作者： J. Haubert B. Sadeg L. Amanton LIH UFR des Sciences et Techniques du Havre Le Havre France

来源：评论

学校读者我要写书评

暂无评论

An agent architecture for network support of distributed simulation 7

An agent architecture for network support of distributed sim...

引用

7th IEEE international symposium on distributed Simulation and Real-Time Applications, DS-RT 2003

作者： Simon, R. Chang, Woan Sun Pullen, J.M. Dept. of Computer Science George Mason University FairfaxVA22030 United States Dept. of Computer Science C3I Center George Mason University FairfaxVA22030 United States

ISBN: (纸本)0769520367

Continued research into distributed agent-based systems and evolving Web based technologies are opening up tremendous possibilities for the deployment of large scale and highly extensible and flexible simulation systems. However, the question remains as to how well agent and Web based simulation systems can use underlying network services. This is especially true for complex distributed simulations that have multiple participants and real-time data delivery requirements. This paper addresses the issue of interconnection patterns among Web-based simulation agents. We first describe a simple agent-oriented architectural extension to an existing distributed simulation system. Next, we present a set of interconnection algorithms between the agents in the system, under the assumption that only end-host multicast is available. We experimentally evaluate our approach under a number of different scenarios. Our results show that by using a proper connection strategy it is possible to get performance comparable to network-layer multicast for agent-based systems that use end-host multicast. © 2003 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：