Vienna Fortran supports a wide range of data-parallel numerical problems. However, a significant number of scientific and engineering applications are of a multi-disciplinary and heterogeneous nature and thus do not f...
详细信息
Vienna Fortran supports a wide range of data-parallel numerical problems. However, a significant number of scientific and engineering applications are of a multi-disciplinary and heterogeneous nature and thus do not fit well into the data parallel paradigm. In this paper we present new language extensions to fill this gap. Tasks can be spawned as asynchronous activities in a homogeneous or heterogeneous computing environment; they interact by sharing access to Shared Data Abstractions (SDAs). SDAs are an extension of Fortran 90 modules, representing a pool of common data, together with a set of methods for controlled access to these data and a mechanism for providing persistent storage. These extensions support the integration of data and task parallelism and can be used to express task parallel applications in a natural and efficient way.
Deep learning is becoming crucial for tackling the increasing modeling complexity of scientific and engineering applications. However, designing high-performing deep neural network (DNN) models can be a challenging an...
Deep learning is becoming crucial for tackling the increasing modeling complexity of scientific and engineering applications. However, designing high-performing deep neural network (DNN) models can be a challenging and time-consuming task that requires expertise. To address this challenge, we have developed DeepHyper [1], a software package that automates the design and development of DNN models for scientific and engineering applications through scalable neural architecture and hyperparameter search. Our approach emphasizes deep learning over parallel and distributed infrastructures, enabling us to efficiently design and train DNNs for a wide range of scientific applications. In this talk, we will present our recent work on using DeepHyper to automatically generate an ensemble of DNNs at scale and using them to estimate data (aleatoric) and model (epistemic) uncertainties. Our approach enables us to leverage the power of parallel and distributed infrastructures to scale the training of DNNs and improve their performance, while reducing the time and expertise required for manual architecture design and hyperparameter tuning.
General Purpose computing with Graphics Processing Units (GPGPU) has gained widespread adoption in both the high performance and general purpose communities. In most GPU computation, execution exploits a Single Instru...
详细信息
Summary form only given. Transforming abstract algorithm specifications into executable code is an error-prone process in the absence of sophisticated compilers that can automatically translate such specifications int...
详细信息
Summary form only given. Transforming abstract algorithm specifications into executable code is an error-prone process in the absence of sophisticated compilers that can automatically translate such specifications into the target distributed system. We present a framework that was developed for translating algorithms specified as Input/Output Automata (IOA) to distributed programs. The framework consists of a methodology that guides the software development process and a core set of functions needed in target implementations that reduce unnecessary software development. The systems developed using this methodology preserve the modularity of the original specifications, making it easier to track refinements and effect optimizations. As a proof of concept, this work also presents a distributed implementation of a reconfigurable atomic memory service for dynamic networks (RAMBO). This service emulates atomic read/write shared objects in the dynamic setting where processors can arbitrarily crash, or join and leave the computation. The algorithm tolerates processor crashes and message loss and guarantees atomicity for arbitrary patterns of asynchrony and failure. The algorithm implementing the service is given in terms of IOA. An important consideration in formulating RAMBO was that it could be employed as a building block in real systems. Following a formal presentation of RAMBO algorithm, this work describes an optimized implementation that was developed using the methodology presented here. The system is implemented in Java and runs on a network of workstations. Empirical data illustrates the behavior of the system.
Due to time constraints (one term or quarterly subjects) software projects used in university classes of softwareengineering are usually limited to small developments, with few people involved and without any previou...
详细信息
Workflow enactment systems are becoming an effective solution to ease programming, deployment and execution of distributed applications in several domains such as telecommunication, manufacturing, e-business, e-govern...
详细信息
ISBN:
(纸本)9781424400546
Workflow enactment systems are becoming an effective solution to ease programming, deployment and execution of distributed applications in several domains such as telecommunication, manufacturing, e-business, e-government and grid computing. In some of these fields, efficiency and traffic optimization represent key aspects for a wide diffusion of workflow engines and modeling tools. This paper focuses on a technique that enables fine-grained concurrency in compute and data-intensive workflows and reduces the traffic on the network by limiting the number of interactions to the ones strictly needed to bring the data where they are really necessary for continuing the flow of computations. We implemented this technique by using the concepts of wait by necessity and automatic continuation and we integrated it in a flexible, Java workflow engine that through the new mechanisms is able to navigate a workflow anticipating the enactment of sequential activities
Summary form only given. software dynamic translation (SDT) is a technology that allows programs to be modified as they are running. The overhead of monitoring and modifying a running program's instructions is oft...
详细信息
Summary form only given. software dynamic translation (SDT) is a technology that allows programs to be modified as they are running. The overhead of monitoring and modifying a running program's instructions is often substantial in SDT systems. As a result, SDT can be impractically slow, especially in SDT systems that do not or cannot employ dynamic optimization to offset overhead. This is unfortunate since SDT has obvious advantages in modern computing environments and interesting applications of SDT continue to emerge. We investigate several overhead reduction techniques, including indirect branch translation caching, fast returns, and static trace formation that can improve SDT performances significantly.
In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two language-independent program representations are presented for explici...
详细信息
In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two language-independent program representations are presented for explicitly representing control flows and/or data flows in a concurrent logic program. Then based on these representations, program dependences between literals in concurrent logic programs are defined formally, and a dependence-based program representation named the Literal Dependence Net (LDN) is presented for explicitly representing primary program dependences in a concurrent logic program. Finally, as applications of the LDNs, some important softwareengineering activities including program slicing, debugging, testing, complexity measurement, and maintenance are discussed in a programming environment for concurrent logic programs.
The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. Combining sequences of concurrent operations into atomic transactions seems to...
详细信息
The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. Combining sequences of concurrent operations into atomic transactions seems to promise a great reduction in the complexity of both programming and verification, by making parts of the code appear to be sequential without the need to program fine-grained locks. software transactional memory offers to deliver a transactional programming environment without the need for costly modifications in processor design. However, the story of software transactional memory reminds one of garbage collection in its time: performance is improving, and the semantics are becoming clearer, yet there is still a long road ahead, a road strewn with stones below and crows hovering above, predicting its demise. This talk will try to take a sober look at software transactional memory, its history, the state of research today, and what we can expect to achieve it in the foreseeable future.
This volume contains the proceedings of the 18thinternationalsymposium on Mathematical Foundations ofComputer Science, MFCS '93, held in Gdansk, Poland,August-September 1993.The MFCS symposia, organized annua...
详细信息
ISBN:
(数字)9783540479277
ISBN:
(纸本)9783540571827
This volume contains the proceedings of the 18th
internationalsymposium on Mathematical Foundations of
Computer Science, MFCS '93, held in Gdansk, Poland,
August-September 1993.
The MFCS symposia, organized annually in Poland and the
former Czechoslovakia since 1972, have a long and
well-established tradition. Over the years they have served
as a meeting ground for specialists from all branches of
theoretical computer science, in particular
- algorithms and complexity, automata theory and theory of
languages,
- concurrent, distributed and real-time systems,
- the theory of functional, logic and object-oriented
programming,
- lambda calculus and type theory,
- semantics and logics of programs,
and others. The volume contains 12 invitedlectures and 56
contributed papers selected from 133 submissions.
暂无评论