Search NASA⌕ Search

SEARCH · Search NASA

Results for “PGAS”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

Park Smart

The Parking Garage Automation System (PGAS) is based on a technology developed by a NASA-sponsored project called Robot sensorSkin(TM). Merritt Systems, Inc., of Orlando, Florida, teamed up with NASA to improve robots working with critical flight hardware at Kennedy Space Center in Florida. The system, containing smart sensor modules and flexible printed circuit board skin, help robots to steer clear of obstacles using a proximity sensing system. Advancements in the sensor designs are being applied to various commercial applications, including the PGAS. The system includes a smartSensor(TM) network installed around and within public parking garages to autonomously guide motorists to open facilities, and once within, to free parking spaces. The sensors use non-invasive reflective-ultrasonic technology for high accuracy, high reliability, and low maintenance. The system is remotely programmable: it can be tuned to site-specific requirements, has variable range capability, and allows remote configuration, monitoring, and diagnostics. The sensors are immune to interference from metallic construction materials, such as rebar and steel beams. Inside the garage, smart routing signs mounted overhead or on poles in front of each row of parking spots guide the motorist precisely to free spaces.

Source record↗

Challenges at Petascale for Pseudo-Spectral Methods on Spheres (A Last Hurrah?)

Conclusions: a) Proper software abstractions should enable rapid-exploration of platform-specific optimizations/ tradeoffs. b) Pseudo-spectra! methods are marginally viable for at least some classes of petascaie problems. i.e., GPU based machine with good bisection would be best. c) Scalability at exascale is possible, but the necessary resolution will make algorithm prohibitively expensive. Efficient implementations of realistic global transposes are mtricate and tedious in MPI. PS at petascaie requires exploration of a variety of strategies for spreading local and remote communic3tions. PGAS allows far simpler implementation and thus rapid exploration of variants.

Clune, Thomas↗

Framework for Extensible, Asynchronous Task Scheduling (FEATS) in Fortran

Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.

Modern Fortran↗