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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

224 篇 会议
10 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

203 篇 工学
- 197 篇 计算机科学与技术...
- 156 篇 软件工程
- 48 篇 信息与通信工程
- 14 篇 控制科学与工程
- 9 篇 电气工程
- 9 篇 电子科学与技术（可...
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 光学工程
- 4 篇 动力工程及工程热...
- 4 篇 生物工程
- 4 篇 网络空间安全
- 3 篇 安全科学与工程
- 2 篇 仪器科学与技术
- 2 篇 冶金工程
- 2 篇 化学工程与技术
113 篇 理学
- 91 篇 数学
- 25 篇 系统科学
- 20 篇 统计学（可授理学、...
- 4 篇 物理学
- 4 篇 生物学
- 2 篇 化学
- 2 篇 地球物理学
62 篇 管理学
- 44 篇 管理科学与工程(可...
- 39 篇 工商管理
- 24 篇 图书情报与档案管...
7 篇 经济学
- 7 篇 应用经济学
4 篇 法学
- 4 篇 社会学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
1 篇 教育学
1 篇 文学

主题

46 篇 distributed comp...
34 篇 parallel process...
12 篇 parallel process...
8 篇 parallel program...
7 篇 parallel algorit...
7 篇 ubiquitous compu...
5 篇 computer archite...
5 篇 distributed comp...
4 篇 computer science
4 篇 grid computing
4 篇 computational mo...
3 篇 query processing
3 篇 concurrent compu...
3 篇 real time system...
3 篇 neural networks
3 篇 resource allocat...
3 篇 protocols
3 篇 graphics process...
3 篇 testing
3 篇 computer network...

机构

4 篇 guangxi key labo...
3 篇 faculty of compu...
3 篇 california insti...
3 篇 huazhong univers...
2 篇 science and tech...
2 篇 huazhong univers...
2 篇 ieee
2 篇 department of co...
2 篇 university of pi...
2 篇 mathematics and ...
2 篇 wuhan research i...
2 篇 school of intern...
2 篇 institute of inf...
2 篇 department of co...
2 篇 nanjing universi...
2 篇 poznan universit...
2 篇 university of ch...
2 篇 china university...
2 篇 university of ma...
1 篇 dept. of cis uni...

作者

3 篇 dongarra jack
2 篇 andrzej dobrogow...
2 篇 zhou xinlei
2 篇 luo zhigang
2 篇 scholz sven-bodo
2 篇 nie xin
2 篇 wyckoff pete
2 篇 chronopoulos ant...
2 篇 he yuxiong
2 篇 yi yuanyuan
2 篇 michal kasznia
2 篇 bader david a.
2 篇 kalogeraki vana
2 篇 eigenmann rudolf
2 篇 ţǎpuş cristian
2 篇 fox geoffrey
2 篇 jarvis stephen a...
2 篇 tao dacheng
2 篇 xue james w. j.
2 篇 zhou gefei

语言

233 篇 英文
1 篇 中文

检索条件"任意字段=21st International Parallel and Distributed Processing Symposium, IPDPS 2007"

共 234 条记录，以下是81-90 订阅

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

详细简洁

排序：

Self adaptive application level fault tolerance For parallel and distributed computing

Self adaptive application level fault tolerance For parallel...

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Chen, Zizhong Yang, Ming Francia III, Guillermo Dongarra, Jack Jacksonville State University MCIS Department Jacksonville AL 36265 United States University of Tennessee Knoxville Department of Computer Science Knoxville TN 37996

ISBN: (纸本)1424409101

Most application level fault tolerance schemes in literature are non-adaptive in the sense that the fault tolerance schemes incorporated in applications are usually designed without incorporating information from system environments such as the amount of available memory and the local or network I/O bandwidth. However, from an application point of view, it is often desirable for fault tolerant high performance applications to be able to achieve high performance under whatever system environment it executes with as low fault tolerance overhead as possibile. In this paper, we demonstrate that, in order to achieve high reliability with as low performance penalty as possible, fault tolerant schemes in applications need to be able to adapt themselves to different system environments. We propose a framework under which different fault tolerant schemes can be incorporated in applications using an adaptive method. Under this framework, applications are able to choose near optimal fault tolerance schemes at run time according to the specific characteristics of the platform on which the application is executing. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

High performance java sockets for parallel computing on clusters

High performance java sockets for parallel computing on clus...

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Taboada, Guillermo L. Touriño, Juan Doallo, Ramón Computer Architecture Group Dept. of Electronics and Systems University of A Coruña A Coruña 15071 Spain

ISBN: (纸本)1424409101

The use of Java for parallel programming on clusters relies on the need of efficient communication middleware and high-speed cluster interconnect support. Nevertheless, currently there are no solutions that fully fulfill these issues. In this paper, a Java sockets library has been tailored to increase the efficiency of Java parallel applications on clusters. This library supports high-speed cluster interconnects and its API has been extended to meet the requirements of a high performance Java RMI implementation and Java parallel applications on clusters. Thus, it provides Java with a more efficient communication middleware on clusters. The performance evaluation of this middleware on a Gigabit Ethernet (GbE) and a Scalable Coherent Interface (SCI) cluster has shown experimental evidence of throughput increase. Moreover, qualitative aspects of the solution such as transparency to the user, interoperability with other systems and no need of source code modifications are decisive to boost the performance of existing Java parallel applications and their developments in high performance Java cluster computing. © 2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Replication strategy in unstructured peer-to-peer systems

Replication strategy in unstructured peer-to-peer systems

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Guofu, Feng Yuquan, Jiang Guihai, Chen Qing, Gu Sanglu, Lu Daoxu, Chen Nanjing Audit University School of Information Science Nanjing 210029 China State Key Lab. Novel Software Technology Nanjing 210093 China

ISBN: (纸本)1424409101

The unstructured Peer-to-Peer (P2P) systems usually use a "blind search " method to find the requested data object by propagating a query to a number of peers randomly. In order to increase the success rate of blind search, replication techniques are widely used in these systems. Most P2P systems replicate the most frequently accessed data objects to improve system performance. However, existing replication strategies cannot answer the question that how many replicas of an object should be kept in the P2P system. If an object is replicated excessively, it inevitably will affect the average efficiency of a replica, which will decrease the whole search performance. This paper addresses the issue of finding the proper number of replicas for an object according to its query rate. In this paper, we firstly investigate the precise relation among success rate, the allocation of replicas and query rate. Then we propose an approach of the allocation of copies to optimize the success rate. As a benchmark, our result offers a new understanding of replication. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A framework for experimental validation and performance evaluation in fault tolerant distributed system

A framework for experimental validation and performance eval...

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Meling, Hein Department of Electrical Engineering and Computer Science University of Stavanger 4036 Stavanger Norway

ISBN: (纸本)1424409101

Performing experimental evaluation of fault tolerant distributed systems is a complex and tedious task, and automating as much as possible of the execution and evaluation of experiments is often necessary to test a broad spectrum of possible executions of the system to obtain good coverage. The confidence of the results obtained from an experimental evaluation depends on the degree of control over the environment in which experiments are being executed. Typically, an uncontrolled environment is exposed to numerous sources of external influence that can affect the obtained results. Automated and repeated executions can be used to reduce the impact of such influences. In this paper, a framework for experimental validation and performance evaluation of fault management in a fault tolerant distributed system is presented. The framework provides a facility to execute experiments in a configured target system. It is based on injecting faults or other events needed to test the fault handling capability of the system. Relevant events are logged, and collected for postprocessing and analysis, e.g. to construct a single global timeline of events occurring at different nodes in the target system. This timeline of events can then be used to validate the behavior a system, and to evaluate its performance. ©2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Average-case performance analysis of online non-clairvoyant scheduling of parallel tasks with precedence constraints

Average-case performance analysis of online non-clairvoyant ...

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Li, Keqin Department of Computer Science State University of New York New Paltz NY 12561 United States

ISBN: (纸本)1424409101

We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a class of wide task graphs, when task sizes are uniformly distributed in the range [1..C], the online non-clairvoyant scheduling algorithm LL-SIMPLE has an asymptotic average-case performance bound of M/(M - (3 - (1 + 1/C)C+1)C - 1), where M is the number of processors. For arbitrary probability distributions of task sizes, we present numerical and simulation data to demonstrate the accuracy of our general asymptotic average-case performance bound. We also report extensive experimental results on the average-case performance of online non-clairvoyant scheduling algorithms LL-GREEDY and LS. Algorithm LL-GREEDY has better performance than LL-SIMPLE by using an improved algorithm to schedule independent tasks in the same level. Algorithm LS produces even better schedules due to break of boundaries among levels. © 2007 IEEE.

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

A landmark-based index architecture for general similarity search in peer-to-peer networks

A landmark-based index architecture for general similarity s...

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Yang, Xiaoyu Hu, Yiming Dept. of Electrical and Computer Engineering and Computer Science University of Cincinnati Cincinnati OH 45221-0030 United States

ISBN: (纸本)1424409101

The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid proliferation of data volume. In this paper, we propose a scalable index architecture built on top of distributed hash tables (DHT), to support similarity search in the general metric space. Based on efficient space mapping and query routing mechanisms, our architecture can provide a general platform to support arbitrary number of indexes on different data types. Significantly, it does not need to generate or maintain any search trees. Instead, the embedded trees in the underlying distributed hash tables are exploited to deliver queries. To deal with skewed data distribution, we also provide load-balancing mechanisms to ensure that no node in the system is unduly loaded. The performance of the proposed design is evaluated through simulations with a variety of metrics. The experimental results demonstrate that out approach can efficiently solve similarity query at a low cost. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scalable distributed execution environment for large data visualization

Scalable distributed execution environment for large data vi...

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Beck, Micah Liu, Huadong Huang, Jian Moore, Terry University of Tennessee Deptment of Computer Science Knoxville TN 37996-3450 United States

ISBN: (纸本)1424409101

To use heterogeneous and geographically distributed resources as a platform for parallel visualization is an intriguing topic of research. This is because of the immense potential impact of the work, and also because of its use of a full range of challenging technologies. In this work, we designed an execution environment for visualization of massive scientific datasets, using network functional units (NFU) for processing power, logistical networking for storage management and visualization cookbook library (vcblib) for visualization operations. This environment is based solely on computers distributed across the Internet that are owned and operated by independent institutions, while being openly shared for free. Those Internet computers are inherently of heterogeneous hardware configuration and running a variety of operating systems. Using 100 such processors, we have been able to obtain the same level of performance offered by a 64-node cluster of 2.2 GHz P4 processors, while processing a 75GBs subset of a cutting-edge simulation dataset. Due to its inherently shared nature, this execution environment for data-intensive visualization could provide a viable means of collaboration among geographically separated users. © 2007 IEEE.

关键词： Supervisory and executive programs

来源：评论

学校读者我要写书评

暂无评论

Open Internet-based sharing for desktop grids in iShare

Open Internet-based sharing for desktop grids in iShare

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Ren, Xiaojuan Basumallik, Ayon Pan, Zhelong Eigenmann, Rudolf School of ECE Purdue University West Lafayette IN 47907 United States VMWare Inc. Palo Alto CA 94304 United States

ISBN: (纸本)1424409101

This paper presents iShare, a distributed peer-to-peer Internet-sharing system, that facilitates the sharing of diverse resources located in different administrative domains over the Internet. iShare addresses the challenges of resource management in desktop grids, and integrates these resources with production grids. In this paper, we present a brief overview of the iShare system and describe how iShare leverages existing standards to provide novel solutions to the problems of resource dissemination, resource allocation and trust in desktop grids. We also discuss how iShare integrates production grid systems, such as the Teragrid, with desktop resources and compare the iShare approach with web-based user portals for production grids. To quantitatively evaluate our techniques, we measured the efficiency of resource allocation in iShare and the overheads associated with establishing trust and providing the iShare user interface for production grids. The evaluation results demonstrate that iShare enables open Internet sharing with efficiency, reliability, and security. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

storage optimization for large-scale distributed stream processing systems

Storage optimization for large-scale distributed stream proc...

引用

21st international parallel and distributed processing symposium, ipdps 2007

作者： Hildrum, Kirsten Douglis, Fred Wolf, Joel L. Yu, Philip Fleischer, Lisa Katta, Akshay IBM T.J. Watson Research Center Dartmouth College Amazon Corporation

ISBN: (纸本)1424409101

We consider storage in an extremely large-scale distributed computer system designed for stream processing applications. In such systems, incoming data and intermediate results may need to be stored to enable future analyses. The quantity of such data would dominate even the largest storage system. Thus, a mechanism is needed to keep the most useful data. One recently introduced approach is to employ retention value functions, which effectively assign each data object a value that changes over time [5]. storage space is then reclaimed automatically by deleting data of lowest current value. In such large systems, there will naturally be multiple file systems available, each with different properties. Choosing the right file system for a given incoming data stream presents a challenge. In this paper we provide a novel and effective scheme for optimizing the placement of data within a distributed storage subsystem employing retention value functions. The goal is to keep the data of highest overall value, while simultaneously balancing the read load to the file system. © 2007 IEEE.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共24页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：