WorldCat Identities

Berman, Fran

Works: 18 works in 50 publications in 1 language and 1,309 library holdings
Genres: Case studies 
Roles: Author, Editor
Publication Timeline
Most widely held works about Fran Berman
Most widely held works by Fran Berman
Grid computing : making the global infrastructure a reality by Fran Berman( Book )

26 editions published between 2003 and 2005 in English and held by 318 WorldCat member libraries worldwide

Grid computing is applying the resources of many computers in a network to a single problem at the same time Grid computing appears to be a promising trend for three reasons: its ability to make more cost-effective use of a given amount of computer resources; as a way to solve problems that can't be approached without an enormous amount of computing power; and because it suggests that the resources of many computers can be cooperatively and perhaps synergistically harnessed and managed as a collaboration toward a common objective. This book features contributions from the major players in the field and covers all aspects of grid technology from motivation to applications. It provides an extensive state-of-the-art guide in grid computing and is essential reading for researchers in computing and engineering, physicists, statisticians, engineers and mathematicians and IT policy makers
Trash to cash : how businesses can save money and increase profits by Fran Berman( Book )

2 editions published in 1996 in English and held by 121 WorldCat member libraries worldwide

Generalized planar matching by Fran Berman( Book )

3 editions published in 1985 in English and held by 8 WorldCat member libraries worldwide

This paper proves that maximum planar H-matching (the problem of determining the maximum number of node-disjoint copies of the fixed graph H contained in a variable planar graph G) is NP-complete for any connected planar graph H with three or more nodes. It is also shown that perfect planar H-matching is NP-complete for any connected outerplanar graph H with three or more nodes, and is, somewhat surprisingly solvable in linear time for traingulated H with four or more nodes. The results generalize and unify several special-case results proved in the literature. The techniques can also be applied to solve a variety of problems, including the optimal tile salvage problem from wafer-scale integration. Although the authors prove that the optimal tile salvage problem and others like it are NP-complete, they also describe provably good approximation algorithms that are suitable for practical applications. (Author)
Optimal Tile Salvage by Fran Berman( Book )

2 editions published in 1982 in English and held by 3 WorldCat member libraries worldwide

A map is a tiling of a finite region of the plane with unit squares such that some tiles have been removed. The optimal x x y-Tile Salvage Problem is: Given a map, find the maximum number of non-overlapping x x y tiled rectangles. A polynomial time algorithm is given for the 1 x 2 case, i.e., adjacent pairs. It is shown that the problem is NP-complete for the 2 x 2 case. A polynomial time algorithm is presented for finding 2 x 2 groups that is no worse than one half optimal. The problem is motivated by a technique for increasing the size of very large scale integrated (VLSI) circuit chips. (Author)
Practical performance guidelines : matching parallel machines, algorithms, and languages by William G Griswold( Book )

2 editions published in 1994 in English and held by 1 WorldCat member library worldwide

Rorschach assessment of abusive and non-abusive women : a study of borderline personality organization by Fran Berman( )

2 editions published between 1981 and 1982 in English and held by 1 WorldCat member library worldwide

Mapping function-parallel programs with the Prep-P automatic mapping preprocessor by Fran Berman( Book )

2 editions published in 1994 in English and held by 1 WorldCat member library worldwide

National Partnership for Advanced Computational Infrastructure : NPACI by National Partnership for Advanced Computational Infrastructure (U.S.)( )

in English and held by 0 WorldCat member libraries worldwide

Provides information about NPACI, whose mission is "to advance science by creating a ubiquitous, continuous, and pervasive national computational infrastructure: the Grid." Includes links to projects and publications
Combining workstations and supercomputers to support Grid applications : the parallel tomography experience by Shava Smallen( )

1 edition published in 2000 in English and held by 0 WorldCat member libraries worldwide

Computational Grids are becoming an increasingly important and powerful platform for the execution of large-scale, resource-intensive applications. However, it remains a challenge for applications to tap the potential of Grid resources in order to achieve performance. In this paper, we illustrate how applications can leverage Grids to achieve performance through coallocation. We describe our experiences developing a scheduling strategy for a real-life parallel tomography application targeted to Grids which contain both workstations and parallel supercomputers. Our strategy uses dynamic information exported by a supercomputer's batch scheduler to simultaneously schedule on workstations and immediately available supercomputer nodes. This strategy is of great practical interest because it combines resources available to the typical research lab: time-shared workstations and CPU time in remote space-shared supercomputers. We show that this strategy improves the performance of the parallel tomography application compared to traditional scheduling strategies, which target the application to either type of resource alone
Heuristics for scheduling parameter sweep applications in Grid environments by Henri Casanova( )

1 edition published in 1999 in English and held by 0 WorldCat member libraries worldwide

The computational Grid provides a promising platform for the efficient execution of parameter sweep applications over very large parameter spaces. Scheduling such applications is challenging because target resources are heterogeneous, because their load and availability varies dynamically, and because tasks may share common data files. In this paper, we propose a scheduling algorithm for parameter sweep applications on the Grid. We consider standard heuristics for task/host assignment (Max-min, Min-min, Sufferage), and we propose an extension of Sufferage called XSufferage. Using simulation, we demonstrate 3 results: 1) that XSufferage can take advantage of file sharing to achieve better performance than the other heuristics under a wide variety of load conditions, 2) that it is possible to characterize the environments under which different heuristics perform best, and 3) that it is possible to characterize the performance of different heuristics under the (realistic) assumption of varying accuracy of performance estimations
The virtual instrument : support for Grid-enabled scientific simulations by Henri Casanova( )

1 edition published in 2002 in English and held by 0 WorldCat member libraries worldwide

Ensembles of distributed, heterogeneous resources, or Computational Grids, have emerged as popular platforms for large-scale scientific applications. This paper presents the Virtual Instrument project which targets those platforms. More specifically, the project seeks to provide an integrated application execution environment that enables end-users to run and interact with running scientific simulations on the Grid. This work is performed in the specific context of a computational biology application: MCell. Even though MCell provides the basis for running simulations, its capabilities are currently limited in terms of scale, ease-of-use, and interactivity. Those limitations preclude usage scenarios that are critical for scientific advances. Our goal is to create a scientific "Virtual Instrument" from MCell by allowing its users to transparently access Grid resources while being able to steer running simulations. In this paper, we motivate the need for an MCell Virtual Instrument. We then introduce a scheduling strategy that exploits the structure of MCell simulations and uses task priorities to accommodates computational steering. Finally, we describe our innovations and contributions in terms of Grid software design and development
A modular scheduling approach for Grid application development environments by Holly Dail( )

1 edition published in 2002 in English and held by 0 WorldCat member libraries worldwide

In this paper we propose an adaptive scheduling approach designed to improve the performance of parallel applications in Computational Grid environments. A primary contribution of our work is that our design is modular and provides a separation of the scheduler itself from the application-specific components needed for the scheduling process. As part of the scheduler, we have also developed a search procedure which effectively and efficiently identifies desirable schedules. As test cases for our approach, we selected two applications from the class of iterative, mesh-based applications. For each of the test applications, we developed data mappers and performance models. We used a prototype of our approach in conjunction with these application-specific components to perform validation experiments in production Grid environments. Our results show that our scheduler provides significantly better application performance than conventional scheduling strategies. We also show that our scheduler gracefully handles degraded levels of availability of application and Grid resource information. Finally, we demonstrate that the overheads introduced by our methodology are reasonable. This work evolved in the context of the Grid Application Development Software Project (GrADS). Our scheduling approach is designed to be easily integrated with other GrADS program development tools
Resource allocation for steerable parallel parameter searches : an experimental study by Marcio Faerman( )

1 edition published in 2002 in English and held by 0 WorldCat member libraries worldwide

Computational Grids lend themselves well to parameter sweep applications, which consist of independent tasks, each of which calculates results for a separate point in parameter space. However, it is possible for a parameter space to become so large as to pose prohibitive system requirements. In these cases, user-directed steering promises to reduce overall computation time. In this paper, we address an interesting challenge posed by these user-directed searches: how should compute resources be allocated to application tasks as the overall computation is being steered by the user? We present a model for user-directed searches, and then propose a number of resource allocation strategies and evaluate them in simulation. We find that prioritizing the assignments of tasks to compute resources throughout the search can lead to substantial performance improvements. We present experimental results obtained with software developed as part of the Virtual Instrument project, and discuss the impact of our findings on future Virtual Instrument implementations
Application scheduling over supercomputers : a proposal by Walfredo Cirne( )

1 edition published in 1999 in English and held by 0 WorldCat member libraries worldwide

We discuss how Resource Schedulers for Supercomputers can support Application Scheduling without degrading their own measures of performance. Initial results are presented and a proposal for future research is delineated
Application scheduling on the information power grid by Dmitrii Zagorodnov( )

1 edition published in 2000 in English and held by 0 WorldCat member libraries worldwide

One of the compelling reasons for developing the Information Power Grid (IPG) is to provide a platform for more rapid development and execution of simulations and other resource-intensive applications. However, the IPG will ultimately not be successful unless users and application developers can achieve execution performance for their codes. In this paper, we describe a performance-efficient approach to scheduling applications in dynamic multiple-user distributed environments such as the IPG. This approach provides the basis for application scheduling agents called {\bf AppLeS}. We describe the AppLeS methodology and discuss the lessons learned from the development of AppLeS for a variety of distributed applications. In addition, we describe an AppLeS-in-progress currently being developed for NASA's INS2D code, a distributed "parameter sweep" application
Application-Aware Scheduling of a Magnetohydrodynamics Application in the Legion Metasystem( )

1 edition published in 2006 in English and held by 0 WorldCat member libraries worldwide

Computational Grids have become an important and popular computing platform for both scientific and commercial distributed computing communities. However, users of such systems typically find achievement of application execution performance remains challenging. Although Grid infrastructures such as Legion and Globus provide basic resource selection functionality, work allocation functionality, and scheduling mechanisms, applications must interpret system performance information in terms of their own requirements in order to develop performance-efficient schedules. We describe a new high-performance scheduler that incorporates dynamic system information, application requirements, and a detailed performance model in order to create performance efficient schedules. While the scheduler is designed to provide improved performance for a magneto hydrodynamics simulation in the Legion Computational Grid infrastructure, the design is generalizable to other systems and other data-parallel, iterative codes. We describe the adaptive performance model, resource selection strategies, and scheduling policies employed by the scheduler. We demonstrate the improvement in application performance achieved by the scheduler in dedicated and shared Legion environments
Adaptive performance prediction for distributed data-intensive applications by Marcio Faerman( )

1 edition published in 1999 in English and held by 0 WorldCat member libraries worldwide

The computational grid is becoming the platform of choice for large-scale distributed data-intensive applications. Accurately predicting the transfer times of remote data files, a fundamental component of such applications, is critical to achieving application performance. In this paper, we introduce a performance prediction method, ARM (Adaptive Regression Modeling), to determine data transfer times for network-bound distributed data-intensive applications. We demonstrate the effectiveness of the ARM method on two distributed data applications, SARA (Synthetic Aperture Radar Atlas) and SRB (Storage Resource Broker), and discuss how it can be used for application scheduling. Our experiments demonstrate that applying the ARM method to these applications predicted data transfer times in wide-area multi-user grid environments with accuracy of 88% or better
moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.29 (from 0.20 for Grid compu ... to 0.99 for Fran Berma ...)

Grid computing : making the global infrastructure a reality
Alternative Names
Berman, Fran

Berman, Francine.

English (50)

Trash to cash : how businesses can save money and increase profits