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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Experimental validation of parallel computation models on the Intel Paragon 1

Experimental validation of parallel computation models on th...

引用

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

作者： Juurlink, BHH Univ Gesamthsch Paderborn Heinz Nixdorf Inst D-33102 Paderborn Germany

ISBN: (纸本)0818684038

Experimental data validating some of the proposed parallel computation models on the Intel Paragon is presented. This architecture is characterized by a large bandwidth and a relatively large startup cost of a message transmission, which makes it extremely important to employ bulk transfers. The models considered are the BSP model, in which it is assumed that all messages have a fixed short size, and the BPRAM, in which block transfers are rewarded.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Predicate control for active debugging of distributed programs 1

Predicate control for active debugging of distributed progra...

引用

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

作者： Tarafdar, A Garg, VK Univ Texas Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)0818684038

Existing approaches to debugging distributed systems involve a cycle of passive observation followed by computation replaying. We propose predicate control as an active approach to debugging such systems. The predicate control approach involves a cycle of observation followed by controlled replaying of computations, based on observation. We formalize the predicate control problem for both off-line and on-line scenarios. We prove that off-line predicate control for general boolean predicates is NP-hard. However;we provide an efficient solution for off-line predicate control for the class of disjunctive predicates. We further solve on-line predicate control for disjunctive predicates under certain restrictions on the system. Lastly, we demonstrate how both off-line and on-line predicate control facilitate distributed debugging by allowing the programmer to control computations to maintain global safety properties.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Multiprocessor architectures using multi-hop multi-OPS lightwave networks and distributed control 1

Multiprocessor architectures using multi-hop multi-OPS light...

引用

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

作者： Coudert, D Ferreira, A Munoz, X Ecole Normale Super Lyon LIP F-69364 Lyon 07 France

ISBN: (纸本)0818684038

Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. in this paper we propose a passive star multi-hop lightwave network called stack-Kautz, based on the Kautz graph. We show that this architecture is very cost-effective with respect to its resources requirements. We also propose control protocols for accessing the optical passive star couplers, which improve on the bit complexity of the control sequence proposed in the literature for the Partitioned Optical Passive Star network Finally, we show through simulation that these control protocols efficiently implement shortest path routing on the stack-Kautz network.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Toward a universal mapping algorithm for accessing trees in parallel memory systems 1

Toward a universal mapping algorithm for accessing trees in ...

引用

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

作者： Auletta, V Das, SK De Vivo, A Pinotti, MC Scarano, V Univ Salerno Dipartimento Informat & Appl RM Capocelli I-84081 Baronissi SA Italy

ISBN: (纸本)0818684038

We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typical templates for accessing trees are subtrees, root-to-leaf paths, or levels which will be referred to as elementary templates. In this paper, we first propose a new mapping algorithm for accessing both paths and subtrees of size M with an optimal number of conflicts'(i.e., only one conflict) when the number of memory modules is limited to M. We also propose another mapping algorithm for a composite template, say V las versatile), such that its size is not fixed and an instance of V is composed of any combination of c instances of elementary templates. The number of conflicts for accessing an S-node instance of template V is O(s/root M log M + c) memory load as 1+ o(1) where load is defined as the ratio between the maximum and minimum number of data items mapped onto each memory module.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Efficient fine-grain thread migration with active threads 1

Efficient fine-grain thread migration with active threads

引用

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

作者： Weissman, B Gomes, B Quittek, JW Holtkamp, M Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)0818684038

Thread migration is established as a mechanism for achieving dynamic load sharing. However;fine-grained migration has not been used due to the high thread and messaging overheads. This paper describes a fine-grained thread migration system whose extensible event mechanism permits an efficient interface between threads and communications, without compromising the modularity and performance of either: Migration is supported by user level primitives based on which applications may implement different migration policies. The system is portable and can be used directly or serve as a compilation target for parallel languages. The system runs on a cluster of SMPs and observed performance is orders of magnitude better than other reported measurements.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic processor allocation with the Solaris operating system 1

Dynamic processor allocation with the Solaris operating syst...

引用

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

作者： Yue, KK Lilja, DJ Sun Microsyst Inc Solaris OS Grp Palo Alto CA 94303 USA

ISBN: (纸本)0818684038

The Loop-Level Process Control (LLPC) policy [9] dynamically adjusts the number of threads an application is allowed to execute based on the application's available parallelism and the overall system load. This study demonstrates the feasibility of incorporating the LLPC strategy into an existing commercial operating system and parallelizing compiler and provides further evidence of the performance improvement that is possible using this dynamic allocation strategy. In this implementation, applications are automatically parallelized and enhanced with the appropriate LLPC hooks so that each application interacts with the modified version of the Solaris operating system. The parallelism of the applications is then dynamically adjusted a automatically when they are executed in a multiprogrammed environment so that all applications obtain a fair share of the total processing resources.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Predicting the running times of parallel programs by simulation 1

Predicting the running times of parallel programs by simulat...

引用

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

作者： Rugina, R Schauser, KE Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)0818684038

Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processors. However deriving an explicit formula for the running time of a certain parallel program is a difficult task. We present a new method for the analysis of parallel programs: simulating the execution of parallel programs by following their control flow and by determining, for each processor the sequence of send and receive operations according to the LogGP model. We developed two algorithms to simulate the LogGP communication between processors and we tested them on the blocked parallel version of the Gaussian Elimination algorithm on the Meiko CS-2 parallel machine. Our implementation showed that the LogGP simulation is able to detect the nonlinear behavior of the program running times, to indicate the differences in running times for different data layouts and to find the local optimal value of the block size with acceptable precision.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

Processor lower bound formulas for array computations and parametric diophantine systems 1

Processor lower bound formulas for array computations and pa...

引用

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

作者： Cappello, P Egecioglu, O Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)0818684038

Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedence-constrained multiprocessor schedules for array computations: Given a sequence of dags and linear schedules parametrized by n, compute a lower bound on the number of processors required by the schedule as a function of n. In our formulation, the number of tasks that are scheduled for execution during any fired time step is the number of non-negative integer solutions d(n) to a set of parametric linear Diophantine equations.: We illustrate an algorithm based on generating functions far constructing a formula for these numbers d(n). The algorithm has been implemented as a Mathematica program. An example run and the symbolic formula for processor lower bounds automatically produced by the algorithm for Gaussian Elimination is presented.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparing the optimal performance of different MIMD multiprocessor architectures 1

Comparing the optimal performance of different MIMD multipro...

引用

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

作者： Lundberg, L Lennerstad, H Univ Karlskrona Ronneby Dept Comp Sci S-37225 Ronneby Sweden

ISBN: (纸本)0818684038

We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors each. A parallel program, consisting of n processes, is executed on this system. Processes may be relocated between the processors in a cluster They may, however not be relocated from one cluster to another The performance criterion is the completion time of the parallel program. We present two functions: g(n,k, u, q) and G(k, u, q). Provided that we can find optimal or near optimal schedules, these functions put optimal upper bounds on the gain of using one cluster containing q processors compared to using k clusters containing u processors each. The function g(n,k,u,q) is valid for programs with n processes, whereas G(k,u,q) only depends on the two multiprocessor architectures. By evaluating g(n,k,u,q) and G(k, u, q) we show that the gain of increasing the cluster size from 1 to 2 and from 2 to 4 is relatively large. However;the gain of using clusters larger than 4 is very limited.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：