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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Reifying control of multi-owned network resources

Reifying control of multi-owned network resources

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Jamali, Nadeem Liu, Chen University of Saskatchewan Dept. of Computer Science 176 Thorv. Bldg. Saskatoon Sask. Canada University of Alberta Dept. of Computing Science 2-21 Athab. Hall Edmonton Alta. Canada

ISBN: (纸本)1424409101

Communication delay is a key source of uncertainty in distributed systems. Existing approaches to reduce this uncertainty focus on maintaining sufficient surplus bandwidth;applications, on their part, are designed in ways to tolerate certain degree of uncertainty in communication delays. This leads to contention between the goals of optimal utilization and acceptable delays. We argue that the multi-owned nature of today's networks offers opportunities to reason about and scalably control networks at a fine grain. An explicit treatment of network resource ownership and trade allows reasoning about acceptable delays. This can lead to scalable mechanisms for fine-grained accounting and reification of control, which make it possible to quantify and control network utilization. We bring together ownership, fine-grained accounting, and reification of control in a model for resource acquisition and control called CyberOrgs. Cyberorgs encapsulate distributed computations with resources required for their execution. A cyberorg acquires resources required by its computations by buying them from other cyberorgs using eCash. We present a novel approach for implementing fine-grained network resource control based on the CyberOrgs model. A prototype implementation is described with experimental results illustrating the effectiveness of control. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed broadcast scheduling in mobile ad hoc networks with unknown topologies

Distributed broadcast scheduling in mobile ad hoc networks w...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Tan, Guang Jarvis, Stephen A. Xue, James W. J. Hammond, Simon D. Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom

ISBN: (纸本)1424409101

Broadcasting is a fundamental communication task in mobile ad hoc networks, and minimizing broadcasting time (or latency) is crucial to the performance of many applications. Extensive studies have been conducted on the minimization of broadcasting time in the context of radio networks, which are usually modeled as general graphs. In this paper, we consider how to achieve this goal with distributed algorithms based on a more realistic (and restricted) network model. We propose a randomized algorithm that completes broadcasting in O(D log(n/D) + log2 n) time, where n is the number of nodes in the network and D the eccentricity (maximum distance from the source node to any other node). Compared with a previous optimal algorithm that achieves the same result for general networks, our algorithm obviates the need to know the network eccentricity D beforehand. We also propose a deterministic broadcasting algorithm that works in O(n) time, which is in contrast with the best known result of O{n log2 D) for general networks. ©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

来源：评论

学校读者我要写书评

暂无评论

Software tools for performance modeling of parallel programs

Software tools for performance modeling of parallel programs

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Martínez, Diego R. Blanco, Vicente Boullón, Marcos Cabaleiro, José C. Rodríguez, Casiano Rivera, Francisco F. University of Santiago de Compostela Dept. of Electronics and Computer Science Santiago de Compostela A Coruna Spain La Laguna University Dept. Statistics and Computer Science La Laguna Tenerife Spain

ISBN: (纸本)1424409101

This paper presents a framework based on a user driven methodology to obtain analytical models of MPI applications on parallel, systems in a systematic and easy to use way. This methodology consists of two stages. In the first one, instrumentation of the source code is performed using CALL, which is a profiling tool for interacting with the code in an easy, simple and direct way. New features are added to CALL to obtain different performace metrics and store the performance information in XML files. Using this information, an analytical model of the performance behavior is obtained in the second stage by means of R, a language and environment for statistical analysis. The structure of the whole framework is detailed in this paper, and some selected examples are used to show its practical use. © 2007 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Linking compilation and visualization for massively parallel programs

Linking compilation and visualization for massively parallel...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Jones, Alex K. Hoare, Raymond R. St. Onge, Joseph Lucas, Joshua Shao, Shuyi Melhem, Rami University of Pittsburgh Concurrent EDA LLC Lockheed Martin

ISBN: (纸本)1424409101

This paper presents a technique to visualize the communication pattern of a parallel application at different points during its execution. Unlike many existing tools that show the communication pattern for the entire application, our tool breaks this communication pattern down into components to allow the more detailed study of application execution. These patterns are not merely snapshots or windows of the execution but rather are tied to specific code structures comprised of loops in the application. Our technique leverages our compiler, which adds instructions into the code to record where communications and code artifacts occur during execution. This information is stored into a trace format, which is read by our visualization tool. The visualization tool can graphically represent the communication pattern and message volume to allow a user to analyze and optimize the execution. As an example, we show how this information can be used to optimize the execution time and reduce the message delay of applications executed on a system enhanced with optical circuit switch interconnections. © 2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Prediction Services for distributed Computing

Prediction Services for Distributed Computing

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Warren Smith Texas Advanced Computing Center University of Texas Austin USA

Users of distributed systems such as the TeraGrid and Open Science Grid can execute their applications on many different systems. We wish to help such users, or the grid schedulers they use, select where to run applications by providing predictions of when tasks will complete if sent to different systems. We make predictions of file transfer times, batch scheduler queue wait times, and application execution times using historical information and instance-based learning techniques. Our prediction errors for data from the TACC lonestar system are 37 percent of mean file transfer time, 115 percent for mean queue wait time, and 72 percent of mean execution time. Our approach achieves significantly lower prediction error on other workloads. We have wrapped these prediction techniques with Web services, making predictions available to users of distributed systems as well as tools such as resource brokers and metaschedulers.

关键词： distributed computing Web services Application software Relational databases Grid computing Processor scheduling Spatial databases Computer applications Costs parallel processing

来源：评论

学校读者我要写书评

暂无评论

distributed architecture for large scale image-based search

Distributed architecture for large scale image-based search

引用

IEEE international Conference on Multimedia and Expo (ICME 2007)

作者： Zheng, Yu Xie, Xing Ma, Wei-Ying Microsoft Res Asia Beijing 100080 Peoples R China

ISBN: (纸本)9781424410163

In recent years, some computer vision algorithms such as SIFT (Scale Invariant Feature Transform) have been employed in image similarity match to perform image-based search applications. However, with the increasing scale of image databases, centralized image retrieval system no longer provide adequate prompt search. In this paper, we design a scalable distributed architecture, which is analog to web search engine, for efficient large-scale image retrieval. In our distributed architecture, images are partitioned to multiple servers and an index is built. Administrated by a controlling server, each distributed server matches query image in its own image sub-collection in parallel and returns the intermediate search results, a list of images similar to query image, to the controlling server for further re-ranking and merging. An evaluation of the results shows that our distributed architecture removes the limitation of a centralized image retrieval system. By performing reasonable indexing, merging and ranking strategies, the precision level of search is near to that performed on stand-lone retrieval systems indexing all images.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

OBSI: Object based storage system for massive image databases

OBSI: Object based storage system for massive image database...

引用

8th ACIS international Conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed Computing/3rd ACIS international Workshop on Self-Assembling Wireless Networks

作者： Yu, Lihua Chen, Gang Bei, Yyun Shao, Feng Dong, JinXiang Zhejiang Univ Coll Comp Sci Hangzhou 310027 Zhejiang Peoples R China

ISBN: (纸本)9780769529097

The popularity of online free album services in the recent prevailing Web2.0 paradigm has posed great challenges to the existing image storage systems. In this paper, we analyze the characteristics of online image storage techniques from a system perspective. We present a novel framework called OBSI, which stands for an object based storage system for storing and retrieving images of online album services. In the design of OBSI, we employ a novel divide and conquer approach which subdivides OBSI into two layers: an object layer and a chunk layer. The chunk layer handles the "dirty work", such as disk space management and reliability guarantee. The object layer provides a uniform object storage and retrieval interface to applications. OBSI reduces disk access by employing a simple and yet effective storage allocation algorithm which allocates storage objects continuously as clustered to their respective metadata Experimental results show that OBSI provides high efficiency and throughput in image storage and retrieval services.

关键词： distributed file system object based storage image database

来源：评论

学校读者我要写书评

暂无评论

Architectural considerations for efficient software execution on parallel microprocessors

Architectural considerations for efficient software executio...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Vadlamani, Srinivas Jenks, Stephen Dept. of Electrical Engineering and Computer Science University of California Irvine CA United States

ISBN: (纸本)1424409101

Chip Multiprocessors (CMPs) and Simultaneous Multithreading (SMT) processors provide high performance but put more pressure on the memory interface than their single-thread counterparts. The "memory wall" problem is exacerbated, by multiple threads sharing a memory interface, and will get worse as more cores are added. Therefore, communications between cores, using shared caches or fast interconnects between private caches, are needed to keep the CPUs busy without burdening the memory interface. Multiple CMP systems add another dimension to this challenging problem, as the communication mechanism is no longer uniform. To parallelize data-intensive applications for high performance on these systems, one must explore a number of execution behaviors in a complex architecture-dependent exercise that entails identifying key components of the communication subsystem and understanding their behavior under varying workloads. As part of ongoing research into efficient program execution models for parallel microprocessors, we have developed a tool to evaluate the performance of the storage controllers at different levels of the memory hierarchy under varying workloads and measure cache coherence overhead. The tool allows exploration of architectural features of real processors that affect the performance of several parallel execution approaches. Here, we demonstrate its use by evaluating two of our parallel programming models that employ architecture-specific optimizations and compare them to a conventional model for several applications on parallel microprocessors. © 2007 IEEE.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

Invited paper: A compile-time cost model for OpenMP

Invited paper: A compile-time cost model for OpenMP

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Liao, Chunhua Chapman, Barbara University of Houston Computer Science Department Houston TX 77204 United States

ISBN: (纸本)1424409101

OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. It is also a promising candidate to exploit the emerging multicore, multithreaded processors. In addition, there is an increasing trend to combine OpenMP with MPI to take full advantage of mainstream supercomputers consisting of clustered SMPs. All of these require that attention be paid to the quality of the compiler's translation of OpenMP and the flexibility of runtime support. Many compilers and runtime libraries have an internal cost model that helps evaluate compiler transformations, guides adaptive runtime systems, and helps achieve load balancing. But existing models are not sufficient to support OpenMP, especially on new platforms. In this paper, we present our experience adapting the cost models in OpenUH, a branch of Open64, to estimate the execution cycles of parallel OpenMP regions using knowledge of both software and hardware. Our OpenMP cost model reuses major components from Open64, along with extensions to consider more OpenMP details. Preliminary evaluations of the model are presented using kernel benchmarks. The challenges and possible extensions for modeling OpenMP on multicore platforms are also discussed. © 2007 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：