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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是341-350 订阅

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

详细简洁

排序：

parallel multi-teraflops studies of the magnetic structure of FeMn alloys

Parallel multi-teraflops studies of the magnetic structure o...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. Canning B. Ujfalussy T.C. Schulthess X.-G. Zhang W.A. Shelton D.M.C. Nicholson G.M. Stocks Yang Wang T. Dirks Lawrence Berkeley National Laboratory CRD Berkeley CA USA Department of Physics and Astronomy University of Tennessee Knoxville TN USA Oak Ridge National Laboratory Oak Ridge TN USA Pittsburgh Super Computing Center Pittsburgh PA USA IBM Bethesda MD USA

Massively parallel computers have been used to perform first principles spin dynamics (SD) simulations of the magnetic structure of /spl gamma/-FeMn (iron-manganese). The code uses a novel parallel approach to solve the Kohn-Sham equations obtained from density functional theory (DFT). This approach uses limited local communications avoiding the large global communications found in other DFT based methods. This allows our code to scale efficiently to very large processor counts and large system sizes. Computationally our method can be implemented using mainly BLAS3 routines which typically run at a very high percentage of peak speed on most computers. Our large scale quantum mechanical simulations using this method reveal new details of the orientational configuration of the magnetic moments of /spl gamma/-FeMn that are unobtainable by any other means. The understanding of the magnetic structure of /spl gamma/-FeMn is important in exchange bias, which involves the use of an antiferromagnetic (AFM) layer such as FeMn to pin the orientation of the magnetic moment of a proximate ferromagnetic (FM). Exchange bias is of fundamental importance in magnetic multilayer storage and read head devices. Here the equation of motion of first principles SD is used to perform relaxations of model magnetic structures to the true ground (equilibrium) state. Our code has achieved a maximum execution rate of 2.46 teraflops on the IBM SP at the National Energy Research Scientific Computing Center (NERSC) and 4.65 teraflops on the HP-Compaq machine at the Pittsburgh Supercomputing Center (PSC).

关键词： Computational modeling Equations Magnetic moments Concurrent computing Computer simulation Density functional theory Global communication Large-scale systems Quantum mechanics Antiferromagnetic materials

来源：评论

学校读者我要写书评

暂无评论

Scheduling distributed applications: the SimGrid simulation framework 03

Scheduling distributed applications: the SimGrid simulation ...

引用

IEEE/ACM international symposium on Cluster Computing and the Grid (CCGRID)

作者： A. Legrand L. Marchal H. Casanova Laboratoire de l'Informatique du Parallélisme ÉEcole Normale Supérieure de Lyon France Department of Computer Science and Engineering San Diego Supercomputer Center University of California San Diego San Diego USA

ISBN: (纸本)9780769519197

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.

关键词： Optimal scheduling Processor scheduling Computational modeling Application software distributed computing Computer simulation Concurrent computing Network topology Grid computing Computer networks

来源：评论

学校读者我要写书评

暂无评论

Slipstream execution mode for CMP-based multiprocessors

Slipstream execution mode for CMP-based multiprocessors

引用

IEEE symposium on High-Performance Computer Architecture

作者： K.Z. Ibrahim G.T. Byrd E. Rotenberg Department of Electrical and Computer Engineering North Carolina State University USA

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.

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

来源：评论

学校读者我要写书评

暂无评论

Normality versus system mobility 9

Normality versus system mobility

引用

9th international Conference on parallel and distributed systems (ICPADS 2002)

作者： Gradinariu, M Univ Rennes 1 IRISA F-35042 Rennes France

ISBN: (纸本)0769517609

Normality, consitancy criteria stronger than sequentiality and equivalant to linearizability for the unary operations case, has the main advantage that it avoids the use of the "global real-time ordering". This work presents the first algorithm that implements normality without using strong communication primitives (i.e. atomic broadcast or global clock syncronization). Moreover, our implementation allows the dynamic changes of the system configuration, handles replication and refers the general case of multi-object operations. Although the use of terms as client or server our algorithm is entirely based on a peer-to-peer approach.

关键词： Broadcasting Clocks distributed algorithms distributed databases Network servers Network topology Peer to peer computing Real time systems Routing protocols Scalability

来源：评论

学校读者我要写书评

暂无评论

A single phase distributed commit protocol for main memory database systems 16

A single phase distributed commit protocol for main memory d...

引用

16th international parallel and distributed Processing symposium, IPDPS 2002

作者： Lee, Inseon Yeom, H.Y. School of Computer Science Seoul National University Seoul151-742 Korea Republic of

ISBN: (纸本)0769515738

distributed databases systems need commit processing so that transactions executing on them still preserve the ACID property. With the advance of main memory database systems which become possible due to dropping price and increasing capacity of the RAM and CPU, the database processing speed has been increased in one order of magnitude. However, when it comes to distributed commit processing, it is still very slow since disk logging has to precede the transaction commit where the database access does not incur any disk access at all in the case of main memory databases. In this paper, we re-evaluate the various distributed commit protocols and come up with a single phase distributed commit protocol suitable for the distributed main memory database systems. Our simulation study confirms that the new protocol greatly reduces the time it takes to commit distributed transactions without any consistency problem. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Leveraging run time knowledge about event rates to improve memory utilization in wide area data stream filtering 11

Leveraging run time knowledge about event rates to improve m...

引用

11th IEEE international symposium on High Performance distributed Computing (HPDC-11)

作者： Plale, B Indiana Univ Dept Comp Sci Bloomington IN 47405 USA

ISBN: (纸本)0769516866

The dQUOB system conceptualization of datastreams as database and its SQL interface to data streams is an intuitive way for users to think about their data needs in a large scale application containing hundreds if not thousands of data streams. Experience with dQUOB has shown the need for more aggressive memory management to achieve the scalability we desire. This paper addresses the problem with a two-fold solution. The first is replacement of the existing first Come first Served (FCFS) scheduling algorithm with an Earliest Job first (EJF) algorithm which we demonstrate to yield better average service time. The second is an introspection algorithm that sets and adapts the sizes of join windows in response to knowledge acquired at runtime about event rates. In addition to the potential for significant improvements in memory utilization, the algorithm presented here also provides a means by which the user can reason about join window sizes. Wide area measurements demonstrate the adaptive capability required by the introspection technique.

关键词： Application software Computer science Filtering Large-scale systems Memory management Relational databases Runtime Scalability Scheduling algorithm Wide area measurements

来源：评论

学校读者我要写书评

暂无评论

An algorithm for resolving the join component selection problem in parallel join optimization

An algorithm for resolving the join component selection prob...

引用

6th international symposium on parallel Architectures, Algorithms and Networks (I-SPAN 02)

作者： Esquivel, J Chan, P De La Salle Univ Dasmarinas Dept Comp Studies Cavite Philippines

ISBN: (纸本)0769515797

The use of page-level join index in parallel join optimization requires a proper sequence for accessing data pages in the form of join components. The current approach to this method involves a strategy that retrieves first those components with a high number of page joins so as to keep all processors busy early in the join execution. However, problems regarding conflicts with other valid reading strategies and the choice of an appropriate component whenever several of them satisfy the selection criterion have not been specifically addressed. We call such conflicts as the Join Component Selection (JCS) problem. To resolve this problem, this paper proposes appropriate component retrieving strategies that will further optimize the parallel join execution. Simulation results demonstrate an improvement over the existing one.

关键词： Bipartite graph Concurrent computing Ear Educational institutions Joining processes Multiprocessing systems parallel algorithms parallel architectures Query processing Relational databases

来源：评论

学校读者我要写书评

暂无评论

parallel and distributed computing with coevolutionary algorithms 16

Parallel and distributed computing with coevolutionary algor...

引用

16th international parallel and distributed Processing symposium, IPDPS 2002

作者： Seredynski, F. Zomaya, A.Y. Department of Computer Science Institute of Insurance Wesola 52 Kielce25-353 Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Nedlands PerthWA6907 Australia

ISBN: (纸本)0769515738

The problem of parallel and distributed function optimization is considered. Two coevolutionary algorithms with different degrees of parallelism and different levels of a global coordination are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary approach to problem solving and is compared with another coevolutionary algoritm called cooperative coevolutionary genetic algorithm (CCGA). The algorithms are applied for parallel and distributed optimization of a number of test functions known in the area of evolutionary computation. We show that both coevolutionary algorithms outperform a sequential GA. While both LCGA and CCGA algorithms offer high quality solutions, they may compete to outperform each other in some specific test optimization problems. The LCGA may be recommended to be used in optimization systems when high degree of parallelism is possible and non global coordination is expected while the CCGA algorithm is useful when low degree of parallelism and global coordination is acceptable. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

nfsp: A distributed NFS server for clusters of workstations 16

nfsp: A distributed NFS server for clusters of workstations

引用

16th international parallel and distributed Processing symposium, IPDPS 2002

作者： Lombard, P. Denneulin, Y. Laboratoire Informatique et Distribution - IMAG ENSIMAG - Antenne de Montbonnot - ZIRST 51 avenue Jean Kuntzmann Montbonnot Saint-Martin38330 France

ISBN: (纸本)0769515738

A consequence of the increasing popularity of Beowulf clusters has been their increasing size (in number of nodes). Yet, the hard drives available on these nodes are only used for the system and temporary files, thus wasting a lot of space (several TiB on large clusters!). The systems that might help recycling this otherwise-unused space are few and far between. This paper presents a NFS server that aims at using the unused disk space spread over the cluster nodes and at offering performance and scalability improvements (compared to the plain NFS servers). The architecture of our solution uses a metaserver and I/O daemons. The client only sees plain NFS, thanks to NFS over UDP spoofing techniques. A first implementation and early performances are shown for this approach. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Defending against distributed denial of service attacks using resistant mobile agent architecture 16

Defending against distributed denial of service attacks usin...

引用

16th international parallel and distributed Processing symposium, IPDPS 2002

作者： Li, Tieyan Chew, Wai-Meng Lam, Kwok-Yan Centre for Systems Security School of Computing National University of Singapore Singapore119260 Singapore

ISBN: (纸本)0769515738

With a rise in threats and attacks related to security, many companies have widely deployed Intrusion Detection systems(IDSs) to protect their assets. Thus IDSs are becoming the first targets before the attackers launch further attacks on valuable host-based components. In order to guard against this threat, we propose a secure mobile agent architecture to make the IDS architecture attack resistant. In this architecture, we use proxy agent groups to depart the critical IDS components and the leaf IDS components so that the attackers be frustrated by not knowing the critical IDS components. We also have designed a buddy agent group that will protect the proxy agents and disseminate the central directory services. We ensure that the IDS will evade from attacks and still be able to function since there is no single point of failure in the system from the attacks. The IDS agents can also be recovered soon using our immediate backup mechanisms. Through the attack analysis, we prove that our proposed IDSs architecture is capable to evade from tampering and disabling by attackers. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：