In this paper a new architecture description language called ArchC#, is introduced. ArchC# is an extension of ArchJava for C#. It is mainly focused on describing architecture of distributedsystems. ArchC# provides bu...
详细信息
ISBN:
(纸本)9783540756972
In this paper a new architecture description language called ArchC#, is introduced. ArchC# is an extension of ArchJava for C#. It is mainly focused on describing architecture of distributedsystems. ArchC# provides built-in constructs for describing distributed components and their interconnections. Specific features of distributed code such as remote asynchronous calls and activation of remote objects can be described in ArchC#. ArchC# unifies software architecture with an object-oriented implementation.
Recently, large-scale distributedsystems are being developed. Owing to the high construction cost, the lifetime of the systems are prolonged. Therefore, it is an important problem to achieve flexible distributed syst...
详细信息
ISBN:
(纸本)0818674601
Recently, large-scale distributedsystems are being developed. Owing to the high construction cost, the lifetime of the systems are prolonged. Therefore, it is an important problem to achieve flexible distributedsystems by introducing some mechanism in the system software for updating application software. The system cannot be kept highly available by the conventional updating methods because multiple processes have to be suspended simultaneously. This paper discusses a new method which allows each process to invoke the updating procedure asynchronously. The key idea is that multiple versions of processes can co-exist temporarily. Each pair of an old-version process and a new-version one is managed as a process group. The group communication protocol proposed in this paper supports message transmission among the process groups. Moreover, the protocol detects and resolves protocol errors caused by the mixture of multiple versions of processes by using checkpointing, timeout and rollback recovery.
In this paper an approach to provide Web-based framework for distributed execution of collaborative applications is presented. The work is a part of a wider on-going project whose aim is to make environmental simulati...
详细信息
ISBN:
(纸本)0818680431
In this paper an approach to provide Web-based framework for distributed execution of collaborative applications is presented. The work is a part of a wider on-going project whose aim is to make environmental simulation models publicly available to the Internet users. The Web computing skeleton has been constructed from prefabricated Web-enabled components with the ability to open and maintain Web connections and provide collaboration over the Internet. The case study illustrates how a single-user simulation system can be embedded in the skeleton, thus becoming widely available distributed application.
Among all programming paradigms, component-based engineering stands as one of the most followed approaches for real world software development. Its emphasis on clean separation of concerns and reusability makes it app...
详细信息
Among all programming paradigms, component-based engineering stands as one of the most followed approaches for real world software development. Its emphasis on clean separation of concerns and reusability makes it appealing for both industrial and research purposes. The Grid Component Model (GCM) endorses this approach in the context of distributedsystems by providing all the means to define, compose and dynamically reconfigure component-based applications. While structural reconfiguration is one of the key features of GCM applications, this ability to evolve at runtime poses several challenges w.r.t reliability. In this paper we present Mefresa, a framework for reasoning on the structure of GCM applications. This contribution comes in the form of a formal specification mechanized in the Coq Proof Assistant. Our aim is to demonstrate the benefits of interactive theorem proving for the reasoning on software architectures. We provide a configuration and reconfiguration language for the safe instantiation of distributedsystems.
Solfec is a computational code aimed at simulation of constrained multibody systems on distributed memory parallel computers. It implements an instance of the Contact Dynamics (CD) method by Moreau and Jean, hence the...
详细信息
Solfec is a computational code aimed at simulation of constrained multibody systems on distributed memory parallel computers. It implements an instance of the Contact Dynamics (CD) method by Moreau and Jean, hence the constraints are handled implicitly. One of the main goals of the software is to provide a user friendly platform for testing formulations and solution methods for the (dynamic) frictional contact problem. It is also meant to serve as a development platform for other aspects of time-stepping methods (e. g. contact detection, time integration, kinematic models). The purpose of this communication is to outline the algorithmic ideas behind Solfec, with an emphasis on the Gauss-Seidel constraints solver, a classical element of CD, efficiently implemented on a distributed memory model. The remaining topics include a dynamic domain decomposition balancing the computational load of the overall algorithm, and an accuracy measure for the frictional contact constraints. Solfec is an open-source software and can be downloaded from http://***/p/solfec. Copyright (C) 2011 John Wiley & Sons, Ltd.
Automated tuning of compute kernels is a popular area of research, mainly focused on finding optimal kernel parameters for a problem with fixed input sizes. This approach is good for deploying machine learning models,...
详细信息
ISBN:
(纸本)9781728174457
Automated tuning of compute kernels is a popular area of research, mainly focused on finding optimal kernel parameters for a problem with fixed input sizes. This approach is good for deploying machine learning models, where the network topology is constant, but machine learning research often involves changing network topologies and hyperparameters. Traditional kernel auto-tuning has limited impact in this case;a more general selection of kernels is required for libraries to accelerate machine learning research. In this paper we present initial results using machine learning to select kernels in a case study deploying high performance SYCL kernels in libraries that target a range of heterogeneous devices from desktop GPUs to embedded accelerators. The techniques investigated apply more generally and could similarly be integrated with other heterogeneous programming systems. By combining auto-tuning and machine learning these kernel selection processes can be deployed with little developer effort to achieve high performance on new hardware.
We argue for novel techniques to understand how cloud systems can fail, by enhancing fault injection with distributed tracing and anomaly detection techniques.
ISBN:
(纸本)9781538694435
We argue for novel techniques to understand how cloud systems can fail, by enhancing fault injection with distributed tracing and anomaly detection techniques.
software reliability techniques are aimed at reducing or eliminating failures in softwaresystems. Reliability in softwaresystems has traditionally been measured during or after system implementation. However, softwa...
详细信息
In this paper the design of systolic array processors for computing 2-dimensional Discrete Fourier Transform (2-D DFT) is considered. We investigated three different computational schemes for designing systolic array ...
详细信息
In this paper the design of systolic array processors for computing 2-dimensional Discrete Fourier Transform (2-D DFT) is considered. We investigated three different computational schemes for designing systolic array processors using systematic approach. The systematic approach guarantees to find optimal systolic array processors from a large solution space in terms of the number of processing elements and I/O channels, the processing time, topology, pipeline period, etc. The optimal systolic array processors are scalable, modular and suitable for VLSI implementation. An application of the designed systolic array processors to the prime-factor DFT is also presented.
With the DDR standard facing density challenges and the emergence of the non-volatile memory technologies such as Cross-Point, phase change, and fast FLASH media, compute and memory vendors are contending with a parad...
详细信息
ISBN:
(纸本)9781665440660
With the DDR standard facing density challenges and the emergence of the non-volatile memory technologies such as Cross-Point, phase change, and fast FLASH media, compute and memory vendors are contending with a paradigm shift in the datacenter space. The decades-long status quo of designing servers with DRAM technology as an exclusive memory solution is likely coming to an end. Future systems will increasingly employ tiered memory architectures (TMAs) in which multiple memor) , technologies work together to satisfy applications' ever-growing demands for more memory, less latency, and greater bandwidth. Exactly how to expose each memory type to software is an open question. Recent systems have focused on hardware caching to leverage faster DRAM memory while exposing slower non-volatile memory to OS-addressable space. The hardware approach that deals with the non-uniformity of TMA, however, requires complex changes to the processor and cannot use fast memory to increase the system's overall memory capacity. Mapping an entire TMA as OS-visible memory alleviates the challenges of the hardware approach but pushes the burden of managing data placement in the TMA to the software layers. The software, however, does not see the memory accesses by default;in order to make informed memory-scheduling decisions, software must rely on hardware methods to gain visibility into the load/store address stream. The OS then uses this information to place data in the most suitable memory location. In this paper, we evaluate different methods of memory-access collection and propose a hybrid tiered-memory approach that offers comprehensive visibility into TMA.
暂无评论