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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

497 篇 会议
10 篇 期刊文献
6 册 图书

馆藏范围

513 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

197 篇 工学
- 185 篇 计算机科学与技术...
- 96 篇 软件工程
- 37 篇 信息与通信工程
- 26 篇 电气工程
- 13 篇 控制科学与工程
- 10 篇 材料科学与工程（可...
- 9 篇 电子科学与技术（可...
- 4 篇 网络空间安全
- 3 篇 安全科学与工程
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 冶金工程
54 篇 理学
- 48 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 地质学
34 篇 管理学
- 28 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
1 篇 军事学

主题

93 篇 computer science
79 篇 concurrent compu...
71 篇 distributed comp...
67 篇 application soft...
65 篇 database systems
62 篇 parallel process...
59 篇 databases
57 篇 distributed data...
43 篇 transaction data...
42 篇 delay
39 篇 computer archite...
37 篇 algorithm design...
36 篇 costs
36 篇 relational datab...
35 篇 hardware
30 篇 processor schedu...
30 篇 large-scale syst...
27 篇 computational mo...
27 篇 performance anal...
27 篇 computer network...

机构

7 篇 ibm thomas j. wa...
4 篇 department of co...
3 篇 ieee
3 篇 king saud univer...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 toyohashi univer...
2 篇 center for paral...
2 篇 department of co...
2 篇 school of comput...
2 篇 computer science...
2 篇 department of el...
2 篇 university of el...
2 篇 school of comput...
2 篇 department of bi...
2 篇 school of comput...
2 篇 eth zurich
2 篇 computer science...
2 篇 computer science...

作者

6 篇 a. choudhary
5 篇 j. saltz
4 篇 t. kurc
4 篇 a. boukerche
4 篇 a. el abbadi
3 篇 f. dehne
3 篇 p.s. yu
3 篇 wan maseri wan m...
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 jasni mohamad za...
3 篇 eyas el-qawasmeh
3 篇 d. agrawal
2 篇 a. burger
2 篇 a. rau-chaplin
2 篇 a. ghafoor
2 篇 s. bandyopadhyay
2 篇 hoefler torsten
2 篇 o. wolfson

语言

512 篇 英文
1 篇 其他

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

共 513 条记录，以下是451-460 订阅

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

详细简洁

排序：

Optimal partitioning of random workloads in homogeneous multiprocessor and distributed systems

Optimal partitioning of random workloads in homogeneous mult...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： E.K. Haddad Department of Computer Sciences Virginia Polytechnic Institute and State University Falls Church VA USA

The problem of distributing M interacting program modules of a given homogeneous random workload over P identical processors for optimizing execution time is examined. The execution time modeling allows full concurrency of activities among different processors but cascades for each processor its computation time, internal communications, external communications, and synchronization/contention delays. The results obtained express the optimality conditions in terms of the various statistical and deterministic parameters of the problem: number of modules; number of processors; mean value of module run time; probabilities and mean values of intraprocessor, interprocessor, and synchronization/contention communications overheads. Optimal load distributions are found to be either even or single-processor assignments, albeit for different conditions than stipulated in previous results.< >

关键词： Concurrent computing Computer science Delay effects Multiprocessing systems parallel processing Heuristic algorithms Partitioning algorithms Computational complexity Random variables Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

An adaptive cache coherence scheme for hierarchical shared-memory multiprocessors

An adaptive cache coherence scheme for hierarchical shared-m...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Qing Yang G. Thangadurai L.N. Bhuyan Department of Electrical Engineering University of Rhode Island Kingston RI USA Department of Computer Sciences Texas A and M University College Station TX USA

The paper considers a large scale, cache-based multiprocessor that is interconnected by a hierarchical network such as hierarchical buses or a multistage interconnection network (MIN). An adaptive cache coherence scheme for the system is proposed based on a hardware approach that handles multiple shared reads efficiently while reducing the network traffic. The new protocol allows multiple copies of a shared data block in the hierarchical network, but minimizes the cache coherence overhead by dynamically partitioning the network into sharing and non-sharing regions based on program behaviors. The new cache coherence scheme effectively utilizes the bandwidth of the hierarchical networks and exploits the locality properties of parallel algorithms. The simulation results show that the new protocol gives 15% to 30% performance improvement over some existing cache coherence schemes for the similar systems over a wide range of workload parameters.< >

关键词： Protocols Large-scale systems Hardware Bandwidth Multiprocessing systems Multiprocessor interconnection networks Adaptive systems Telecommunication traffic parallel algorithms Computer simulation

来源：评论

学校读者我要写书评

暂无评论

Dynamic load balancing for parallel program execution on a message-passing multicomputer

Dynamic load balancing for parallel program execution on a m...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Jian Xu Kai Hwang IBM Corporation San Jose CA USA Department of Electrical Engineering University of Southern California Los Angeles CA USA

ISBN: (纸本)0818620870

Dynamic load balancing solves the remapping problem in a multicomputer system at run time, where many processes need to be allocated evenly to multiple processor nodes. The mean is to migrate processes from busy to idle nodes in order to achieve higher resource utilization. The authors have implemented a distributed load balancer at an iPSC/2 hypercube computer system, which uses heuristic methods to balance the system load adaptively. These heuristic methods cooperate with a central supervisor at the host machine, and invoke the load balancing activities under decentralized control. Benchmark experiments have shown that the proposed dynamic load balancing methods can speed up the parallel execution of benchmark programs significantly.< >

关键词： Load management Hypercubes Runtime Resource management distributed computing Multiprocessing systems parallel processing Degradation Prototypes Broadcasting

来源：评论

学校读者我要写书评

暂无评论

parallel bin packing using first fit and k-delayed best-fit heuristics

Parallel bin packing using first fit and k-delayed best-fit ...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. Bestavros T. Cheatham D. Stefanescu Department of Computer Sciences Harvard University USA

The authors describe the development of parallel implementations for the bin packing problem. Bin packing algorithms are studied to understand various resource allocation issues and the impact of the different packing heuristics on the packing efficiency. The seemingly serial nature of the bin packing simulation has prohibited previous experimentations from going beyond sizes of several thousands bins. The authors show that by adopting fairly simple data parallel algorithms a linear speedup is possible. Sizes of up to hundreds of thousands of bins have been simulated for different parameters and heuristics. The authors focussed on the well known first-fit heuristic. They also considered another potentially superior heuristic, k-delayed best fit.< >

关键词： parallel algorithms Hardware Programming Computer science Resource management Software systems

来源：评论

学校读者我要写书评

暂无评论

Datarol: a massively parallel architecture for functional languages

Datarol: a massively parallel architecture for functional la...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M. Amamiya R. Taniguchi Department of Information Systems Kyushu University Fukuoka Japan

Proposes a parallel machine architecture which incorporates an ultra-multiprocessing facility for parallel execution of functional programs. The machine performs parallel executions along a multi-thread control flow called datarol. A datarol program, instead of using a program counter, the instructions to be executed next are explicitly specified in the preceding instructions. The explicitly specified continuation linkage enables the concurrent execution of the instructions of different function instances, as well as the parallel execution of multi-thread control flow within a function instance. Based on a continuation-based execution model, the datarol processor is designed to implement an efficient parallel execution mechanism needed for ultra-multi-processing. First, the datarol concept is discussed in comparison with a dataflow model. Next, the datarol machine architecture and datarol processor design are described. Finally, the evaluation of the datarol architecture is shown.< >

关键词： parallel architectures Computer architecture Couplings parallel machines Counting circuits Process design Writing Concurrent computing Switches Communication system control

来源：评论

学校读者我要写书评

暂无评论

Decentralized decision-making in adaptive task sharing

Decentralized decision-making in adaptive task sharing

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： H.G. Rotithor S.S. Pyo Department of Electrical Engineering Worcester Polytechnic Institute Worcester MA USA Department of Electrical Engineering University of Kentucky Lexington KY USA

Adaptive task sharing in a distributed computing system involves system state elimination and decision-making under uncertainty. The paper presents experimental results of an implementation of a novel adaptive task sharing algorithm on a distributed system consisting of VAX stations connected by a local area network. The adaptive task sharing algorithm incorporates decentralized decision-making and decentralized estimation. It introduces metrics for evaluating the quality of decision-making and the quality of system state estimation. Quantitative results on the performance of decision-making, performance of estimation, and the overall performance are presented. The results indicate that the quality of system state estimation is improved by probing more nodes. The quality of task sharing decisions, and the overall performance of the system in turn, is heavily dependent on the quality of system state estimation when the task size is not very small.< >

关键词： Decision making State estimation distributed control Load management distributed computing Resource management Control systems Uncertainty Local area networks Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

A parallel architecture for data compression

A parallel architecture for data compression

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S. Henriques N. Ranganathan Center Microelectronics Research Department of Computer Science and Engineering University of South Florida Tampa FL USA

The authors describe a parallel algorithm and architecture for implementing the LZ technique for data compression. Data compression is the reduction of redundancy in data representation in order to decrease storage and communication costs. The LZ-based compression method is a very powerful technique and gives very high compression efficiency for text as well as image data. The proposed architecture is systolic and uses the principles of pipelining and parallelism in order to obtain high speed and throughput. The order of complexity of the computations is reduced from n/sup 2/ to n. The data compression hardware can be integrated into real time systems so that data can be compressed and decompressed on-the-fly. The basic processor cell for the systolic array is currently being implemented using CMOS VLSI technology.< >

关键词： parallel architectures Data compression Image coding CMOS technology parallel algorithms Costs Computer architecture Pipeline processing parallel processing Throughput

来源：评论

学校读者我要写书评

暂无评论

parallel dynamic programming

Parallel dynamic programming

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： V. Viswanathan S.-H.S. Huang Hongfei Liu Department of Computer Sciences University of Houston Houston TX USA

Recurrence formulations for various problems such as finding an optimal order of matrix multiplication, finding an optimal binary search tree and optimal triangulation of polygons assume a similar form. A CREW PRAM algorithm has been given to solve such dynamic programming problems. The algorithm uses O(n/sup 6//log n) processors and runs in O(log/sup 2/ n)time. A modified algorithm is presented which reduces the processor requirement to O(n/sup 6//log/sup 5/n) while maintaining the same time complexity of O(log/sup 2/ n).< >

关键词： Dynamic programming Binary search trees Computer science Phase change random access memory Open systems NASA Binary trees Equations H infinity control

来源：评论

学校读者我要写书评

暂无评论

Context streams a theoretical basis for a generic form of MIMD pipelining

Context streams a theoretical basis for a generic form of MI...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： T.E.A. Lees Department of Computer Sciences University of Edinburgh Edinburgh UK

Context flow (CF) is a canonical form of MIMD pipelining in which process contexts rather than either instructions or data are manipulated. The paper presents a formal definition of context flow. It defines the state of a CF computation as the stream of contexts which pass a particular point in a context flow graph during a given period of time. It shows that for a class of context flow graphs corresponding to dynamic multifunctional pipelines, the number of contexts which may exist at any point in a graph is bounded, and independent of the computation being performed. It presents methods for determining the numerical value of the upper bound or queue length for a variety of configurations of a acyclic graph.< >

关键词： Pipeline processing Hardware parallel processing Interleaved codes Computer science Upper bound Concurrent computing Data mining Councils Control systems

来源：评论

学校读者我要写书评

暂无评论

Self scheduling and execution threads

Self scheduling and execution threads

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： R.S. Francis A.N. Pears CSIRO DIT Carlton Australia La Trobe University Australia

Two major strategies exist for the exploitation of parallel execution on shared memory multiprocessors. Multiple threads of execution can be created within a shared program context and loop iterations can be scheduled between processors. While the two techniques are well established in isolation, the design of large, general purpose multi-user multiprocessors requires a seamless blend. The authors examine a set of system structures which combine the two parallel computing models to exploit inherent program parallelism. The objective is a general purpose parallel programming environment in which programs can create as many threads as desired, which are scheduled on the share of processor resource allocated to the program. From within any of these threads, the self scheduling of iterations interacts with the thread management so that free processor resource is dynamically allocated to parallel iterations.< >

关键词： Yarn Processor scheduling parallel processing Resource management Operating systems Australia Concurrent computing Programming environments Dynamic scheduling Process control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：