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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Benchmarking the MRNet distributed tool infrastructure: Lessons learned

Benchmarking the MRNet distributed tool infrastructure: Less...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Roth, Philip C. Arnold, Dorian C. Miller, Barton P. Computer Sciences Department University of Wisconsin 1210 W. Dayton St. Madison WI 53706-1685 United States

ISBN: (纸本)0769521320

MRNet is an infrastructure that provides scalable multicast and data aggregation functionality for distributed tools. While evaluating MRNet's performance and scalability, we learned several important lessons about benchmarking large-scale, distributed tools and middleware. first, automation is essential for a successful benchmarking effort, and should be leveraged whenever possible during the benchmarking process. Second, microbenchmarking is invaluable not only for establishing the performance of low-level functionality, but also for design verification and debugging. Third, resource management systems need substantial improvements in their support for running tools and applications together. Finally, the most demanding experiments should be attempted early and often during a benchmarking effort to increase the chances of detecting problems with the tool and experimental methodology.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Heuristic resource allocation algorithms for maximizing allowable workload in dynamic, distributed real-time systems

Heuristic resource allocation algorithms for maximizing allo...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Juedes, David Drews, Frank Welch, Lonnie Fleeman, David Ctr. Intelligent Distributed/D.S. Sch. of Elec. Eng. and Comp. Science Ohio University Athens OH 45701 United States

ISBN: (纸本)0769521320

This paper examines several heuristic algorithms for the maximum allowable workload (MAW) problem for real-time systems with tasks having variable workloads. Briefly, the problem concerns the allocation of n tasks to m processors, where each task t is characterized by a function t.r(w) that gives the running time of the task in terms of its workload (or input size) w. The objective of the maximum allowable workload problem is to find an allocation of tasks to processors so that the allocation is feasible (no task misses its deadline) when each task is given a work-load of w or smaller and w is maximized. This optimization problem uses a robustness measure that is closely related to the MAIL (maximum allowable increase in load) metric recently proposed by Gertphol et. al. The main contribution of this paper is the the comparison of several heuristic algorithms for the MAW-RMS problem. Hillclimbing, random search, simulated annealing, and first-fit heuristics are presented and evaluated via simulation. As we show here, the first-fit greedy heuristic produces solutions of a reasonable quality compared to the other algorithms. In addition, we demonstrate the applicability of our model in air defense systems.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Specification and architecture supports for component adaptations on distributed environments

Specification and architecture supports for component adapta...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Chen, Chung-Kai Chen, Cheng-Wei Lee, Jenq-Kuen Department of Computer Science National Tsing Hua University Hsinchu 30043 Taiwan

ISBN: (纸本)0769521320

With the arrival of the new computing paradigm in addressing autonomous systems for heterogeneous distributed architectures, distributed component technologies face challenges ahead. One of the key issues will be how one can have component models adapt and respond to environment changes autonomously. In our research work, we argue that additional annotation specifications for components are needed to advance this process. In this paper, we first present additional annotation specifications for components. This information can then be retrieved by Java introspection and represented in DAML+OIL language, which is based on the RDF schema and the XML syntax. Based on the specifications, we then present a Component Management Service (CMS) model and architecture to address the specification and composition issues of components on heterogeneous distributed architectures. Experimental results show significant performance improvements with our support of component adaptations in all cases. Our work presents a major advance for areas related to specifications and compositions of distributed components.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A parallel adaptive GA for linkage disequilibrium in genomics

A Parallel adaptive GA for linkage disequilibrium in genomic...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Vermeulen-Jourdan, Laetitia Dhaenens, Clarisse Talbi, El-Ghazali LIFL Bâtiment M3 Cité Scientifique 59655 Villeneuve d'Ascq Cedex France

ISBN: (纸本)0769521320

In this paper, we treat the linkage disequilibrium, used to discover haplotypes, candidate to explain multi-factorial diseases such as diabetes or obesity, as an optimization problem where a given objective function has to be optimized. In order to determine what kind of algorithm will be able to solve this problem, we first study the specificities and the structure of the problem. Results of this study show that exact algorithms are not adapted to this specific problem and lead us to the development of a parallel dedicated adaptive multipopulation genetic algorithm that is able to find several haplotypes of different sizes. After describing the biological problem, we present the dedicated genetic algorithm, its specificities, such as the use of several populations and its advanced mechanisms such as the adaptive choice of operators, random immigrants, and its parallel implementation. We give results on a real dataset.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Execution of typical scientific applications on Globus-based Grids

Execution of typical scientific applications on Globus-based...

引用

proceedings - ISPDC 2004: Third international symposium on parallel and distributed Computing/HeteroPar '04: Third international Workshop on Algorithms, Models and Tools for parallel Computing on Heterogeneous Networks

作者： Herrera, J. Huedo, E. Montero, R.S. Llorentet, I.M. Dpto. Arquitectura de Computadores y Automática Facultad de Informática Universidad Complutense 2 8040 Madrid Spain 28850 Torrejón de Ardoz Spain

ISBN: (纸本)0769522106

One of the barriers that prevents the expansion and adoption of Grid technologies is the lack of a standard programming paradigm to port existing applications among different environments. The distributed Resource Management Application API (DRMAA) has been proposed to aid the rapid development and distribution of these applications across the Grid. In this paper we present the first implementation of the DRMAA standard on a Globus-based testbed, and show its suitability to express typical scientific applications. As a case of study, we will consider in this paper the implementation of the NAS Grid Benchmarks with DRMAA. The DRAL4A routines are supported by the functionality offered by the GridWay framework, that provides the runtime mechanisms needed for transparently executing jobs on a dynamic Grid environment. © 2004 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

LessLog: A logless file replication algorithm for peer-to-peer distributed systems

LessLog: A logless file replication algorithm for peer-to-pe...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Huang, Kuang-Li Huang, Tai-Yi Chou, Jerry C.Y. Department of Computer Science National Tsing Hua University Hsinchu 300 Taiwan

ISBN: (纸本)0769521320

The technique of replicating frequently-accessed files to other nodes has been widely used in a high-performance distributed system to reduce the load of the nodes hosting these files. Traditional file replication algorithms rely on the analysis of client-access logs to determine the location of the replicated nodes. In this paper, we present LessLog, a logless file replication algorithm, developed for a peer-to-peer distributed system. We first construct a lookup tree for each node. LessLog uses bitwise operations to determine the location of the replicated node without any client-access history. In addition, each replication is guaranteed to reduce the workload of the replicating node by half. A fault-tolerant LessLog model is also presented. The experimental results show that LessLog successfully and efficiently reduces the load of overloaded nodes.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Strategies for using additional resources in parallel hash-based join algorithms

Strategies for using additional resources in parallel hash-b...

引用

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

作者： Zhang, X Kurc, T Pan, T Catalyurek, U Narayanan, S Wyckoff, P Saltz, J Ohio State Univ Dept Biomed Informat Columbus OH 43210 USA

ISBN: (纸本)0780321754

Hash-basedjoin is a compute- and memory-intensive algorithm. It achieves good performance and scales well to large datasets, if sufficient memory is available to hold the hash table and the distribution of computing load across nodes is balanced. In this paper we compare three adaptive algorithms that start with a partitioning of the hash table across a group of nodes and expand during the hash table building phase to additional resources, when memory on a node is used up. The split-based algorithm partitions the hash table range assigned to the node, on which memory is full, into two segments and assigns one of the segments to a new node in the system. The replication-based algorithm replicates the hash table range on a new node. The hybrid algorithm combines the first and second strategies in order to address each strategy's short comings. We perform an experimental performance evaluation of these algorithms on a PC cluster Our results show that among the three algorithms, in most cases the hybrid algorithm either performs close to the better of the two or is the best algorithm.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

System-level fault-tolerance in large-scale parallel machines with buffered coscheduling

System-level fault-tolerance in large-scale parallel machine...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Petrini, Fabrizio Davis, Kei Sancho, José Carlos Perf. and Architecture Laboratory Computer Science Division Los Alamos National Laboratory NM 87545 United States

ISBN: (纸本)0769521320

As the number of processors for multi-teraflop systems grows to tens of thousands, with proposed petaflops systems likely to contain hundreds of thousands of processors, the assumption of fully reliable hardware has been abandoned. Although the mean time between failures for the individual components can be very high, the large total component count will inevitably lead to frequent failures. It is therefore of paramount importance to develop new software solutions to deal with the unavoidable reality of hardware faults. In this paper we will first describe the nature of the failures of current large-scale machines, and extrapolate these results to future machines. Based on this preliminary analysis we will present a new technology that we are currently developing, buffered coscheduling, which seeks to implement fault tolerance at the operating system level. Major design goals include dynamic reallocation of resources to allow continuing execution in the presence of hardware failures, very high scalability, high efficiency (low overhead), and transparency - requiring no changes to user applications. Preliminary results show that this is attainable with current hardware.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of parallel programming environments for implementing AIAC algorithms

Performance comparison of parallel programming environments ...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Bahi, Jacques M. Contassot-Vivier, Sylvain Couturier, Raphaël Lab. d'Info. de Franche-Comté IUT de Belfort-Montbéliard BP 27 90016 Belfort France

ISBN: (纸本)0769521320

AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous works. The first goal of this article is to compare several parallel programming environments in order to see if there is one of them which is best suited to efficiently implement AIAC algorithms. The main criterion for this comparison consists in the performances achieved in a global context of grid computing for two classical scientific problems. Nevertheless, we also take into account two secondary criteria which are the ease of programming and the ease of deployment. The second goal of this study is to extract from this comparison the important features that a parallel programming environment must have in order to be suited for the implementation of AIAC algorithms.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Analytic comparison of two advanced C language-based parallel programming models

Analytic comparison of two advanced C language-based paralle...

引用

3rd international symposium on parallel and distributed Computing (ISPDC 2004)/3rd international Workshop on Algorithms, Models and Tools for parallel Computing on Heterogeneous Networks (HeteroPar 04)

作者： Marowka, A Hebrew Univ Jerusalem Sch Comp Sci & Engn Comp Aided Design Lab IL-91904 Jerusalem Israel

ISBN: (纸本)0769522106

There are two main approaches for designing parallel language. The first approach states that parallel computing demands new programming concepts and radical intellectual changes regarding the way we think about programming, as compared to sequential computing. Therefore, the design of such a parallel language must present new constructs and new programming methodologies. The second approach states that there is no need to reinvent the wheel, and serial languages can be extended to support parallelism. The motivation behind this approach is to keep the language as friendly as possible for the programmer who is the main bridge toward wider acceptance of the new language. In this paper we present a qualitative evaluation of two contemporary parallel languages: OpenMP-C and Unified parallel C (UPC). Both are explicit parallel programming languages based on the ANSI C standard. OpenMP-C was designed for shared-memory architectures and extends the base-language by using compiler directives that annotate the original source-code. On the other hand, UPC was designed for distribute-shared memory architectures and extends the base-language by new parallel constructs. We deconstruct each parallel language into its basic components, show examples, make a detailed analysis, compare them, and finally draw some conclusions.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：