Shared Resource Multiprocessing

A good design is the Elderado in any systems area. The elements of good design include efficiency, simplicity, and flexibility for use. While we make no pretense that the ideas described in this paper are essential to good computer design, it seems to us that it does meet many of the criteria and avoids a number of the pitfalls associated with high performance computers.     

Program Development Tools for Clusters of Shared Memory Multiprocessors

Applications are increasingly being executed on computational systems that have hierarchical parallelism. There are several programming paradigms which may be used to adapt a program for execution in such an environment. In this paper, we outline some of the challenges in porting codes to such systems, and describe a programming environment that we are creating to support the migration of sequential and MPI code to a cluster of shared memory parallel systems, where the target program may include MPI, OpenMP or both. As part of this effort, we are evaluating several experimental approaches to aiding in this complex application development task.     

Using Data Accessibility for Resource Selection in Large-Scale Distributed Systems

Large-scale distributed systems provide an attractive scalable infrastructure for network applications. However, the loosely coupled nature of this environment can make data access unpredictable, and in the limit, unavailable. We introduce the notion of accessibility to capture both availability and performance. An increasing number of data-intensive applications require not only considerations of node computation power but also accessibility for adequate job allocations. For instance, selecting a node with intolerably slow connections can offset any benefit to running on a fast node. In this paper, we present accessibility-aware resource selection techniques by which it is possible to choose nodes that will have efficient data access to remote data sources. We show that the local data access observations collected from a node's neighbors are sufficient to characterize accessibility for that node. By conducting trace-based, synthetic experiments on PlanetLab, we show that the resource selection heuristics guided by this principle significantly outperform conventional techniques such as latency-based or random allocations. The suggested techniques are also shown to be stable even under churn despite the loss of prior observations.     

大型超市经营的理念与技术(上)

关于大型超市经营管理中信息技术的应用这样的大题目,可以从很多方面去讲, 本文的切入点是"理念与技术",即管理理念与数字科技的关系.     

High-Performance Resource Allocation and Request Redirection Algorithms for Web Clusters

With increasing richness in features such as personalization of content, Web applications are becoming increasingly complex and hence compute intensive. Traditional approaches for improving performance of static content Web sites have been based on the assumption that static content such as images are network intensive. However, these methods are not applicable to the dynamic content applications which are more compute intensive than static content. This paper proposes a suite of algorithms which jointly optimize the performance of dynamic content applications by reducing the client access times while also minimizing the resource utilization. A server migration algorithm allocates servers on-demand within a cluster such that the client access times are not affected even under sudden overload conditions. Further, a server selection mechanism enables statistical multiplexing of resources across clusters by redirecting requests away from overloaded clusters. We also propose a cluster decision algorithm which decides whether to migrate in additional servers at the local cluster or redirect requests remotely under different workload conditions. Through a combination of analytical modeling, trace-driven simulation over traces from large e-commerce sites and testbed implementation, we explore the performance savings achieved by the proposed algorithms.     

基于工作组环境的共享资源访问

根据网络访问的基本原理。系统阐述了工作组环境下共享资源互访过程．分析了每个环节具体功能．给予网络分析有据可依。     

机群系统的智能配置管理

该文主要讨论了基于曙光4000A机群系统的智能配置管理的设计和实现。智能配置管理基于服务和构件的设计思想和机群系统四层软件体系结构。通过采用实时事件管理,它实现了准确、及时、主动、智能的信息服务,同时还提供了许多优良的特性,包括服务高可用性、良好的可扩展性、包容性和自动角色转换等。     

开放式实时系统资源共享环境下的调度方法分析

介绍Stack Resource Policy及以其为基础的用于开放式实时系统资源共享环境下静态调度策略,分析其存在的两个问题:资源锁定时间过长和任务不可执行,介绍相关解决方法.然后介绍Bandwidth Inheritance及类似的动态调度策略的基本调度规则并重点分析Bandwidth Inheritance在一般情况下,由于软实时任务的动态性,可能出现的软实时任务阻塞硬实时任务,导致硬实时任务截止时间得不到满足的问题.提出一种解决方法:资源隔离机制(Resource Isolation Policy),介绍其基本规则及性质,并分析加入此机制后硬实时任务的可调度性.     

Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters

Security is increasingly becoming an important issue in the design of real-time parallel applications, which are widely used in the industry and academic organizations. However, existing resource allocation schemes for real-time parallel jobs on clusters generally do not factor in security requirements when making allocation and scheduling decisions. In this paper, we develop two resource allocation schemes, called task allocation for parallel applications with deadline and security constraints (TAPADS) and security-aware and heterogeneity-aware resource allocation for parallel jobs (SHARP), by taking into account applications' timing and security requirements in addition to precedence constraints. We consider two types of computing platforms: homogeneous clusters and heterogeneous clusters. To facilitate the presentation of the new schemes, we build mathematical models to describe a system framework, security overhead, and parallel applications with deadline and security constraints. The proposed schemes are applied to heuristically find resource allocations that maximize the quality of security and the probability of meeting deadlines for parallel applications running on clusters. Extensive experiments using real-world applications and traces, as well as synthetic benchmarks, demonstrate the effectiveness and practicality of the proposed schemes.     

大型管理信息系统体系结构设计

论文首先阐述大型管理信息系统采取的应用体系结构,然后分析对应的数据分布、功能实现方式及系统软、硬件结构,以期为大家在设计大型管理信息系统体系结构时提供参考依据。     

Survey of Large-Scale Data Management Systems for Big Data Applications

Today, data is flowing into various organizations at an unprecedented scale. The ability to scale out for processing an enhanced workload has become an important factor for the proliferation and popula...     

Human Resource Management for Continuous Improvement

This paper investigates the relationship between HRM practices and Continuous Improvement (CI) activities in order to gain an understanding of how the HRM function may be utilized to improve CI implementation success, and consequently, company performance. The paper begins with a brief review of the HRM and CI literature and then presents statistical analyses of data collected from the Continuous Improvement Network Survey (2003), which demonstrate that HRM has a significant effect on CI behaviour and company performance, with the strongest relationship between HRM, CI and performance occurring when companies align their CI activities with their strategic objectives and use systems, procedures and processes to measure the results of their CI activities.     

一种能耗感知的虚拟集群CPU资源自动再配置方法

系统虚拟化技术可以动态再配置应用环境的计算资源.当前动态资源配置方法主要关注于保证具有动态负载应用的服务质量.这些方法受应用性能驱动并常常增加资源控制系统的响应延迟.针对上述问题提出了以资源使用状态为驱动的资源再配置方法(resource-use-status-drivenresource reconfigurationscheme,RUSiC),自动适应动态负载变化来满足应用性能的资源需求.RUSiC被设计成2层架构的资源再配置模型,基于实时的资源使用状态,及时用较小的开销为应用调整合适的资源配置.同时,RUSiC也考虑到电能的有效使用,在资源的新配置中通过尽可能减少激活物理节点的数量避免大量不必要的电能消耗及相关的冷却费用.实验数据表明,在应用负载变化时,RUSiC能快速监测并响应变化的资源需求,并在保证应用性能的前提下,使用较小数量的激活物理节点.     

网格资源管理系统模型研究

本文介绍了网格资源管理系统的三种模型:分层模型、抽象所有者模型和计算经济模型及其在网格计算系统中的应用。     

支持高速网络生存性的资源管理机制

在分析故障快速恢复机制的基础上,重点研究了支持自下而上性的资源策略机制,包括空闲容量的设计和动态调整两方面。结合资源管理。提出了生存性准入控制算法,作为正在研究的生存性服务质量框架的一个重要组成部分。     

Subontology-Based Resource Management for Web-Based e-Learning

Recent advances in Web and information technologies have resulted in many e-learning resources. There is an emerging requirement to manage and reuse relevant resources together to achieve on-demand e-learning in the Web. Ontologies have become a key technology for enabling semantic-driven resource management. We argue that to meet the requirements of semantic-based resource management for Web-based e-learning, one should go beyond using domain ontologies statically. In this paper, we provide a semantic mapping mechanism to integrate e-learning databases by using ontology semantics. Heterogeneous e-learning databases can be integrated under a mediated ontology. Taking into account the locality of resource reuse, we propose to represent context-specific portions from the whole ontology as sub-ontologies. We present a sub-ontology-based approach for resource reuse by using an evolutionary algorithm. We also conduct simulation experiments to evaluate the approach with a traditional Chinese medicine e-learning scenario and obtain promising results.