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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 软件工程
- 59 篇 信息与通信工程
- 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

语言

788 篇 英文
8 篇 其他

检索条件"任意字段=Proceedings of the first international symposium on Databases in parallel and distributed systems"

共 796 条记录，以下是541-550 订阅

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

详细简洁

排序：

Coordination structure and system restrictiveness in distributed group support systems: an experiment on coordination mode and leadership

Coordination structure and system restrictiveness in distrib...

引用

Annual Hawaii international Conference on System Sciences (HICSS)

作者： Youngjin Kim S.R. Hiltz M. Turoff Long Island University Brookville NY USA New Jersey Institute of Technology Newark NJ USA

This study examines coordination processes in distributed Group Support systems. A 2/spl times/2 factorial design was used to investigate coordination mode and group leadership in an asynchronous environment, as a means of exploring the impact of restrictiveness of coordination structures on group performance. Objective decision quality was equal for both parallel and sequential coordination groups, but was significantly better in groups with a leader. Perceived decision quality was better in parallel coordination groups than sequential groups. Satisfaction with a decision process was higher in parallel coordination groups and groups with a leader. The study concludes that less restrictive coordination structures are more appropriate to support asynchronously interacting distributed groups.

关键词： Collaborative software Decision making Problem-solving Output feedback Resource management Uncertainty Silver Decision support systems databases Communication channels

来源：评论

学校读者我要写书评

暂无评论

Dynamic parallel query processing for distributed objects

Dynamic parallel query processing for distributed objects

引用

international Workshop on Database and Expert systems Applications

作者： Y. Jiang G. Wang A. Makinou Department of Computer Science & Math Kurashiki University of Science and the Arts Okayama Japan Department of Computer Science &Tech Northeastern University Shenyang China

An effective exploitation of distributed computing environments to improve the performance of large advanced database applications requires parallel query processing techniques. This is because parallel query execution can be achieved by operations of pipelining and data partitioning, as well as independent subqueries. In order to develop efficient parallel query services in distributed environments, we present a query optimization, a dynamic parallel query scheduling algorithm, and an implementation mechanism for querying distributed objects. Our proposal has four important features. first, the query schedule dynamically schedules independent subqueries in parallel. Second, distributed processors are allowed to execute independent subqueries in random. Third, it doesn't limit the number of processors to deal with parallel query processing in a network based computing environment. Fourth, it provides simple operations to synchronize parallel query programs. We give the query optimization for parallel processing, show an algorithm of dynamic parallel query scheduling, describe an implementation method for the parallel query processing in a network-based distributed computing environment, and present the design of communication and synchronization for the parallel query processing.

关键词： Query processing Processor scheduling Dynamic scheduling distributed computing Scheduling algorithm distributed databases Pipeline processing Proposals Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Prioritized token-based mutual exclusion for distributed systems

Prioritized token-based mutual exclusion for distributed sys...

引用

international symposium on parallel Processing

作者： F. Mueller Institut für Informatik Humboldt-Universität zu Berlin Berlin Germany

A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment suitable for real-time applications but impose a higher message passing overhead than our approach. We present a new protocol for prioritized mutual exclusion in a distributed environment. Our approach uses a token-based model working on a logical tree structure, which is dynamically modified. In addition, we utilize a set of local queues whose union would resemble a single global queue. Furthermore, our algorithm is designed for out-of-order message delivery, handles messages asynchronously and supports multiple requests from one node for multi-threaded nodes. The prioritized algorithm has an average overhead of O(log(n)) messages per request for mutual exclusion with a worst-case overhead of O(n), where n represents the number of nodes in the system. Thus, our prioritized algorithm matches the message complexity of the best non-prioritized algorithms while previous prioritized algorithms have a higher message complexity, to our knowledge. Our concept of local queues can be incorporated into arbitrary token-based protocols with or without priority support to reduce the amount of messages. Performance results indicate that the additional functionality of our algorithm comes at the cost of 30% longer response times within our test environment for distributed execution when compared with an unprioritized algorithm. This result suggests that the algorithm should be used when strict priority ordering is required.

关键词： Protocols Delay Testing Message passing Tree data structures Algorithm design and analysis Cost function Memory architecture Hardware Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Update protocols and iterative scientific applications

Update protocols and iterative scientific applications

引用

international symposium on parallel Processing

作者： P. Keleher University of Maryland USA

Software DSMs have been a research topic for over a decade. While good performance has been achieved in some cases, consistent performance has continued to elude researchers. This paper investigates the performance of DSM protocols running highly regular scientific applications. Such applications should be ideal targets for DSM research because past behavior gives complete, or nearly, complete, information about future behavior. We show that a modified home-based protocol can significantly outperform more general protocols in this application domain because of reduced protocol complexity. None the less, such protocols still do not perform as well as expected. We show that the one of the major factors limiting performance is interaction with the operating system on page faults and page protection changes. We further optimize our protocol by completely eliminating such memory manipulation calls from the steady-state execution. Our resulting protocol improves average application performance by a further 34%, on top of the 19% improvement gained by our initial modification of the home-based protocol.

关键词： Application software Access protocols parallel machines Workstations Operating systems Protection Steady-state Yarn Delay parallel programming

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a parallel I/O runtime system for irregular applications

Design and implementation of a parallel I/O runtime system f...

引用

international symposium on parallel Processing

作者： J. No S.-S. Park J. Carretero A. Choudhary P. Chen Dept of Electrical Engineenng and Computer Systems Syracuse University USA Dept of Computer Science and Engineenng Anyang University South Korea Arquitectura y Tecnologia de Sistemas Informiticos Universidad Politecnica de Madrid Spain Dept of Electncal and Computer Engineenng Northwestern University USA Sandia National Laboratories Albuquerque NM USA

In this paper we present the design, implementation and evaluation of a runtime system based on collective I/O techniques for irregular applications. We present two models, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O simultaneously making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined to reduce I/O node contention dynamically. Both models have been optimized by using software caching, chunking and on-line compression mechanisms. We demonstrate that we can obtain significantly high-performance for I/O above what has been possible so far. The performance results are presented on an Intel Paragon and on the ASCI/Red teraflops machine at Sandia National Labs.

关键词： Libraries Processor scheduling Large-scale systems Concurrent computing Application software Data visualization Memory Programming profession Computer science Sorting

来源：评论

学校读者我要写书评

暂无评论

Adaptive quality equalizing: high-performance load balancing for parallel branch-and bound across applications and computing systems

Adaptive quality equalizing: high-performance load balancing...

引用

international symposium on parallel Processing

作者： N.R. Mahapatra S. Dutt Department of Electrical & Computer Engineering State University of New York University at Buffalo Buffalo NY USA Department of Electrical Engineering & Computer Science University of Illinois Chicago Chicago IL USA

In this paper we present an adaptive version of our previously proposed quality equalizing (QE) load balancing strategy that attempts to maximize the performance of parallel branch-and-bound (B&B) by adapting to application and target computing system characteristics. Adaptive QE (AQE) incorporates the following salient adaptive features: (1) Anticipatory quantitative and qualitative load balancing mechanisms. (2) Regulation of load information exchange overhead. (3) Deterministic load balancing in extended neighborhoods instead of just immediate neighborhoods as in non-adaptive QE. (4) Randomized global load balancing to fetch work from outside the extended neighborhood. AQE fields speedup improvements of up to 80%, and 15% on the average, compared to that provided by QE for several real-world mixed-integer programming (MIP) problems, and near-ideal speedups for two of the largest problems in the MIPLIB benchmark suite on an IBM SP2 system.

关键词： Adaptive equalizers Load management Concurrent computing Application software Computer applications Optimization methods Cost function Space exploration Search problems parallel processing

来源：评论

学校读者我要写书评

暂无评论

The VEGA moderately parallel MIMD, moderately parallel SIMD, architecture for high performance array signal processing

The VEGA moderately parallel MIMD, moderately parallel SIMD,...

引用

international symposium on parallel Processing

作者： M. Taveniku A. Ahlander M. Jonsson B. Svensson Ericsson Microwave Systems AB Molndal Sweden Department of Computer Engineering Chalmers University of Technology Gothenburg Sweden Centre for Computer Systems Architecture Halmstad University Halmstad Sweden

In array radar signal processing applications, the processing demands range from tens of GFLOPS to several TFLOPS. To address this, as well as the, size and power dissipation issues, a special purpose "array signal processing" architecture is proposed. We argue that a combined MIMD-SIMD system can give flexibility, scalability, and programmability as well as high computing density. The MIMD system level, where SIMD modules are interconnected by a fiber-optic real-time network, provides the high level flexibility while the SIMD module level provides the compute density. In this paper we evaluate different design alternatives and show how the VEGA architecture was derived. By examining the applications and the algorithms used, the SIMD mesh processor is found be sufficient. However, the smaller the meshes are the better is the flexibility and efficiency. Then, based on prototype VLSI implementations and on instruction statistics, we find that a relatively large pipelined processing element maximises the performance per area. It is thereby concluded that the small SIMD mesh processor array with powerful processing elements is the best choice. These observations are further exploited in the design of the single-chip SIMD processor array to be included in the MIMD-style overall system. The system scales from 6.4 GFLOPS to several TFLOPS peak performance.

关键词： Computer architecture Radar signal processing Power dissipation Signal processing Scalability Power system interconnection Real time systems Computer networks Signal processing algorithms Prototypes

来源：评论

学校读者我要写书评

暂无评论

Performance and experience with LAPI-a new high-performance communication library for the IBM RS/6000 SP

Performance and experience with LAPI-a new high-performance ...

引用

international symposium on parallel Processing

作者： G. Shah J. Nieplocha J. Mirza C. Kim R. Harrison R.K. Govindaraju K. Gildea P. DiNicola C. Bender IBM Power Parallel Systems Poughkeepsie NY USA Pacific Northwest National Laboratory Richland WA USA

LAPI is a low-level, high-performance communication interface available on the IBM RS/6000 SP system. It provides an active-message-like interface along with remote memory copy and synchronization functionality. It is designed primarily for use by experienced programmers in developing parallel subsystems, libraries and tools, but we also expect power programmers to use it in end-user applications. IBM developed LAPI as a part of a project with Pacific Northwest National Laboratory (PNNL) to optimize the performance of the Global Arrays (GA) toolkit and its applications on the IBM RS/6000 SP. We provide an overview of LAPI characteristics and discuss its differences from other models such as MPI-2. We present some base performance parameters of LAPI including latency and bandwidth and compare it with performance of the MPI/MPL. The Global Arrays library from PNNL was ported to LAPI to exploit the performance benefits of this new interface. Experience using LAPI to implement GA and the performance of the resulting library are presented.

关键词： Libraries Switches Communication switching Programming profession Software standards Software performance Protocols Art Random access memory Strontium

来源：评论

学校读者我要写书评

暂无评论

Objects collection management in multidimensional DBMS data model

Objects collection management in multidimensional DBMS data ...

引用

international symposium on Object-Oriented Real-Time distributed Computing

作者： T.-M. Lim S.-P. Lee Department Of Computer Science and Information Technology University Of Malaya Malaysia

A multidimensional DBMS (MDBMS) data model is a nested relational DBMS (RDBMS) that has been made available since 1970. A multidimensional DBMS data model could model real world problems more naturally, such as one to many parent to children table relationship, variable length record and length field and a rich set of data management functionality. The paper considers collection object type design in a multidimensional DBMS data model. It presents database terms used between a relational DBMS, a multidimensional DBMS and an object oriented DBMS. The benefits, management and optimisation of the multidimensional DBMS are presented. The paper also presents discussions on class management, inheritance mapping, object management and implementation of object collection. It suggests improvements to the object collection implementation and continues work on distributed object management utilising a multidimensional DBMS.

关键词： Multidimensional systems Data models databases Computer science Information technology Nuclear magnetic resonance Algorithms Hair Artificial intelligence Displays

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

international symposium on parallel Processing

作者： V. Auletta S.K. Das A. De Vivo M.C. Pinotti V. Scarano Dipartimento di Informatica ed Applicazioni R.M. Capocelli Universiti di Salerno Baronissi Salerno Italy Department of Computer Sciences University of North Texas Denton TX USA Consiglio Nazionale delle Ricerche IEI Pisa Italy

The authors 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 are referred to as elementary templates. They 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. They also propose another mapping algorithm for a composite template, say /spl Vscr/ (as versatile), such that its size is not fixed and an instance of /spl Vscr/ is composed of any combination of c instances of elementary templates. The number of conflicts for accessing an S-node instance of template /spl Vscr/ is O(S//spl radic/M log M+c) and the memory load is 1+o(1) where load is defined as the ratio between the maximum and minimum number of data items mapped onto each memory module.

关键词： Vegetation mapping Data structures Costs Concurrent computing Read-write memory Multiprocessor interconnection networks Network topology Information retrieval Gold

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共80页 << < 51 52 53 54 55 56 57 58 59 60 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：