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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Benchmark measurements of current UPC platforms

Benchmark measurements of current UPC platforms

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Zhang, Zhang Seidel, Steven Department of Computer Science Michigan Technological University Houghton MI 49931

ISBN: (纸本)0769523129

UPC is a parallel programming language based on the concept of partitioned shared memory. There are now several UPC compilers available and several different parallel architectures that support one or more of these compilers. This paper is the first to compare the performance of most of the currently available UPC implementations on several commonly used parallel platforms. These compilers are the GASNet UPC compiler from UC Berkeley, the v1.1 MuPC compiler from Michigan Tech, the HewletPackard v2.2 compiler, and the Intrepid UPC compiler. The parallel architectures used in this study are a 16-node x86 Myrinet cluster, a 32-processor AlphaServer SC-40, and a 48-processor Cray T3E. A STREAM-like microbenchmark was developed to measure fine- and course-grained shared memory accesses. Also measured are five NPB kernels using existing UPC implementations. These measurements and associated observations provide a snapshot of the relative performance of current UPC platforms.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed self-* minimum connected covering of a query region in sensor networks

Distributed self-* minimum connected covering of a query reg...

引用

8th international symposium on parallel Architectures, Algorithms and Networks

作者： Datta, AK Gradinariu, M Patel, R Univ Nevada Sch Comp Sci Las Vegas NV 89154 USA

ISBN: (纸本)0769525091

Wireless ad-hoc sensor networks are composed of a large number of tiny sensors that have limited resources and yet must form a connected network. A group of sensors is said to cover a certain region when the union of the sensing disks of these sensors completely cover this region. Given a query over a sensor network the minimum connected sensor cover problem is to select a minimum, or nearly minimum, set of sensors such that the selected sensors cover the query region and form a connected network. One proposed solution for the minimum connected sensor cover problem can be to first form a minimum connected dominating set (MCDS), and then to include all sensors in the MCDS in the final cover set. In this paper, we use this approach to present a fully distributed, strictly localized, scalable, self-* solution to the minimum connected sensor cover problem.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

WINP: A window-based incremental and parallel clustering algorithm for very large databases

WINP: A window-based incremental and parallel clustering alg...

引用

ICTAI 2005: 17th IEEE international Conference on Tools with Artificial Intelligence, ICTAI'05

作者： Qiang, Zhang Zheng, Zhao Wei, Sun Zhi Daley, Edward School of Electronic Information Engineering Tianjin University Tianjin China

ISBN: (纸本)0769524885

We introduce a new clustering algorithm called WINP for very large databases. Two different sizes of handling objects were used in WINP to acquire high accuracy and efficiency. WINP creates a window to detect approximate locations of clusters before accurate clustering processing. Clustering on these locations will reduce a lot of computations and get a good performance. WINP is the first algorithm to realize both incremental clustering and distributed parallel clustering. The advantages of our new approach are (1) It is very efficient;(2) It realizes distributed parallel processing and can be run on a number of workstations connected via local area network;(3) It introduces a novel incremental clustering method for new coming data in an already processed database;(4) It is effective in discovering clusters of arbitrary shape;(5) It is not sensitive to noise;and (6) It has some ability to deal with high dimensional points. © 2005 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed storage layout schemes

Distributed storage layout schemes

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Sobe, Peter University of Lübeck Institute of Computer Engineering Germany

ISBN: (纸本)0769523129

When distributing data across several nodes, two different approaches exist. The first one consists in distribution of the data object itself, e.g. in striping. The second approach is aggregation of local storages, whereby each data object is assigned to a home storage node. From the viewpoint of fault-tolerant data layouts, these schemes seem to be similar. In both cases the addition of parity, e.g. RAID level 3, level 5 or Reed-Solomon codes provide tolerance against node failures. A closer look shows differences in reachable access rates, needed number of messages and recovery cost. In this paper we compare both approaches and provide a method for self reconfiguration. The transformation from a parity grouping layout to a striping layout is shown to be feasible for stepwise and concurrent operation during data access.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Scheduling mixed workloads in multi-grids: The grid execution hierarchy

Scheduling mixed workloads in multi-grids: The grid executio...

引用

15th IEEE international symposium on High Performance distributed Computing

作者： Silberstein, Mark Geiger, Dan Schuster, Assaf Livny, Miron Technion Israel Inst Technol IL-32000 Haifa Israel

ISBN: (纸本)1424403073

Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We aim at achieving high throughput and short response time when scheduling such a workload over a set of uncoordinated grids of varying sizes and performance characteristics. We propose the concept of a grid execution hierarchy, where available grids are sorted according to their size, and the execution overheads increase with the size of the grids. We devise a scheduling algorithm for this execution hierarchy of grids by adapting the multilevel feedback queue approach to a multi-grid environment. The algorithm finds a grid of the size, availability, and overhead that best matches a task's resource requirements and expected turnaround time. Our approach is inspired by the Shortest Processing Time first policy (SPTF), in the sense that the task's processing demands are constantly reevaluated during its run, so that a task is migrated to a more suitable level of the execution hierarchy when appropriate. We evaluate our approach in the context of the Superlink-online system for processing genetic linkage analysis tasks - a production system consisting of several grids and utilizing tens of thousands of CPU hours a month [32]. With our approach the system provides nearly interactive response time for shorter tasks, while simultaneously serving throughput-oriented massively parallel tasks in an efficient manner(1).

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the CLI for I/O-intensive computing

Benchmarking the CLI for I/O-intensive computing

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Qin, Xiao Xie, Tao Nathan, Ahalya Tadepalli, Vijaya K. Department of Computer Science New Mexico Institute of Mining and Technology Socorro NM 87801 Department of Computer Science and Engineering University of Nebraska-Lincoln Lincoln NE 68588-0115

ISBN: (纸本)0769523129

Common Language Infrastructure, or CLI, is a standardized virtual machine, which increasingly becomes popular on a wide range of platforms. In this paper we developed three I/O-intensive benchmarks for the CLI using various techniques. The first benchmark is designed in accordance with an application behavioural model that rebuilds the behavior of real world I/O-intensive applications. The second benchmark is a trace driven simulator that simulates five I/O-intensive applications. The third benchmark is a micro I/O-Intensive benchmark used to emulate a simple web server. In addition, the performances of the benchmarks are evaluated on the SSCLI. The results suggest that the CLI is a potential virtual machine for I/O-intensive computing.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource management algorithm for a distributed real-time system

Dynamic resource management algorithm for a distributed real...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Cavanaugh, Charles Ari, Radhika Center for Advanced Computer Studies University of Louisiana Lafayette

ISBN: (纸本)0769523129

In this paper we propose a framework and algorithm for dynamic resource management in a distributed real-time system. Our assumptions are as follows: first, multiple real-time & non real-time processes are active throughout the system. Those processes in the critical path for a given task, i.e., autopilot, fire control (as in firing weapons), surveillance, collaborative planning, are RT for the duration of the task and may or may not be party to multiple tasks in either critical or ancillary capacities. For instance, the radar may be part of the critical path during surveillance, but have uses other thaan that, say to take a snampshot during a collaborative planning sessiong that may serve an ancillary use (as a supplementary illusatration for discussion, e.g., "this is the depot we will go after tomorrow during a flyover") But then, if you can fly over it, why not go after it then? Another example: during a coordinated maneuver, plane-to-plane communications are in the critical path but during fire control they are not. Second, the operating system or run-time environment has task migration capabilities. Third, storage is cheap - can store images of multiple processes in different states on each computing device for purpose of instantiating one or more in any combination on that device and across devices for reconfigurable distributed computing. This paper presents a software architecture and an algorithm for resource management in such systems.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Secure distributed computing on a Java Card™* Grid

Secure distributed computing on a Java Card™* Grid

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Chaumette, Serge Grange, Pascal Karray, Achraf Sauveron, Damien Vignèras, Pierre Laboratoire Bordelais de Recherche en Informatique UMR 5800 Université Bordeaux 1 351 cours de la Libération 33405 Talence Cedex France University of Sfax ENIS Tunisia LaBRI Bordeaux France LMSI Limoges France

ISBN: (纸本)0769523129

More and more pieces of hardware are being connected to the Internet every day. Technologies such as Bluetooth or Wi-Fi make this evolution even faster. To make these equipments cooperate and communicate with each other several paradigms such as mobile codes, mobile agents and remote procedure calls are particularly well adapted. These paradigms enable to execute a code that is either coming from somewhere over the network, or that is local but managed remotely. Security is then one of the main concerns that has to be dealt with. We believe that smart cards, and more precisely Java Cards can help to cope with this challenge. This is a position paper where we present the first results obtained on a Java Card based platform that we have set up for experimentation purpose. These experiments raise many questions we are currently working on.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Practical divisible load scheduling on grid platforms with APST-DV

Practical divisible load scheduling on grid platforms with A...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Van Der Raadt, Krijn Yang, Yang Casanova, Henri San Diego Supercomputer Center University of California San Diego Dept. of Computer Science and Engineering University of California San Diego

ISBN: (纸本)0769523129

Divisible load applications consist of a load, that is input data and associated computation, that can be divided arbitrarily into independent pieces. Such applications arise in many fields and are ideally suited to a master-worker execution, but they pose several scheduling challenges. While the "Divisible Load Scheduling" (DLS) problem has been studied extensively from a theoretical standpoint, in this paper we focus on practical issues: we extend a production Grid application execution environment, APST, to support divisible load applications;we implement previously proposed DLS algorithms as part of APST;we evaluate and compare these algorithms on a real-world two-cluster platform;we show in a case study how a user can easily and effectively run a real-world divisible load application;and we uncover several issues that are critical for using DLS theory in practice. To the best of our knowledge the software resulting from this work, APST-DV, is the first usable and generic tool for deploying divisible load applications on distributed computing platforms.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Configuration steering for a reconfigurable superscalar processor

Configuration steering for a reconfigurable superscalar proc...

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Veale, Brian F. Antonio, John K. Tull, Monte P. School of Computer Science University of Oklahoma School of Electrical and Computer Engineering University of Oklahoma

ISBN: (纸本)0769523129

An architecture for a reconfigurable superscalar processor is described in which some of its execution units are implemented in reconfigurable hardware. The overall configuration of the processor is defined according to how its reconfigurable execution units are configured. An efficient micro-architectural solution to configuration management is presented that effectively steers the current processor configuration toward a configuration that is well matched with the execution unit requirements of instructions being scheduled for execution. The approach first selects the best matched among four steering configurations based on the number and type of execution units required by the instructions. One of the steering configurations is dynamically defined as the current configuration;the other three are statically predefined. Once a steering configuration is selected, portions of it begin loading on corresponding reconfigurable execution units that are not busy. The active configuration of the processor is generally the overlap of two or more steering configurations.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：