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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Hybrid task scheduling: integrating static and dynamic heuristics

Hybrid task scheduling: integrating static and dynamic heuri...

引用

international symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： C. Boeres A. Lima V.E.F. Rebello Instituto de Computação Universidade Federal Fluminense Niteroi Rio de Janeiro Brazil

Researchers are constantly looking for ways to improve the execution time of parallel applications on distributed systems. Although compile-time static scheduling heuristics employ complex mechanisms, the quality of their schedules are handicapped by estimated run-time costs. On the other hand, while dynamic schedulers use actual run-time costs, they have to be of low complexity in order to reduce the scheduling overhead. We investigate the viability of integrating these two approaches into a hybrid scheduling framework. The relationship between static schedulers, dynamic heuristics and scheduling events are examined. The results show that a hybrid scheduler can indeed improve the schedules produced by good traditional static list scheduling algorithms.

关键词： Dynamic scheduling Processor scheduling Runtime Scheduling algorithm Costs distributed computing Computer architecture Computational efficiency Grid computing Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Pipelining router design improves parallel system performance

Pipelining router design improves parallel system performanc...

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： C. Carrion A. Gregorio R. Beivideo Department Informática University de Castilla-La Mancha Albacete Spain Department Electónica y Cornputadores University de Castilla-La Mancha Santander Spain

ISBN: (纸本)0769509363

Efficient communication on fetching remote data is a critical parameter in distributed shared-memory multiprocessors (DSM) in order to achieve high performance. Message passing techniques are used in many modern communication systems and routers are essential building blocks for these communication systems. Hence, in this paper emphasis is placed on the design of routers for 2-ary n-cube networks. Based on a simple deadlock free algorithm, we analyze the influence of the router structure. To be more precise, the parameters considered were the clock frequency and the number of pipeline stages of the router. The performance evaluation for DSM applications shows there are significant gains in using segmented routers designs, in our evaluations, results show an improvement of up to 12% in the execution time of some applications. This improvement occurs even though the base latency of the router has increased by 40%.

关键词： Pipeline processing System performance Algorithm design and analysis Delay Process design Clocks Frequency Logic Routing Performance gain

来源：评论

学校读者我要写书评

暂无评论

Dynamic simulator for WIP analysis in semiconductor manufacturing

Dynamic simulator for WIP analysis in semiconductor manufact...

引用

IEEE international symposium on Semiconductor Manufacturing

作者： D.W. Collins V. Lakshman L.D. Collins Arizona State University Mesa AZ USA

We present a FAB Simulator (FS) and Capacity Planner (CP) that permits the operational planner to introduce new product into an existing production mix with confidence as to the customer delivery dates and FAB Capacity This paper describes the implementation of these two dynamic tools in a semiconductor FAB in Arizona. These tools assist the operational planner with the planning of the daily production mix. This FAB produces 100's of different bipolar devices using 36 process flows. The key to success in calculating present and future production goals is real time operational level tracking. Real time tracked data includes data gathered from the Manufacturing Execution System (MES) for each product's work-in-process (WIP), process flow routing, and data gathered from the equipment utilization and emergency maintenance databases. This key information is fed through a GUI linked to the CP which in turn controls the stochastic dynamic simulation model of the FS. These links provide the operational planner with dynamic production data in real time and simulated time for decision-making. The CP and FS are running in parallel and are linked directly with the FAB's MES maintaining current production data.

关键词： Analytical models Virtual manufacturing Semiconductor device manufacture Production planning Real time systems Manufacturing processes Routing databases Graphical user interfaces Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Limits to the performance of software shared memory: a layered approach

Limits to the performance of software shared memory: a layer...

引用

IEEE symposium on High-Performance Computer Architecture

作者： A. Bilas Dongming Jiang Yuanyuan Zhou J.P. Singh Department of Electrical and Computer Engineering University of Toronto Toronto ONT Canada Department of Computer Science Princeton University Princeton NJ USA

Much research has been done in fast communication on clusters and in protocols for supporting software shared memory across them. However, the end performance of applications that were written for the more proven hardware-coherent shared memory is still not very good on these systems. Three major layers of software (and hardware) stand between the end user and parallel performance, each with its own functionality and performance characteristics. They include the communication layer, the software protocol layer that supports the programming model, and the application layer. These layers provide a useful framework to identify the key remaining limitations and bottlenecks in software shared memory systems, as well as the areas where optimization efforts might yield the greatest performance improvements. This paper performs such an integrated study, using this layered framework, for two types of software distributed shared memory systems: page-based shared virtual memory (SVM) and fine-grained software systems (FG). For the two system layers (communication and protocol), we focus on the performance costs of basic operations in the layers rather than on their functionalities. This is possible because their functionalities are now fairly mature. The less mature applications layer is treated through application restructuring. We examine the layers individually and in combination, understanding their implications for the two types of protocols and exposing the synergies among layers.

关键词： Software performance Application software Protocols Hardware Software systems parallel programming Support vector machines Cost function Software libraries Computer science

来源：评论

学校读者我要写书评

暂无评论

Simulative analysis of dynamic scheduling heuristics for reconfigurable computing of parallel applications 06

Simulative analysis of dynamic scheduling heuristics for rec...

引用

proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays

作者： Rajagopal Subramaniyan Ian Troxel Alan D. George Melissa Smith University of Florida Gainesville FL Oak Ridge National Laboratory Oak Ridge TN

ISBN: (纸本)9781595932921

The demand for processing power has been ever increasing with the growth of high-performance computing (HPC) applications and so have the constraints restricting the solutions to such requirements. High-performance distributed and parallel computing and custom-built, hardware-based computing have attempted to address this problem with some success but at a substantial cost. Recently, systems augmented with Field-Programmable Gate Arrays (FPGAs) offering a fusion of traditional parallel and distributed machines with customizable and dynamically reconfigurable hardware have emerged as a cost-effective alternative to traditional systems. However, providing a robust runtime environment for such systems to which HPC users have become accustomed has been fraught with numerous challenges. Dynamic scheduling of large-scale HPC applications in such parallel reconfigurable computing (RC) environments is one such challenge and has not been sufficiently studied to our knowledge. In this paper, we simulatively analyze the performance of several common HPC scheduling heuristics that can be used by an automated job management service to schedule application tasks on a parallel RC system. We also present a performance prediction model which the scheduling heuristics employ to schedule several common HPC applications on a collection of typical FPGA processing platforms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Discouraging free riding in a peer-to-peer CPU-sharing grid 04

Discouraging free riding in a peer-to-peer CPU-sharing grid

引用

international symposium on High Performance distributed Computing

作者： N. Andrade F. Brasileiro W. Cirne M. Mowbray Departamento de Sistemas e Computação Universidade Federal de Campina Grande Campina Grande Brazil HP Labs Bristol HP Labs Bristol UK

Grid computing has excited many with the promise of access to huge amounts of resources distributed across the globe. However, there are no largely adopted solutions for automatically assembling grids, and this limits the scale of today's grids. Some argue that this is due to the overwhelming complexity of the proposed economy-based solutions. Peer-to-peer grids Iwve emerged as a less complex alternative. We are currently deploying OurGrid, one such peer-to-peer grid. OurGrid is a CPU-sharing grid that targets bag-of-tasks applications (i.e. parallel applications whose tasks are independent). In order to ease system deployment, OurGrid is based on a very lightweight autonomous reputation scheme. Free riding is an important issue for any peer-to-peer system. The aim is to show that OurGrid's reputation system successfully discourages free riding, making it in each peer s own interest to collaborate with the peer-to-peer community. We show this in two steps. First, we analyze the conditions under which a reputation scheme can discourage free riding in a CPU-sharing grid. Second, we show that OurGrid's reputation scheme satisfies these conditions, even in the presence of malicious peers. Unlike other distributed mechanisms for discouraging free riding, OurGrid's reputation scheme achieves this without requiring a shared cryptographic infrastructure or specialized storage.

关键词： Peer to peer computing Grid computing Collaboration distributed computing Cryptography Assembly Production systems Resource management Incentive schemes

来源：评论

学校读者我要写书评

暂无评论

Correctness and performance of a multicomputer operating system

Correctness and performance of a multicomputer operating sys...

引用

international Computer Performance and Dependability symposium

作者： P. Martin R. Candlin S. Gilmore Department of Computer Science Victoria University of Wellington New Zealand Department of Computer Science University of Edinburgh UK

Our discussion assumes parallel or distributed computer systems that allow dynamic migration of processes between processors. Because the overall performance of these systems is strongly dependent on the overheads of migration, it is vital that migration be implemented as efficiently as possible. However, efficient implementations are often complex implementations and thus we have a conflict between performance and correctness. We cannot make the conflict go away, but we should be able to find ways of describing migration designs such that it is easy for system developers to make changes (for performance reasons) and see straight away what the implications for correctness are. We suggest that the formal specification language Z provides just such a way of describing migration designs. To support this suggestion we present an extended example based on the specification of a migration-proof communication protocol. This example is particularly appropriate because the possibility that a communicating process may migrate several times between communications greatly complicates the implementation. Yet we still require that communication should be efficient and correct, i.e. that messages should not be lost or duplicated. We make three contributions. First, we suggest a two-level plan for specification which separates issues of what operations do from when they do it. Second, we outline a rigorous proof style which combines formal statements of assumptions and proof steps with informal reasoning. Third, we show that we can link performance measurements with the specification but that we need to do this via finite state machines.< >

关键词： Operating systems Computer science Concurrent computing distributed computing Measurement Protocols Automata Assembly Registers System performance

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of dangling pointer error for C/C++ programs 2

Efficient detection of dangling pointer error for C/C++ prog...

引用

2nd Annual international Conference on Information System and Artificial Intelligence, ISAI 2017

作者： Zhang, Wenzhe Science and Technology on Parallel and Distributed Laboratory State Key Laboratory of High Performance Computing State Key Laboratory of High-end Server and Storage Technology College of Computer National University of Defense Technology Changsha China

Dangling pointer error is pervasive in C/C++ programs and it is very hard to detect. This paper introduces an efficient detector to detect dangling pointer error in C/C++ programs. By selectively leave some memory accesses unmonitored, our method could reduce the memory monitoring overhead and thus achieves better performance over previous methods. Experiments show that our method could achieve an average speed up of 9% over previous compiler instrumentation based method and more than 50% over previous page protection based method. © Published under licence by IOP Publishing Ltd.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

The visual query language for an object-oriented knowledge-based system

The visual query language for an object-oriented knowledge-b...

引用

international symposium on Database Applications in Non-Traditional Environments, DANTE

作者： Ming Xu Yong-Jun Wang Yi-Jie Wang Kang Zhang Yanchun Zhang National Laboratory for parallel and Distributed Processing Changsha Hunan China Department of Computing Macquarie University Sydney Australia Department of Mathematics & Computing University of Southern Queensland Toowoomba Australia

The user interface of the object-oriented knowledge-based system CAOBS/v1.2 is a visual query subsystem consisting of a flexible visual query language (VKQL), and a knowledge base browser/editor. With the visual language, the user can express query requirements by constructing query graphs. VKQL absorbs the key features of some existing visual query languages, and adds more advanced functions. The paper presents the design and implementation of VKQL and compares VKQL with other similar query languages.

关键词： Database languages Knowledge based systems Computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

Executing multidatabase transactions

Executing multidatabase transactions

引用

Annual Hawaii international Conference on System Sciences (HICSS)

作者： M. Ansari M. Rusinkiewicz L. Ness A. Sheth Department of Computer Science University of Houston Houston TX USA MRE-2L359 Bellcore Morristown NJ USA

In a multidatabase environment, the traditional transaction model has been found to be too restrictive. Therefore, several extended transaction models have been proposed in which some of the requirements of transaction, such as isolation or atomicity, are optional. The authors describe one of such extensions, the flexible transaction model and discuss the scheduling of transactions involving multiple autonomous database systems managed by heterogeneous DBMS. The scheduling algorithm for flexible transactions is implemented using L.0, a logically parallel language which provides a framework for concisely specifying the multidatabase transactions and for scheduling them. The key aspects of a flexible transaction specification, such as subtransaction execution dependencies and transaction success criteria, can be naturally represented in L.0. Furthermore, scheduling in L.0 achieves maximal parallelism allowed by the specifications of transactions, which results in the improvement of their response times. To provide access to multiple heterogeneous hardware and software systems, they use the distributed Operation Language (DOL). DOL approach is based on providing a common communication and data exchange protocol and uses local access managers to protect the autonomy of member software systems. When L.0 determines that a subtransaction is ready to execute, it hands it through an interface to the DOL system for execution. The interface between L.0 and DOL provides the former with the execution status of subtransactions.< >

关键词： Software systems Logic Computer science Database systems Scheduling algorithm parallel processing Delay Access protocols Protection Transaction databases

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 475 476 477 478 479 480 481 482 483 484 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：