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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

An algorithm for geometric load balancing with two constraints

An algorithm for geometric load balancing with two constrain...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Kim, Jiyoun Papaefthymiou, Marios Tayyab, Athar Adv. Comp. Architecture Laboratory EECS Department University of Michigan Ann Arbor MI 48109 IBM Microelectronics Austin TX 78758

ISBN: (纸本)0769521320

This paper describes an algorithm for partitioning 2-weighted geometric graphs, so that each of the two weights is evenly distributed among all partitions and cutsize is minimal. This algorithm is applicable to load balancing problems in parallel computing, including scientific computation or circuit optimization, in which computational load depends on multiple factors, and geometric proximity needs to be preserved. We first show that for two continuous weight distributions, there always exists an L-shape separator that divides the two weights exactly. Based on this fact, we then give a practical and efficient heuristic for 2p-way partitioning. Our heuristic relies on recursive bipartitioning and runs in O(nlgn + m2p) time, where n is the number of vertices and m is the number of rows in the graph. In experiments with geometric graphs obtained from placed benchmark VLSI circuits, our heuristic generates balanced partitions with imbalance no greater than 2%, very short runtimes, and good cutsizes. For example, given a geometric graph with n > 100,000, our heuristic computes a 32-way partitioning with 0.46% maximum imbalance within 0.5 second.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

On the comparison of CPLEX-computed job schedules with the self-tuning dynP job scheduler

On the comparison of CPLEX-computed job schedules with the s...

引用

proceedings - 18th international parallel and distributed Processing symposium, IPDPS 2004 (Abstracts and CD-ROM)

作者： Grothklags, Sven Streit, Achim Fac. Comp. Sci. Elec. Eng./Math. Institute of Computer Science Paderborn University Germany Paderborn Ctr. for Parallel Comp. Paderborn University Germany

ISBN: (纸本)0769521320

In this paper we present a comparison of CPLEX-computed job schedules with the self-tuning dynP scheduler. This scheduler switches the active scheduling policy dynamically during run time, in order to reject changing characteristics of waiting jobs. Each time the self-tuning dynP scheduler checks for a new policy a quasi off-line scheduling is done as the-number of jobs are Lxed. Two questions arise from this fact: what is the optimal schedule in each self-tuning step? and what is the performance difference between the optimal schedule and the best schedule generated with one of the scheduling policies? For that we modelled the scheduling problem as an integer problem, which is then solved with the well-known CPLEX library. Due to the size of the problem, we apply time-scaling, i. e. the schedule is computed on a larger than one second precise scale. We use the CTC job trace as input for a discrete event simulation and evaluate the performance difference between the CPLEX-computed schedules and the schedules generated by the self-tuning dynP scheduler. The results show, that the performance of the self-tuning dynP scheduler is close to solutions computed by CPLEX. However, the self-tuning dynP scheduler needs much less time for generating the schedules than CPLEX.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

Fast and flexible persistence: the magic potion for fault-tolerance, scalability and performance in online data stores

Fast and flexible persistence: the magic potion for fault-to...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： P. Mehra S. Fineberg Hewlett Packard Company USA

Summary form only given. We examine the architecture of computer systems designed to update, integrate and serve enterprise information. Our analysis of their scale, performance, availability and data integrity draws attention to the so-called 'storage gap'. We propose 'persistent memory' as the technology to bridge that gap. Its impact is demonstrated using practical business information processing scenarios. We conclude with a discussion of our prototype, the results achieved, and the challenges that lie ahead.

关键词： Fault tolerance Application software Web server Fault tolerant systems Computer architecture Availability Bridges Network servers Transaction databases Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Dynamic adjustment of execution order in real-time databases

Dynamic adjustment of execution order in real-time databases

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Yongyan Wang Qiang Wang Hongan Wang Guozhong Dai Intelligence Engineering Laboratory Institute of Software Chinese Academy and Sciences Beijing China

ISBN: (纸本)0769521320

Summary form only given. 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 nonblocking 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. 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.

关键词： Concurrency control Protocols Database systems Real time systems Optimization methods Algorithm design and analysis Timing System recovery Delay Transaction databases

来源：评论

学校读者我要写书评

暂无评论

An extended relational algebra for fuzzy multidatabases

An extended relational algebra for fuzzy multidatabases

引用

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

作者： A.K. Sharma A. Goswami D.K. Gupta Department of Mathematics Indian Institute of Technology Kharagpur India

Recent trends in the database paradigm are to incorporate fuzzy sets to tackle imprecise and ambiguous information of real world problems. In this paper, using the concepts of fuzzy sets and possibility theory, a FTS relational model is developed to extend the TS-relational model by Ee Peng Lilm et al. (1999). The extended model integrates local fuzzy databases by merging the respective export fuzzy databases to generate a set of FTS relations of fuzzy multidatabase. A set of algebraic operations is defined to manipulate the FTS relations and their correctness is established. A set of algebraic rules is also presented to optimize FTS algebraic expressions.

关键词： Algebra Relational databases Fuzzy sets Mathematics Database systems Testing Possibility theory Merging distributed databases parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Massively parallel data mining using reconfigurable hardware: approximate string matching

Massively parallel data mining using reconfigurable hardware...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Q. Zhang R.D. Chamberlain R.S. Indeck B.M. West J. White Center for Security Technologies Washington University in St. Louis

Summary form only given. Data mining is an application that is commonly executed on massively parallel systems, often using clusters with hundreds of processors. With a disk-based data store, however, the data must first be delivered to the processors before effective mining can take place. Here, we describe the prototype of an experimental system that moves processing closer to where the data resides, on the disk, and exploits massive parallelism via reconfigurable hardware to perform the computation. The performance of the prototype is also reported.

关键词： Data mining Hardware Prototypes Spatial databases Field programmable gate arrays parallel processing Switches Clustering algorithms Computer architecture Data security

来源：评论

学校读者我要写书评

暂无评论

Processor-embedded distributed MEMS-based storage systems for high-performance I/O

Processor-embedded distributed MEMS-based storage systems fo...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S.C. Chiu Wei-keng Liao A.N. Choudhary Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

Summary form only given. Built upon new data organization and access characteristics, MEMS-based storage devices have come under consideration as an alternative to disks for large data-intensive applications. While not already in commercial production, MEMS-based storage devices have outperformed disks in device-level simulations. Processor-embedded distributed disks improved performance of workloads by offloading application-level processing to the storage. To exploit the potential benefits offered by these emerging storage technologies and offloading models, we propose a processor-embedded distributed MEMS-based storage architecture, and evaluate the proposed architecture with representative database and data mining workloads. Our results show that MEMS-based storage improved the overall performance of these workloads over disk-based systems, and transformed the characteristics of several workloads, impacting the design points for future storage architectures.

关键词： Power system interconnection Power system reliability Delay Application software Production Microelectromechanical devices databases Data mining Bandwidth parallel processing

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the MRNet distributed tool infrastructure: lessons learned

Benchmarking the MRNet distributed tool infrastructure: less...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： P.C. Roth D.C. Arnold B.P. Miller Computer Sciences Department University of Wisconsin Madison WI USA

Summary form only given. MRNet is an infrastructure that provides scalable multicast and data aggregation functionality for distributed tools. While evaluating MRNet's performance and scalability, we learned several important lessons about benchmarking large-scale, distributed tools and middleware. First, automation is essential for a successful benchmarking effort, and should be leveraged whenever possible during the benchmarking process. second, micro-benchmarking is invaluable not only for establishing the performance of low-level functionality, but also for design verification and debugging. Third, resource management systems need substantial improvements in their support for running tools and applications together. Finally, the most demanding experiments should be attempted early and often during a benchmarking effort to increase the chances of detecting problems with the tool and experimental methodology.

关键词： Scalability Debugging Large-scale systems Automation Resource management distributed computing Benchmark testing Control systems Middleware Costs

来源：评论

学校读者我要写书评

暂无评论

Capabilities-based query planning in mediator systems

Capabilities-based query planning in mediator systems

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Jiuyang Tang Weiming Zhang Junfeng Song Weidong Xiao Department of Management Science and Engineering National University of Defense Technology Changsha Hunan China

ISBN: (纸本)0769521320

Summary form only given. This article addresses the impact of capability description on query planning in heterogeneous data integration system. Query planning covers the selection of data sources related to the query and the determination of subgoals' execution orders. In the context of capability description, we propose a framework for data sources description towards generating good feasible query plans. Our approach uses information such as the semantic correspondences between local schemas and mediated schemas and the query capability descriptions to investigate factors that provide a good foundation for query planning. Finally, the proposed approach is compared with the other capability description approaches described in the literature. The obtained results demonstrate that our approach will allow data sources to advertise their capabilities in a flexible way and help to efficiently query planning.

关键词： Technology management Engineering management Data engineering Technology planning Web sites databases Mediation Data warehouses Process planning distributed processing

来源：评论

学校读者我要写书评

暂无评论

Utilization of a local grid of Mac OS X-based computers using Xgrid 04

Utilization of a local grid of Mac OS X-based computers usin...

引用

international symposium on High Performance distributed Computing

作者： D. Kramer M. Maclnnis Apple Computer Inc. Cupertino CA USA Apple Comput. Inc. Cupertino CA USA

Xgrid Technical Preview 2 is a distributed computing software technology from Apple Computer, Inc. Xgrid leverages the UNIX-based capabilities of Mac OS X to enable the rapid aggregation of Macintosh systems into a simple yet powerful computational grid which can run a wide range of standard and custom solutions with minimal code changes. To demonstrate the technology, the software is run on a networked rack of Xserve G5 servers and a PowerBook G4 laptop. The demonstration shows how Xgrid is utilized to distribute long-running batch and parallel jobs to a local grid of Mac OS X-based computers.

关键词： Operating systems Grid computing distributed computing Application software databases Concurrent computing Protocols Genetics Code standards Robustness

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：