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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,668 篇 会议
194 篇 期刊文献
25 册 图书

馆藏范围

4,887 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,499 篇 工学
- 2,385 篇 计算机科学与技术...
- 1,470 篇 软件工程
- 419 篇 信息与通信工程
- 385 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
490 篇 parallel process...
485 篇 concurrent compu...
410 篇 parallel process...
379 篇 application soft...
342 篇 distributed data...
335 篇 distributed comp...
310 篇 databases
288 篇 computer archite...
249 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
170 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,874 篇 英文
11 篇 其他
2 篇 中文

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

共 4887 条记录，以下是101-110 订阅

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

详细简洁

排序：

Performance sensitivity of space-sharing processor scheduling in distributed-memory multicomputers 1

Performance sensitivity of space-sharing processor schedulin...

引用

1st Merged international parallel Processing symposium/symposium on parallel and distributed Processing (IPPS/SPDP 1998)

作者： Dandamudi, SP Yu, H Carleton Univ Sch Comp Sci Ctr Parallel & Distributed Comp Ottawa ON K1S 5B6 Canada

ISBN: (纸本)0818684038

Processor scheduling in distributed-memory systems has received considerable attention in recent years. Several commercial distributed-memory systems use space-sharing processor scheduling. in space-sharing, the set of processors in a system is partitioned and each partition is assigned for the exclusive use of a job. Space-sharing policies can be divided into fixed, static, or dynamic categories. For distributed-memory systems, dynamic policies incur high overhead. Thus, static policies are considered as these policies provide a better performance than the fixed policies. Several static policies have been proposed in the literature. In a previously proposed adaptive static policy, the partition size is a function of the number of queued jobs. This policy, however, tends to underutilize the system resources. To improve the performance of this policy, we propose a new policy in which the partition size is a function of the total number of jobs in the system, as opposed to only the queued jobs. The results presented here demonstrate that the new policy performs substantially better than the original policy for the various workload and system parameters. Another major contribution is the evaluation of the performance sensitivity to job structure, variances in inter-arrival times and job service times, and network topology.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallel selection query processing involving index in parallel database systems

Parallel selection query processing involving index in paral...

引用

6th international symposium on parallel Architectures, Algorithms and Networks (I-SPAN 02)

作者： Rahayu, JW Taniar, D La Trobe Univ Dept Comp Sci & Comp Engn Bundoora Vic 3083 Australia

ISBN: (纸本)0769515797

Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection, join) on this attribute will become more efficient by utilizing the index. In this paper we focus on parallel algorithms for selection queries involving index that is data searching on indexed attributes. In this paper, we propose two categories of parallel selection queries using index: parallel exact match and range selections;depending on the type of selection conditions. As parallel algorithms for these selection queries are very much influenced by indexing schemes, we will also describe various index partitioning methods for parallel databases, and discusses their efficiency in supporting parallel selection query processing.

关键词： Australia Computer science Database systems Ear Electrical capacitance tomography Image databases Indexes Indexing Query processing Relational databases

来源：评论

学校读者我要写书评

暂无评论

Modeling parallel and distributed computing resources using structured metadata 12

Modeling parallel and distributed computing resources using ...

引用

12th international Conference on Database and Expert systems Applications (DEXA)

作者： Tomsich, P Vienna Tech Univ Inst Software Technol A-1040 Vienna Austria

ISBN: (纸本)0769512305

Modern database systems-and in particular multidatabase systems, federated database systems and OLAP-oriented data-warehouses-factor the stored data into actual content and meta-data, which structures the available information. This separation is particularly popular in the data-warehousing community, where large amounts of data are structured by and accessible through far smaller amounts of meta-data. Given a parallel or distributed database system, a sophisticated query optimizer requires information on the specific structure of the computing resource, the data distribution, data replication and interconnection bandwidths in order to optimally schedule computational subtasks. Such optimizations are of an even greater importance for next-generation OLAP engines, which attempt to substitute on-demand aggregation into virtual data-cubes and caching for eager preaggregation. Given the demand for ever faster response times and exponentially growing data sets, the parallelization of analytical database systems continuously gains in importance. As a result a portable and comprehensive framework for the representation of optimization-related information becomes necessary. This presentation discusses the possibilities for query optimization in parallel and distributed OLAP systems, given a detailed description of the underlying computing and storage infrastructure. A modeling framework for the description of the computing resource is introduced, which may be applied to a wide array of database systems. A discussion of using profiling information gathered during the execution of queries to dynamically refine the cost estimates given in the meta-data is also provided.

关键词： Concurrent computing Data analysis Data warehouses Database systems Delay distributed computing distributed databases Frequency Relational databases Transaction databases

来源：评论

学校读者我要写书评

暂无评论

Dynamic adjustment of execution order in real-time databases

Dynamic adjustment of execution order in real-time databases

引用

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

作者： Wang, Yongyan Wang, Qiang Wang, Hongan Dai, Guozhong Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences Beiging 100080 China

ISBN: (纸本)0769521320

Many researches have been devoted to designing appropriate concurrency control algorithms for real-time database systems, which not only satisfy consistency requirements but also meet transaction timing constraints as much as possible. Optimistic concurrency control protocols have the nice properties of being non-blocking and deadlock-free, but they have the problems of late conflict detection and transaction restarts. Although the number of transaction restarts is reduced by dynamic adjustment of serialization order (DASO) in real-time database systems, it still has some unnecessary transaction restarts. In this paper, we first propose a new method called dynamic adjustment of execution order (DAEO) and a new optimistic concurrency control algorithm based on DAEO, which can reduce the number of unnecessary restarts near to zero and outperforms the previous algorithms, and then discuss the experiments and the results.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Systematic debugging of parallel programs based on collective breakpoints

Systematic debugging of parallel programs based on collectiv...

引用

international symposium on Software Engineering for parallel and distributed systems

作者： Kacsuk, P Hungarian Acad Sci MTA SZTAKI H-1518 Budapest Hungary

ISBN: (纸本)0769501915

The paper introduces the concept of collective breakpoints and classifies the possible parallel breakpoints comparing their mechanisms. Based on the collective breakpoints the macrostep-by-macrostep execution mode has been defined. After introducing the concept of the execution tree and meta-breakpoints the systematic debugging of message passing parallel programs is explained. The main features and distributed structure of DIWIDE, a macrostep debugger is described. The integration of DIWIDE into the GRADE and WINPAR parallel programming environments is outlined. An algorithm is shown how to generate automatically the collective breakpoints in the GRADE environment.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Resource placements in 2D tori 1

Resource placements in 2D tori

引用

1st Merged international parallel Processing symposium/symposium on parallel and distributed Processing (IPPS/SPDP 1998)

作者： Almohammad, B Bose, B Kuwait Univ Dept Math & Comp Sci Safat 13060 Kuwait

ISBN: (纸本)0818684038

Results on how to place a limited number of resources in two dimensional torus-based parallel systems are described. The resources are placed so that every non-resource node is within a given distance d from some resource node. It is proved that the proposed methods are optimal in terms of reducing the maximum distance between the resource and the non-resource nodes. Simulation results show that the proposed methods are superior to the existing methods in terms of the average message latency.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

D³: Deterministic Data Distribution for Efficient Data Reconstruction in Erasure-Coded distributed Storage systems 33

D<SUP>3</SUP>: Deterministic Data Distribution for Efficient...

引用

33rd IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Li, Zhipeng Lv, Min Xu, Yinlong Li, Yongkun Xu, Liangliang Univ Sci & Technol China Sch Comp Sci & Technol Hefei Anhui Peoples R China

ISBN: (纸本)9781728112466

Due to individual unreliable commodity components, failures are common in large-scale distributed storage systems. Erasure codes are widely deployed in practical storage systems to provide fault tolerance with low storage overhead. However, the commonly used random data placement in storage systems based on erasure codes induces to heavy cross-rack traffic, load imbalance, and random access, which slow down the recovery process upon failures. In this paper, with orthogonal arrays, we define a Deterministic Data Distribution (D-3) of blocks to nodes and racks, and propose an efficient failure recovery approach based on D-3. D3 not only uniformly distributes data/parity blocks among storage servers, but also balances the repair traffic among racks and storage servers for failure recovery. Furthermore, D-3 also minimizes the cross-rack repair traffic for data layouts against a single rack failure and provides sequential access for failure recovery. We implement D-3 in Hadoop distributed File System (HDFS) with a cluster of 28 machines. Our experiments show that D-3 significantly speeds up the failure recovery process compared with random data distribution, e.g., 2.21 times for (6, 3)-RS code in a system consisting of eight racks and three nodes in each rack.

关键词： Bandwidth distributed databases Arrays Maintenance engineering Layout Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

Efficient, Chunk-Replicated Node Partitioned Data Warehouses

Efficient, Chunk-Replicated Node Partitioned Data Warehouses

引用

IEEE international symposium on parallel and distributed Processing with Applications

作者： Furtado, Pedro Univ Coimbra P-3000 Coimbra Portugal

ISBN: (纸本)9780769534718

Much has been said about processing efficiently data in parallel database servers, and some data warehouse applications must process in the order of tens to hundreds of Gigabytes efficiently. Yet, there is no effective approach targeted at using non-dedicated low-cost plaforms efficiently in this context. Imagine taking together 10 or 1000 commodity PCs and setting-up a data crunching platform for large database-resident data with acceptable performance. There are significant inter-related data layout and processing challenges when the computational, storage and network hardware are heterogeneous and slow. We propose how to place, replicate and load-balance the data efficiently in this context. This work innovates in several respects: being practically as fast as full-mirroring without its overhead, exploring schema, chunk-wise placement, replication and load-balanced processing to be faster and more flexible than previous efforts. Our findings are complemented by an evaluation using TPC-H performance benchmark queries.

关键词： parallel databases performance parallel databases Data warehousing Load balancing Fasting Heterogeneous

来源：评论

学校读者我要写书评

暂无评论

parallel Query Service for Object-centric Data Management systems 34

Parallel Query Service for Object-centric Data Management Sy...

引用

34th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Tang, Houjun Byna, Suren Dong, Bin Koziol, Quincey Lawrence Berkeley Natl Lab Berkeley CA 94720 USA

ISBN: (纸本)9781728174457

While large-scale scientific experiments and simulations produce massive amounts of data, a small fraction of data contains useful information. Efficient querying on such volume of data to extract that information increases the productivity of the scientific discovery process. Although querying has been explored extensively in relational databases, research and adoption of querying tools for scientific data that is stored in parallel file systems on high performance computing (HPC) systems are still in infancy. In this paper, we introduce a parallel query service, called PDC-Query, for an object data management systems (ODMS) on HPC systems. It operates on partitioned objects in parallel, and provides several optimization strategies for fast query evaluation. The ODMS paradigm for HPC systems is promising in reducing the burden on users in data management and in moving data transparently across the deep memory hierarchy in modern HPC systems. We propose a 'global histogram'-based approach to accelerate query evaluation, through selectivity estimation and reducing the amount of data that needs to be loaded from storage and processed. We compare querying performance and demonstrate the efficiency and scalability of different approaches PDC-Query supports, including using global histograms, bitmap indexes, sorting, and full scan, in performing various queries on top of a plasma physics dataset with 125 billion particles and an astronomy dataset with 25 million objects.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Run-time support for scheduling parallel applications in heterogeneous NOWs

Run-time support for scheduling parallel applications in het...

引用

6th IEEE international symposium on High Performance distributed Computing

作者： Weissman, JB Zhao, X Univ of Texas at San Antonio San Antonio United States

ISBN: (纸本)0818681187

This paper describes the current state of - Prophet a system that provides run-rime scheduling support for parallel applications in heterogeneous workstation networks. Prior work on Prophet [10][12] demonstrated that scheduling SPMD applications could be effectively automated with excellent performance. Enhancements have been made to Prophet to broaden its use to other application types including parallel pipelines, and to make more effective use of dynamic system state information to further improve performance. The results indicate that both SPMD and parallel pipeline applications can be scheduled to produce reduced completion time by exploiting the application structure and run-time information.(1).

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：