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

Acceleration of relational database operations on vector processors

Systems and computers in Japan 2000年第8期31卷 79-88页

作者： Meki, Shintaro Kambayashi, Yahiko Fac. of Comp. Sci. and Syst. Eng. Okayama Prefectural University Soja 719-1197 Japan Graduate Faculty of Engineering Kyoto University Kyoto 606-8501 Japan Kyoto University Fac. of Comp. Sci. and Syst. Eng. Okayama Prefectural University Computer Science Society Faculty of Engineering Kyushu University Faculty of Engineering Kyoto University Computer Science Society VLDB Endowment Committee ACM SIGMOD Advisory Committee Computer Science Society Japanese Soc. for Software Science ACM IEEE

With the expansion of the areas of database applications, the amount of data processed has become gigantic, and the demand for faster database systems has increasingly intensified. Thus, many efforts have been expended to execute database operations more efficiently using special hardware. However, for the cases in which mass-produced LSI cannot be used, cost has become excessive, and replacement methods have been sought. Vector processors have powerful pipeline operators and large-capacity main memories and have rapidly spread in recent years. In this paper, algorithms for relational database operations suitable for vector processors showing the characteristics of vector processors sufficiently are presented. This algorithm is based on the hash method, which is highly efficient when the capacity of the main memory is large, and it is shown that a rate of acceleration more than 10 times the average is obtained for representative relational database operations when this algorithm is executed on a vector processor.

关键词： Relational database systems

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of the Lavender micro kernel

引用

Systems and computers in Japan 2000年第7期31卷 47-55页

作者： Mouri, Koichi Okubo, Eiji Grad. Sch. of Sci. and Engineering Ritsumeikan University Shiga 525-8577 Japan Department of Computer Science Faculty of Science and Engineering Ritsumeikan University Shiga 525-8577 Japan Ritsumeikan University Info. Processing Society of Japan Japan Soc. Software Sci. Technol. Hokkaido University Kyoto University Hitachi Limited Department of Computer Science Kyoto University Department of Computer Science Ritsumeikan University ACM IEEE Computer Society

Micro kernel architecture is widely used in the design of operating systems. However, traditional micro kernels are not easily extensible and so are not very flexible. For example, the granularity of kernel functions does not accord with the users' needs. Moreover, users cannot customize kernel functions easily. Another problem of micro kernels is that system performance is poor due to the overhead of switching address spaces and due to the increased interprocess communication in micro kernels. To address these problems, we have designed and implemented the Lavender micro kernel. Lavender is a micro kernel which can be customized according to application-specific requirements. In order to reduce kernel overhead due to switching address spaces and interprocess communication, Lavender provides users with functionality for process groups and for resident address space. By means of this functionality, the overhead of interprocess procedure calls is reduced to about one-fifth that of other micro kernels. In this paper, the structure and features of Lavender are described. Furthermore, a performance evaluation of process groups and resident address space is presented and the effectiveness of Lavender is discussed.

关键词： computer operating systems

来源：评论

学校读者我要写书评

暂无评论

Test generation for acyclic sequential circuits with hold registers

Test generation for acyclic sequential circuits with hold re...

引用

IEEE International Conference on computer-Aided Design

作者： T. Inoue D. Kumar Das C. Sano T. Mihara H. Fujiwara Faculty of Information Sciences Hiroshima City University Hiroshima Japan Computer Science and Engineering Department Jadavpur University Calcutta India Nara Institute of Science and Technology Graduate School of Information Science Nara Japan Mitsubishi Electronic Control Software Corporation Kobe Japan

We present a method of test generation for acyclic sequential circuits with hold registers. A complete (100% fault efficiency) test sequence for an acyclic sequential circuit can be obtained by applying a combinational test generator to all the maximal time-expansion models (TEMs) of the circuit. We propose a class of acyclic sequential circuits for which the number of maximal TEMs is one, i.e., the maximum TEM exists. For a circuit in the class, test generation can be performed by using only the maximum TEM. The proposed class of sequential circuits with the maximum TEM properly includes several known classes of acyclic sequential circuits such as balanced structures and acyclic sequential circuits without hold registers for which test generation can also be performed by using a combinational test generator. Therefore, in general, the hardware overhead for partial scan based on the proposed structure is smaller than that based on balanced or acyclic sequential structure without hold registers.

关键词： Circuit testing Sequential analysis Sequential circuits Registers Performance evaluation Circuit faults Hardware Design for testability Kernel computer science

来源：评论

学校读者我要写书评

暂无评论

Measure-driven

引用

Journal of software Maintenance and Evolution 2000年第1期12卷 47-78页

作者： Cantone, Giovanni Dept. Info. Syst. Prod. Mgmt. Eng. University of Rome at Tor Vergata Roma Italy Dept. Info. Syst. Prod. Mgmt. Eng. University of Rome at Tor Vergata S.N.C. Roma Italy Department of Computer Science Dept. Info. Syst. and Prod. Mgmt. Faculty of Engineering Italy Scientific-Technical Committee Admin. and Docum. Computing Center University of Rome at Tor Vergata Roma Italy University of Naples University of Maryland Italy Intl. Software Eng. Research Network Italy UMD Exp. Software Engineering Group Italy Ital. Assoc. Info. Automat. Comp. Italy Faculty of Engineering University of Naples Italy

This paper reports on an on-going project undertaken within the University of Rome at Tor Vergata to automate the business processes of a class of administrative organizations. The experience gained and the lessons learned, while performing in the role of Innovation-driver, are abstracted and presented. In the context of this experience with process re-engineering, the paper compares the utility of empirically investigating software technology transfer with the reuse of technology measurement models possibly available. The paper also discusses the roles played by various environmental factors - technology, experimentation and measurements, an organization's business objectives, and other organizational issues, including the expected benefits and costs - in the empirical investigation of software technology transfer. The paper concludes by presenting a short case study and three lessons learned. Copyright © 2000 John Wiley and Sons, Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient method for in memory construction of suffix arrays

An efficient method for in memory construction of suffix arr...

引用

1999 String Processing and Information Retrieval Symposium and International Workshop on Groupware, SPIRE 1999 and CRIWG 1999

作者： Itoh, Hideo Tanaka, Hozumi Software Res. Center Ricoh Co. Ltd Japan Tokyo Institute of Technology Computer Science Faculty of Engineering Japan

ISBN: (纸本)0769502687

The suffix array is a string-indexing structure and a memory efficient alternative to the suffix tree. It has many advantages for text processing. We propose an efficient algorithm for sorting suffixes. We call this algorithm the two-stage suffix sort. One of our ideas is to exploit the specific relationships between adjacent suffixes. Our algorithm makes it possible to use the suffix array for much larger texts and suggests new areas of application. Our experiments on several text data sets (including 514-MB Japanese newspapers) demonstrate that our algorithm is 4.5 to 6.9 times faster than Quicksort, and 2.5 to 3.6 times faster than K. Sadakane's (1998) algorithm, which is considered to be the fastest algorithm in previous work. © 1999 IEEE.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Tools and techniques for teaching objects first in a Java course 99

Tools and techniques for teaching objects first in a Java co...

引用

The proceedings of the thirtieth SIGCSE technical symposium on computer science education

作者： Michael Kölling John Rosenberg School of Computer Science and Software Engineering Monash University Australia Faculty of Information Technology Monash University Australia

No abstract available.

ISBN: (纸本)9781581130850

No abstract available.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient method for in memory construction of suffix arrays

An efficient method for in memory construction of suffix arr...

引用

String Processing and Information Retrieval Symposium (SPIRE)

作者： H. Itoh H. Tanaka Software Research Center Ricoh Company Limited USA Faculty of Engineering Computer Science Tokyo Institute of Technology Japan

关键词： Sorting Automata Natural languages Costs Indexing Data structures Dictionaries Natural language processing Tail Personal communication networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive real-time control of a Christmas tree using a novel signal processing approach

Adaptive real-time control of a Christmas tree using a novel...

引用

American Control Conference (ACC)

作者： J. Hu H.R. Wu C.T. Chou M. Verhaegen D. Westwick G. Nijsse School of Computer Science and Software Engineering Clayton Australia Control Laboratory Faculty of Information Technology and Systems Delft University of Technnology Delft Netherlands

The LMS algorithm forms the core of a number of adaptive control schemes. It has on one hand provided certain degree of robustness to these algorithms but on the other hand its convergence rate is notoriously slow. We propose a method to initialize the LMS algorithm which dramatically shortens its adaptation period. We also prove that under certain condition this initialization can be computed without explicit knowledge of either the reference or noise spectrum. Although the work is illustrated using the filtered-X scheme, this idea can also be applied to other similar schemes. Two successful experiments starting from black-box identification to real-time control have verified the effectiveness of this idea.

关键词： Programmable control Adaptive control Adaptive signal processing Least squares approximation Signal processing algorithms Control systems Testing Active noise reduction Noise cancellation Optimal control

来源：评论

学校读者我要写书评

暂无评论

Putting the practice into software engineering education

Putting the practice into software engineering education

引用

International Conference on software engineering: Education and Practice

作者： J. Miller C. Mingins Faculty of Information Technology School of Computer Science and Software Engineering VIC Australia

The paper describes a subject called software engineering Practise, which introduces software engineering concepts to students in a generalist computing degree. The course has three aims: to establish a foundation of good practice which will form the basis for a personal software improvement process in subsequent studies and in professional life; to introduce object oriented design in a context firmly embedded in software engineering; and to give students a taste of working in groups on a reasonably large project. The success of this course is due to the way in which the object oriented design, the software engineering process aspects and the project work so well together to bring the concepts associated with each part of the course to life and to reinforce each other in a relatively realistic context. Other aspects, which contribute to the success of the course, such as the team approach to course management, individual student assessment, and choice of development environment, are also highlighted.

关键词： software engineering Electrical capacitance tomography Programming Environmental management computer science education computer science Information technology software design Reflection

来源：评论

学校读者我要写书评

暂无评论

Testing concurrency and communication in distributed objects

Testing concurrency and communication in distributed objects

引用

International Conference on High Performance Computing

作者： A. Bader A.S.M. Sajeev S. Ramakrishnan School of Computer Science & Software Engineering Faculty of Information Technology Monash University VIC Australia

Concurrency and communication are two of the key features of distributed systems. These features can make systematic testing of distributed systems a complex task. A major problem is the explosion of the test space because of the potential for arbitrary interference of concurrent threads. This paper describes an approach for systematic testing of such systems in an object-oriented context. We use statecharts for system specification, and model the system behaviour as event-sequences. A test case, therefore, is primarily an event-sequence with concurrent threads represented as interleaving events. Communication-states with associated events represent communication between objects. The test-space explosion is controlled by an extension to Chow's (1978) algorithm for generating test sequences for finite state machines. The number of test sequences we require is O(n/sup 2/), where n is the sum of all events in all concurrent statecharts.

关键词： Concurrent computing System testing Explosions Yarn Interference Context Object oriented modeling Interleaved codes Communication system control Automata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：