Daniel S. Katz

Daniel S. Katz

Auto-generated profile, based on publicly available information

Daniel S. Katz

University of Illinois Urbana-Champaign, Urbana, Illinois, USA

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2005 in Scientific Programming
Verified
Journal Article
Open access
PDF file
EDEwa Deelman
Ewa Deelman
GSGurmeet Singh
Gurmeet Singh
MSMei-Hui Su
Mei-Hui Su
JBJames Blythe
James Blythe
YGYolanda Gil
Yolanda Gil
DKDaniel S. Katz
Daniel S. Katz
This paper describes the Pegasus framework that can be used to map complex scientific workflows onto distributed resources. Pegasus enables users to represent the workflows at an abstract level without needing to worry about the particulars of the target execution systems. The paper describes general issues in mapping applications and the functionality of Pegasus. We present the results of improving application performance through workflow restructuring which clusters multiple tasks in a workflow into single entities. A real‐life astronomy application is used as the basis for the study.

14 October 2022 in Scientific Data
Verified
Journal Article
Open access
PDF file
MBMichelle Barker
Michelle Barker
NHNeil P. Chue Hong
Neil P. Chue Hong
DKDaniel S. Katz
Daniel S. Katz
ALAnna-Lena Lamprecht
Anna-Lena Lamprecht
CMCarlos Martinez-Ortiz
Carlos Martinez-Ortiz
THTom Honeyman
Tom Honeyman
Research software is a fundamental and vital part of research, yet significant challenges to discoverability, productivity, quality, reproducibility, and sustainability exist. Improving the practice of scholarship is a common goal of the open science, open source, and FAIR (Findable, Accessible, Interoperable and Reusable) communities and research software is now being understood as a type of digital object to which FAIR should be applied. This emergence reflects a maturation of the research community to better understand the crucial role of FAIR research software in maximising research value. The FAIR for Research Software (FAIR4RS) Working Group has adapted the FAIR Guiding Principles to create the FAIR Principles for Research Software (FAIR4RS Principles). The contents and context of the FAIR4RS Principles are summarised here to provide the basis for discussion of their adoption. Examples of implementation by organisations are provided to share information on how to maximise the value of research outputs, and to encourage others to amplify the importance and impact of this work.

1 September 2011 in Parallel Computing
Verified
Journal Article
Closed access
MWMichael Wilde
Michael Wilde
MHMihael Hategan
Mihael Hategan
JWJustin M. Wozniak
Justin M. Wozniak
BCBen Clifford
Ben Clifford
DKDaniel S. Katz
Daniel S. Katz
IFIan Foster
Ian Foster

19 September 2016 in PeerJ Computer Science
Verified
Journal Article
Open access
PDF file
ASArfon M. Smith
Arfon M. Smith
DKDaniel S. Katz
Daniel S. Katz
KNKyle Niemeyer
Kyle Niemeyer
Software is a critical part of modern research and yet there is little support across the scholarly ecosystem for its acknowledgement and citation. Inspired by the activities of the FORCE11 working group focused on data citation, this document summarizes the recommendations of the FORCE11 Software Citation Working Group and its activities between June 2015 and April 2016. Based on a review of existing community practices, the goal of the working group was to produce a consolidated set of citation principles that may encourage broad adoption of a consistent policy for software citation across disciplines and venues. Our work is presented here as a set of software citation principles, a discussion of the motivations for developing the principles, reviews of existing community practice, and a discussion of the requirements these principles would place upon different stakeholders. Working examples and possible technical solutions for how these principles can be implemented will be discussed in a separate paper.

1 August 1994 in IEEE Microwave and Guided Wave Letters
Verified
Journal Article
Closed access
DKD.S. Katz
D.S. Katz
ETE.T. Thiele
E.T. Thiele
ATA. Taflove
A. Taflove
Berenger recently published a novel absorbing boundary condition (ABC) for FD-TD meshes in two dimensions, claiming orders-of-magnitude improved performance relative to any earlier technique. This approach, which he calls the "perfectly matched layer (PML) for the absorption of electromagnetic waves", creates a nonphysical absorber adjacent to the outer grid boundary that has a wave impedance independent of the angle of incidence and frequency of outgoing scattered waves. This paper verifies Berenger's strong claims for PML for 2-D FD-TD grids and extends and verifies PML for 3-D FD-TD grids. Indeed, PML is >40 db more accurate than second-order Mur (1981), and PML works just as well in 3-D as it does in 2-D. It should have a major impact upon the entire FD-TD modeling community, leading to new possibilities for high-accuracy simulations especially for low-observable aerospace targets.

17 June 2019
Verified
Conference Paper
Open access
YBYadu Babuji
Yadu Babuji
AWAnna Woodard
Anna Woodard
ZLZhuozhao Li
Zhuozhao Li
DKDaniel S. Katz
Daniel S. Katz
BCBen Clifford
Ben Clifford
KCKyle Chard
Kyle Chard
High-level programming languages such as Python are increasingly used to provide intuitive interfaces to libraries written in lower-level languages and for assembling applications from various components. This migration towards orchestration rather than implementation, coupled with the growing need for parallel computing (e.g., due to big data and the end of Moore's law), necessitates rethinking how parallelism is expressed in programs. Here, we present Parsl, a parallel scripting library that augments Python with simple, scalable, and flexible constructs for encoding parallelism. These constructs allow Parsl to construct a dynamic dependency graph of components that it can then execute efficiently on one or many processors. Parsl is designed for scalability, with an extensible set of executors tailored to different use cases, such as low-latency, high-throughput, or extreme-scale execution. We show, via experiments on the Blue Waters supercomputer, that Parsl executors can allow Python scripts to execute components with as little as 5 ms of overhead, scale to more than 250000 workers across more than 8000 nodes, and process upward of 1200 tasks per second. Other Parsl features simplify the construction and execution of composite programs by supporting elastic provisioning and scaling of infrastructure, fault-tolerant execution, and integrated wide-area data management. We show that these capabilities satisfy the needs of many-task, interactive, online, and machine learning applications in fields such as biology, cosmology, and materials science.