The Internet Operating System: Middleware for Adaptive Distributed Computing

Maghraoui, Kaoutar El; Desell, Travis; Szymanski, Boleslaw K.; Varela, Carlos A.

doi:10.1177/1094342006068411

Cited by 40 publications

(36 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Maghraoui et al [10] used special constructs in the user job files to indicate the atomic computational units of the jobs. In a distributed platform, upon resource unavailability, these constructs are referred There are a number of simulations conducted that involve determining the granularity of a batch in parallel and distributed environments.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Batch Resizing Policies and Techniques for Fine-Grain Grid Tasks: The Nuts and Bolts

Muthuvelu¹,

Chai²,

Eswaran³

et al. 2011

Journal of Information Processing Systems

View full text Add to dashboard Cite

Abstract-The overhead of processing fine-grain tasks on a grid induces the need for batch processing or task group deployment in order to minimise overall application turnaround time. When deciding the granularity of a batch, the processing requirements of each task should be considered as well as the utilisation constraints of the interconnecting network and the designated resources. However, the dynamic nature of a grid requires the batch size to be adaptable to the latest grid status. In this paper, we describe the policies and the specific techniques involved in the batch resizing process. We explain the nuts and bolts of these techniques in order to maximise the resulting benefits of batch processing. We conduct experiments to determine the nature of the policies and techniques in response to a real grid environment. The techniques are further investigated to highlight the important parameters for obtaining the appropriate task granularity for a grid resource.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The steps (3,4,14,(6)(7)(8)(9)(10) are repeated until all the remaining BoT TOTAL tasks are successfully deployed and processed.…”

Section: Phase Ii: Task Deployment Analysis Till Batch Task Deploymentmentioning

confidence: 99%

Batch Resizing Policies and Techniques for Fine-Grain Grid Tasks: The Nuts and Bolts

Muthuvelu¹,

Chai²,

Eswaran³

et al. 2011

Journal of Information Processing Systems

View full text Add to dashboard Cite

show abstract

“…The runtime presented also gives first class support for assigning actors to threads. Previous work with the Internet Operating System (IOS) has shown that dynamic reconfiguration of distributed SALSA programs can be used to improve performance [34,35]. The stage based runtime can be extended to enable local mobility of actors, allowing actors to dynamically change what stage they are assigned to.…”

Section: Future Workmentioning

confidence: 99%

SALSA Lite: A Hash-Based Actor Runtime for Efficient Local Concurrency

Desell

Varela

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. As modern computer processors continue becoming more parallel, the actor model plays an increasingly important role in helping develop correct concurrent systems. In this paper, we consider efficient runtime strategies for non-distributed actor programming languages. While the focus is on a non-distributed implementation, it serves as a platform for a future efficient distributed implementation. Actors extend the object model by combining state and behavior with a thread of control, which can significantly simplify concurrent programming. Further, with asynchronous communication, no shared memory, and the fact an actor only processes one message at a time, it is possible to easily implement transparent distributed message passing and actor mobility. This paper discusses SALSA Lite, a completely re-designed actor runtime system engineered to maximize performance. The new runtime consists of a highly optimized core for lightweight actor creation, message passing, and message processing, which is used to implement more advanced coordination constructs. This new runtime is novel in two ways. First, by default the runtime automatically maps the lightweight actors to threads, allowing the number of threads used by a program to be specified at runtime transparently, without any changes to the code. Further, language constructs allow programmers to have first class control over how actors are mapped to threads (creating new threads if needed). Second, the runtime directly maps actor garbage collection to object garbage collection, allowing non-distributed SALSA programs to use Java's garbage collection "for free". This runtime is shown to have comparable or better performance for basic actor constructs (message passing and actor creation) than other popular actor languages: Erlang, Scala, and Kilim.

show abstract

“…Process Checkpointing and Migration (PCM) [18,19] is a runtime system built in the context of the Internet Operating System (IOS) [20] and uses process migration to provide malleability to MPI applications. The PCM/IOS library allows MPI programs to reconfigure themselves to adapt to the available processors as well as the performance of the application by using either split/merge operations or process migration.…”

Section: Related Workmentioning

confidence: 99%

Enhancing the performance of malleable MPI applications by using performance-aware dynamic reconfiguration

et al. 2015

View full text Add to dashboard Cite

The work in this paper focuses on providing malleability to MPI applications by using a novel performance-aware dynamic reconfiguration technique. This paper describes the design and implementation of Flex-MPI, an MPI library extension which can automatically monitor and predict the performance of applications, balance and redistribute the workload, and reconfigure the application at runtime by changing the number of processes. Unlike existent approaches, our reconfiguring policy is guided by user-defined performance criteria. We focus on iterative SPMD programs, a class of applications with critical mass within the scientific community. Extensive experiments show that Flex-MPI can improve the performance, parallel efficiency, and cost-efficiency of MPI programs with a minimal effort from the programmer.

show abstract

The Internet Operating System: Middleware for Adaptive Distributed Computing

Cited by 40 publications

References 31 publications

Batch Resizing Policies and Techniques for Fine-Grain Grid Tasks: The Nuts and Bolts

Batch Resizing Policies and Techniques for Fine-Grain Grid Tasks: The Nuts and Bolts

SALSA Lite: A Hash-Based Actor Runtime for Efficient Local Concurrency

Enhancing the performance of malleable MPI applications by using performance-aware dynamic reconfiguration

Contact Info

Product

Resources

About