About: Entry point is a research topic. Over the lifetime, 144 publications have been published within this topic receiving 2876 citations. The topic is also known as: args.
TL;DR: In this paper, a shared closure of data objects, which consists of the first data object and a transitive closure of the referenced data objects is identified, and a determination is made as to whether the shared closure is usable in a second runtime system.
Abstract: Methods and apparatus, including computer systems and program products, for sharing data objects in runtime systems. An identification of a first data object in a first runtime system is received. The first data object references zero or more referenced data objects. A shared closure of data objects, which consists of the first data object and a transitive closure of the referenced data objects, is identified, and a determination is made as to whether the shared closure of data objects is usable in a second runtime system. In some implementations, determining whether a shared closure is usable in a second runtime system includes determining whether each data object in the shared closure is serializable without execution of custom code, or determining whether the runtime class of each object instance in the shared closure is shareable. Using shared closures to share objects between runtime systems can provide isolation between user sessions.
TL;DR: In this paper, the authors present runtime and compile-time analysis for block structured codes on distributed memory parallel machines in an efficient and machine-independent fashion, which can be used by compilers for HPF-like parallel programming languages in compiling codes in which data distribution, loop bounds and/or strides are unknown at compile time.
Abstract: In compiling applications for distributed memory machines, runtime analysis is required when data to be communicated cannot be determined at compile-time. One such class of applications requiring runtime analysis is block structured codes. These codes employ multiple structured meshes, which may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular mesh problems). In this paper, we present runtime and compile-time analysis for compiling such applications on distributed memory parallel machines in an efficient and machine-independent fashion. We have designed and implemented a runtime library which supports the runtime analysis required. The library is currently implemented on several different systems. We have also developed compiler analysis for determining data access patterns at compile time and inserting calls to the appropriate runtime routines. Our methods can be used by compilers for HPF-like parallel programming languages in compiling codes in which data distribution, loop bounds and/or strides are unknown at compile-time. To demonstrate the efficacy of our approach, we have implemented our compiler analysis in the Fortran 90D/HPF compiler developed at Syracuse University. We have experimented with a multi-bloc Navier-Stokes solver template and a multigrid code. Our experimental results show that our primitives have low runtime communication overheads and the compiler parallelized codes perform within 20% of the codes parallelized by manually inserting calls to the runtime library. >
TL;DR: In this paper, a method for detecting creation of a runtime object by an application program or operating system is presented. But the method evaluates a predicate for a set associated with the runtime object to determine membership of the run-object in the set.
Abstract: Maintaining a set of runtime objects. A method of the invention detects creation of a runtime object by an application program or operating system. The method evaluates a predicate for a set associated with the runtime object to determine membership of the runtime object in the set. Further, one or more properties of the set may be applied to the determined runtime object members of the set (e.g., to control access to a resource).
TL;DR: In this paper, the authors propose a dataflow processing model for parallel program development and processing, where a program developer can develop programs for execution by a parallel computer system using a predetermined set of components which can be selected by the program developer, using a graphical user interface.
Abstract: A parallel program development and processing system includes a parallel program development section and a parallel program execution section. The parallel program development section allows a program developer to develop programs for execution by a parallel computer system using a predetermined set of components which can be selected by the program developer, using a graphical user interface, and linked in a dataflow graph that represents the order of operations to be performed by the program on the data to be processed. After the program developer has developed the graph, the parallel program development section generates executable program code from the instances of the components and their interconnections, for execution by a parallel computer. In the executable program code, instances of the components selected by the program developer form executable objects which are executed by the parallel computer under control of a run-time system that includes an execution control object. The execution control object controls processing of the executable objects using a dataflow processing model, in which each executable object processes data which it receives, but blocks if it has no data to process or if a downstream element is unable to receive data that it has processed. When an executable object blocks, the execution control object is called to correct the blocking condition. When the blocking condition is corrected, the execution control object enables the blocked executable object to resume operations.
TL;DR: In this article, the authors propose techniques to support co-location and certification of executable content from a pre-boot space into an operating system kernel mode runtime environment, where the runtime services provided by the platform firmware runtime drivers are called via operating system interfaces.
Abstract: Techniques to support co-location and certification of executable content from a pre-boot space into an operating system kernel mode runtime environment. The invention enables platform firmware runtime drivers to be loaded into memory as executable images during a pre-boot process and subsequently mapped into an operating system's runtime environment when the operating system is booted so as to enable runtime services provided by the platform firmware runtime drivers to be called via operating system interfaces. Prior to loading the executable images, a type certification check that compares type structure information corresponding to a runtime driver's opcode with type structure information corresponding to an operating system interface used to call the runtime driver may be performed. Additionally, a runtime driver file integrity verification may also be performed using a digital signature and associated key. The runtime driver may be loaded from various platform storage devices, including flash devices and option ROMs.