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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Robust transaction routing in distributed database systems

引用

proceedings international symposium on databases in parallel and distributed systems

作者： Lee, Yann-Hang Yu, Philip S. Leff, Avraham Univ of Florida Comput Sci Dep Gainesville FL USA

ISBN: (纸本)0818608935

The authors examine the issue of robust transaction routing in distributed database systems. A class of dynamic routing strategies which are estimated response times to make routing decisions is studied in details. Since response time estimation and decision making depend on the assumed transaction model and parameers, it is important to examine the robustness or sensitivity to the inaccuracy in the assumptions and parameter values. Through simulations, the authors find that the dynamic routing strategy based strictly on response time is too aggressive in sharing loads and makes too many nonpreferred system routings. It is robust with respect to change in the number of database calls per transaction, but is relatively sensitive to the distribution of database calls. Two refinements are proposed which improve system performance as well as robustness of routing decisions.

关键词： Database 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

来源：评论

学校读者我要写书评

暂无评论

CORRECTING EXECUTION OF distributed QUERIES 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： BODORIK, P PYRA, J RIORDON, JS School of Computer Science Technical University of Nova Scotia P.O. Box 1000 Halifax Nova Scotia B3J 2X4 Canada Dept. of Systems and Computer Engineering Carleton University Ottawa Ontario K1S 5B6 Canada

ISBN: (纸本)0818620528

Algorithms for processing distributed queries require a priori estimates of the size of intermediate relations. Most such algorithms take a “static” approach in which the algorithm is completely determined before processing begins. If size estimates are found to be inaccurate at some intermediate stage, there is no opportunity to re-schedule, and the result may be far from optimal. Adaptive query execution may be used to alleviate the problem. Care is necessary, though, to ensure that the delay associated with re-scheduling does not exceed the time saved through the use of a more efficient strategy. This paper presents a low overhead delay method to decide when to correct a strategy. Sampling is used to estimate the size of relations, and alternative heuristic strategies prepared in a background mode are used to decide when to correct. Correction is made only if lower overall delay is achieved, including correction time. Evaluation using a model of a distributed data base indicates that the heuristic strategies are near optimal. Moreover, it also suggests that it is usually correct to abort creation of an intermediate relation which is much larger than predicted.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Application of parallel disks for efficient handling of object-oriented databases

Application of parallel disks for efficient handling of obje...

引用

proceedings of the 5th IEEE symposium on parallel and distributed Processing

作者： Chehadeh, Y.C. Hurson, A.R. Miller, L.L. Pakzad, S. Jamoussi, B.N. Pennsylvania State Univ University Park United States

ISBN: (纸本)081864222X

In today's workstation based environment, applications such as design databases, multimedia databases, and knowledge bases do not fit well into the relational data processing framework. The object-oriented data model has been proposed to model and process such complex databases. Due to the nature of the supported applications, object-oriented database systems need efficient mechanisms for the retrieval of complex objects and the navigation along the semantic links among objects. Object clustering and buffering have been suggested as efficient mechanisms for the retrieval of complex objects. However, to improve the efficiency of the aforementioned operations, one has to look at the recent advances in storage technology. This paper is an attempt to investigate the feasibility of using parallel disks for object-oriented databases. It analyzes the conceptual changes needed to map the clustering and buffering schemes proposed in [8,9] on the new underlying architecture. The simulation and performance evaluation of the proposed leveled-clustering and mapping schemes utilizing parallel I/O disks are presented and analyzed.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Simplified-BBO for Non-redundant Allocation of Data in distributed Database Design

Simplified-BBO for Non-redundant Allocation of Data in Distr...

引用

IEEE international Midwest symposium on Circuits and systems (MWSCAS)

作者： Singh, Arjan Khehra, Baljit Singh Mavi, Bhupinder Singh Punjabi Univ Dept Math Patiala Punjab India BAM Khalsa Coll Garshankar Punjab India HNC Virtual Solut Engn Wixom MI USA

ISBN: (纸本)9781665424615

The design of distributed database has became demanding with the increase in use of IoT and cloud based services. distributed database system's performance is totally relies on its design. Allocation of data is one of the major design issues while designing distributed databases. This paper presents a new technique for non-redundant allocation of data in distributed database design. The proposed approach allocates the data based on Simplified Biogeography Based Optimization (Simplified-BBO). The performance comparison of Simplified-BBO based approach is done against the GA and BBO based approaches. The proposed approach helps in decreasing the data communication cost during query execution which results in increasing the overall performance of distributed database systems.

关键词： distributed Database Design Non-redundant Data Allocation Simplified-SBBO BBO GA

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

FINITE-DIMENSIONAL APPROXIMATIONS OF distributed-PARAMETER ELECTRIC LINES

FINITE-DIMENSIONAL APPROXIMATIONS OF DISTRIBUTED-PARAMETER E...

引用

1993 IEEE international SYMP ON CIRCUITS AND systems

作者： ZIOLKO, M Univ of Mining and Metallurgy Krakow Poland

Approximation of partial differential equations of hyperbolic type by a set of ordinary differential equations is presented. The method of weighted-residual is applied. The Galerkin method and the finite element metho... 详细信息

ISBN: (纸本)0780312813

关键词： Electric lines

来源：评论

学校读者我要写书评

暂无评论

A parallel GLOBAL ROUTER FOR SEA-OF-GATES ARRAYS

A PARALLEL GLOBAL ROUTER FOR SEA-OF-GATES ARRAYS

引用

international SYMP ON CIRCUITS AND systems ( ISCAS 92 )

作者： AOKI, T MURAKATA, M ULSI Research Center TOSHIBA Corporation 1 Komukai Toshiba-cho Saiwai-ku Kawasaki 210 Japan

ISBN: (纸本)0780305930

This paper presents a new parallel global routing algorithm for sea-of-gates arrays and its parallel implementation. In the proposed method, making use of the fact that the number of widely distributed nets are comparatively few, the widely distributed nets are processed on one processor and the local nets are processed based on the RSM(Region Shifting Method) in parallel. The algorithm has been implemented on a distributed environment using many engineering workstations. The experimental results have shown that the proposed method achieved good speedups up to 7 using 8 processors. The routing quality is the same as the quality obtained by the sequential global routing method. © 1992 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：