Optimal task allocation in hypercube multiprocessor ensembles

Criteria are established to determine the optimal policy for allocating a set of uniform tasks onto a multiprocessor hypercube ensemble. It is shown that the optimal policy depends on the ratio of computation to intertask communication required by the distributed program, and that based on this ratio, tasks should be placed either all on one processor or uniformly distributed over the largest possible hypercube.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

Assessing the relative priority of projects

Where there are a large number of projects competing for a limited pool of resources, projects have to be assigned priorities to determine which should proceed and which should be curtailed. The traditional economic procedures for assessing the relative priority of projects are reviewed, and alternative methods of ranking projects are suggested, with particular emphasis on methods that are inexpensive and easy to use.     

利用计算机进行油气资源评价和勘探决策

本文着重介绍了构成《现代勘探决策理论系统》的5个主要计算机模块,即:生油岩热演化处理、求任意曲边形面积、数学模拟预测资源量、勘探经济评价分析及决策、辅助处理等模块。该系统曾在塔里木盆地和准噶尔盆地的油气资源评价和勘探决策中发挥了作用,受到了专家和用户的好评。     

Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions

We present algorithms, methods, and software for a Grid resource manager, that performs resource brokering and job scheduling in production Grids. This decentralized broker selects computational resources based on actual job requirements, job characteristics, and information provided by the resources, with the aim to minimize the total time to delivery for the individual application. The total time to delivery includes the time for program execution, batch queue waiting, and transfer of executable and input/output data to and from the resource. The main features of the resource broker include two alternative approaches to advance reservations, resource selection algorithms based on computer benchmark results and network performance predictions, and a basic adaptation facility. The broker is implemented as a built-in component of a job submission client for the NorduGrid/ARC middleware.     

政务信息资源中心框架设计及关键技术研究

目前国内有关政务信息资源共享的研究及应用还停留在网络互联互通、信息资源整合、点对点数据交换阶段,并没有达到"协同工作"的要求.鉴于此,提出了政务信息资源中心的概念,实现政务信息资源的统一获取、统一管理、规则化和规模化服务.结合工作实践,对其组成、总体框架、技术架构进行了设计,并就实现时需要解决的关键技术进行了研究.     

Abstract Models of Storage

This note is a historical survey of Christopher Strachey's influence on the development of semantic models of assignment and storage management in procedural languages.     

水资源系统实时调度

对水资源系统实时调度的历史和发展进行了简要介绍，并对其结构模型和数学模型的形式进行探讨。     

最优布局中任意曲线状图形处理

介绍了适合于多类型、曲线状零件优化排料的图形处理数据结构和算法，并加以探讨和研究。以此思想所设计的系统运行结果良好。     

A modular algorithm for resource allocation

This paper concerns resource allocation in distributed message passing systems, i.e., the scheduling of accesses to exclusive system resources shared among concurrent processes. An efficient modular resource allocation algorithm is presented that uses any arbitrary resource allocation algorithm as a subroutine. It improves the performance of the subroutine by letting each process wait only for its currently conflicting processes, and therefore, allows more concurrency. For appropriate choices of the subroutine, we obtain resource allocation algorithms with the minimum worst case response times. Simulation studies were conducted which also indicate that on average, the obtained algorithms perform faster and require a smaller number of messages than other previously known algorithms, especially when resource contention among processes is high and the average time that a process remains in the critical region is large. Received: May 1997 / Accepted: May 1998