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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,285 篇 会议
362 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

9,681 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,567 篇 工学
- 4,178 篇 计算机科学与技术...
- 2,157 篇 软件工程
- 847 篇 电气工程
- 629 篇 信息与通信工程
- 313 篇 控制科学与工程
- 226 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,073 篇 理学
- 863 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 33 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,198 篇 distributed data...
995 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
778 篇 computer science
693 篇 databases
616 篇 computer archite...
586 篇 application soft...
559 篇 computational mo...
467 篇 parallel process...
369 篇 scalability
351 篇 distributed comp...
345 篇 distributed proc...
333 篇 hardware
325 篇 database systems
293 篇 parallel program...
293 篇 processor schedu...
290 篇 resource managem...
287 篇 costs
269 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
12 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
10 篇 j. saltz
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop

语言

9,597 篇 英文
63 篇 其他
21 篇 中文

检索条件"任意字段=International Symposium on Databases in Parallel and Distributed Systems"

共 9681 条记录，以下是4861-4870 订阅

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

详细简洁

排序：

Shrack: Description and performance evaluation of a peer-to-peer system for document sharing and tracking using pull-only information dissemination

Shrack: Description and performance evaluation of a peer-to-...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Tanta-ngai, Hathai Kešelj, Vlado Milios, Evangelos E. Faculty of Computer Science Dalhousie University Halifax NS Canada

ISBN: (纸本)1424409101

Shrack is a peer-to-peer framework for document sharing and tracking. Shrack peers provide support to researchers in forming direct collaboration in autonomous sharing and keeping track of newly published documents based on their interests. We propose a pull-only information dissemination protocol for peers to distribute information about new documents among peers with similar interests. Each peer can use the disseminated information to build a local view of semantic overlay of peer interests in the network. Each peer can later use the semantic overlay to find new contact information about other peers with a particular interests, as well as search for documents archived by other peers. After presenting an overview architecture of the system and the dissemination protocol, we present the evaluation results of the system performance, based on a simulated environment. The results indicate that the Shrack protocol is scalable and reliable as the network size increases. ©2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Benefits of targeting in trusted gossiping for peer-to-peer information sharing

Benefits of targeting in trusted gossiping for peer-to-peer ...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Mitra, Arindam Maheswaran, Muthucumaru University of Manitoba Dept. of Computer Science Winnipeg Man. R3T 2N2 Canada McGill University School of Computer Science Montreal Que. H3A 2A7 Canada

ISBN: (纸本)1424409101

In a recent study, we proposed a trusted gossip protocol for rumor resistant information sharing in peer-to-peer networks. While trust aware gossiping significantly reduced the rumor spread on the network, we observed that the random message spraying in trusted gossip creates too many redundant messages increasing the message overhead and error rate. In this paper, we propose a message targeting scheme that can significantly improve the performance of the trusted gossip. Our targeting scheme can be easily implemented in a social network setting. We performed large-scale simulations using traces collected from the Flickr social network and other data sets to estimate the performance of targeting in trusted gossip. Our experiments show that significant performance gains can be achieved. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Integrated risk analysis for a commercial computing service

Integrated risk analysis for a commercial computing service

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Yeo, Chee Shin Buyya, Rajkumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Vic. 3010 Australia

ISBN: (纸本)1424409101

Utility computing has been anticipated to be the next generation of computing usage. Users have the freedom to easily switch to any commercial computing service to complete jobs whenever the need arises and simply pay only on usage, without any investment costs. A commercial computing service however has certain objectives or goals that it aims to achieve. In this paper, we identify three essential objectives for a commercial computing service: (i) meet SLA, (ii) maintain reliability, and (iii) earn profit. This leads to the problem of whether a resource management policy implemented in the commercial computing service is able to meet the required objectives or not. So, we also develop two evaluation methods that are simple and intuitive: (i) separate and (ii) integrated risk analysis to analyze the effectiveness of resource management policies in achieving the required objectives. Evaluation results based on five policies successfully demonstrate the applicability of separate and integrated risk analysis to assess policies in terms of the required objectives. © 2007 IEEE.

关键词： Utility programs

来源：评论

学校读者我要写书评

暂无评论

An optimistic checkpointing and selective message logging approach for consistent global checkpoint collection in distributed systems

An optimistic checkpointing and selective message logging ap...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Jiang, Qiangfeng Manivannan, D. Department of Computer Science University of Kentucky Lexington KY 40506

ISBN: (纸本)1424409101

In this paper, we present an asynchronous consistent global checkpoint collection algorithm which prevents contention for network storage at the file server and hence reduces the checkpointing overhead. The algorithm has two phases: In the first phase, a process initiates consistent global checkpoint collection by saving its state tentatively and asynchronously (called tentative checkpoint) in local memory or remote stable storage if there is no contention for stable storage while saving the state;in the second phase, the message log associated with the tentative checkpoint is stored in stable storage (checkpoint finalization phase). The tentative checkpoint together with the associated message log stored in the stable storage becomes part of a consistent global checkpoint. Under our algorithm, two or more processes can concurrently initiate consistent global checkpoint collection. Every tentative checkpoint will be finalized successfully unless a failure occurs. The finalized checkpoints of each process is assigned a unique sequence number in ascending order. Finalized checkpoints with same sequence number form a consistent global checkpoint. © 2007 IEEE.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

High performance distributed lock management services using network-based remote atomic operations 07

High performance distributed lock management services using ...

引用

7th IEEE international symposium on Cluster Computing and the Grid

作者： Narravula, S. Mamidala, A. Vishnu, A. Vaidyanathan, K. Panda, D. K. Ohio State Univ Columbus OH 43210 USA

ISBN: (纸本)9780769528335

Recently there has been a massive increase in computing requirements for parallel applications. These parallel applications and supporting cluster services often need to share system-wide resources. The coordination of these applications is typically managed by a distributed lock manager. The performance of the lock manager is extremely critical for application performance. Researchers have shown that the use of two sided communication protocols, like TCP/IP (used by current generation lock managers), can have significant impact on the scalability of distributed lock managers. in addition, existing one-sided communication based locking designs support locking in exclusive access mode only and can pose significant scalability limitations on applications that need both shared and exclusive access modes like cooperative/file-system caching. Hence the utility of these existing designs in high performance scenarios can be limited. In this paper we present a novel protocol, for distributed locking services, utilizing the advanced network-level one-sided atomic operations provided by InfiniBand. Our approach augments existing approaches by eliminating the need for two sided communication protocols in the critical locking path. Further we also demonstrate that our approach provides significantly higher performance in scenarios needing both shared and exclusive mode access to resources. Our experimental results show 39% improvement in basic locking latencies over traditional send/receive based implementations. Further we also observe a significant (upto 317% for 16 nodes) improvement over existing RDMA based distributed queuing schemes for shared mode locking scenarios.

关键词： Concurrent computing Application software distributed computing Scalability Computer architecture Computer network management Engineering management Computer science Computer networks High performance computing

来源：评论

学校读者我要写书评

暂无评论

Generating efficient distributed deadlock avoidance controllers

Generating efficient distributed deadlock avoidance controll...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Sánchez, César Sipma, Henny B. Manna, Zohar Stanford University Computer Science Department Stanford CA 94305 United States

ISBN: (纸本)1424409101

General solutions to deadlock avoidance in distributed systems are considered impractical due to the high communication overhead. In previous work we showed that practical solutions exist when all possible sequences of resource requests are known a priori in the form of call graphs;in this case protocols can be constructed that involve no communication. These run-time protocols make use of annotations of the call graph that are computed statically based on the structure of the call graph. If the annotations are acyclic, then deadlocks are unreachable. This paper focuses on the computation of these annotations. We first show that our algorithm for computing acyclic annotations is complete: every optimal annotation can be generated. We then show that, given a cyclic annotation and a fixed set of resources, checking whether deadlocks are reachable is NP-complete. Finally, we consider the problem of computing minimal annotations that satisfy given constraints on the number of available resources. We show that the problem is NP-complete in the general case, but that it can be solved in polynomial time if the only restrictions are that the number of certain resources is 1, that is, these resources are binary semaphores. ©2007 IEEE.

关键词： Computer system recovery

来源：评论

学校读者我要写书评

暂无评论

Incorporating latency in heterogeneous graph partitioning

Incorporating latency in heterogeneous graph partitioning

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Aubanel, Eric Wu, Xiaochen Faculty of Computer Science University of New Brunswick Fredericton NB E3B 5A3 Canada

ISBN: (纸本)1424409101

parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational platform, where processor and network performance may vary. Such partitioners generally model the computational, platform as a weighted graph, where the weight of a vertex gives relative processor performance, and the weight of a link indicates the relative transmission rate of the link between two processors. However, the performance of a network link is typically characterized by two parameters, bandwidth and latency, which cannot be captured in a single weight. We show that taking into account the network heterogeneity of a computational, resource can significantly improve the quality of a domain decomposition obtained using graph partitioning. Furthermore, we show that taking into account bandwidth and latency of the network links is significantly better than just considering the former. This work is presented as an extension to the PaGrid partitioner, and includes a model for estimated execution time, which is used as a cost function by the partitioner but could also be used for performance prediction by application-oriented schedulers. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scalable compression and replay of communication traces in massively parallel environments

Scalable compression and replay of communication traces in m...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Noeth, Michael Mueller, Frank Schulz, Martin De Supinski, Bronis R. North Carolina State University Department of Computer Science Raleigh NC 27695-7534 Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA 94551

ISBN: (纸本)1424409101

Characterizing the communication behavior of large-scale applications is a difficult and costly task due to code/system complexity and their long execution times. An alternative to running actual codes is to gather their communication traces and then replay them, which facilitates application tuning and future procurements. While past approaches lacked lossless scalable trace collection, we contribute an approach that provides orders of magnitude smaller, if not near constant-size, communication traces regardless of the number of nodes while preserving structural information. We introduce intra- and inter-node compression techniques of MPI events and present results of our implementation for BlueGene/L. Given this novel capability, we discuss its impact on communication tuning and beyond. To the best of our knowledge, such a concise representation of MPI traces in a scalable manner combined with deterministic MPI call replay are without any precedence. ©2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

international Workshop on Intelligent systems and Smart Home (WISH 2007)

International Workshop on Intelligent Systems and Smart Home...

引用

5th international symposium on parallel and distributed Processing and Applications, ISPA 2007 international Workshops: SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN

作者： Yang, Laurence T. Guo, Minyi Hsu, Ching-Hsien Park, Jong Hyuk Wang, Cho-Li Pan, Gang Seoul National University of Science and Technology Korea Republic of

来源：评论

学校读者我要写书评

暂无评论

Prepositions and conjunctions in a natural language interfaces to databases

Prepositions and conjunctions in a natural language interfac...

引用

5th international symposium on parallel and distributed Processing and Applications, ISPA 2007 international Workshops: SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN

作者： González B., J. Javier Pazos R., Rodolfo A. Gelbukh, Alexander Sidorov, Grigori Fraire H., Hector Cruz C., I. Cristina Instituto Tecnológico de Ciudad Madero Mexico Mexico Centro de Investigación en Computación

ISBN: (纸本)9783540747666

This paper present the treatment of prepositions and conj unctions in natural language interfaces to databases (NLIDB) that allows better translation of queries expressed in natural language into formal languages. Prepositions and conjunctions weren't sufficiently studied for their usage in NLIDBs, because most of the NLIDBs just look for keywords in the sentences and focus their analysis on nouns and verbs getting rid of auxiliary words in the query. This paper shows that prepositions and conjunctions can be represented as operations using formal set theory. Additionally, since prepositions and conjunctions keep their meaning in any context, their treatment is domain independent. In our experiments we used Spanish language. We validate our approach using two databases;Northwind and Pubsof SQL Server, with a corpus of 198 different queries for the first one and 70 queries for the second one. The 84% of queries were translated correctly for the database Northwind and 80% for Pubs. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 483 484 485 486 487 488 489 490 491 492 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：