Remapping Performance

Remapping Performance

Benefits and challenges of performance in cross-disciplinary social initiatives
Through most of history, performance has exceeded aesthetic frames. Richard
Schechner, a founder of the field of performance studies, noted, “Deep in Asian, ...

Author: Jan Cohen-Cruz

Publisher: Springer

ISBN: 9781137366412

Category: Performing Arts

Page: 240

View: 924

Completing a trilogy of works by Jan Cohen-Cruz, Remapping Performance focuses on the work of artists and experts who collaborate across fields to address social issues. The book explores work of a range of artists who employ artistic training, methodologies and mind-sets in their work with experts from other sectors such as medicine and healthcare and from other disciplines, to draw an expanded map of performance platforms including university/ community partnerships, neighbourhood-bases, and cultural diplomacy. Case studies include ArtSpot Productions/Mondo Bizarro's Cry You One about climate change in southern Louisiana, incorporating theatrics and organizing; Michael Rohd/Sojourn Theatre's social and civic practices; Anne Basting's University of Wisconsin-Milwaukee-based integration of performance and creative aging; and the collaborative cultural diplomacy experiment, smARTpower. Short companion pieces add expertise from Helen Nicholson, Todd London, Julie Thompson Klein, Nancy Cantor, Maria Rosario Jackson, and Penny Von Eschen. Jan Cohen-Cruz ends with suggestions for fully integrating performance in cross-sector initiatives. This latest book by a leading figure in engaged/ applied theatre and performance builds on its predecessors by offering a future-oriented perspective, a vision of art and performance interacting with a range of social sectors and with an emphasis on HE in such partnerships, and will be a 'must-read' for all students and scholars working in this field.
Categories: Performing Arts

Statistical Methodologies for the Control of Dynamic Remapping

Statistical Methodologies for the Control of Dynamic Remapping

In the fixed interval policy , we plotted performance against m , the fixed number
of steps between remappings . The number of steps between remappings has no
meaning when no remapping is done , the performance obtained when no ...

Author: Institute for Computer Applications in Science and Engineering

Publisher:

ISBN: NASA:31769000674971

Category:

Page: 38

View: 852

Categories:

Scientific and Technical Aerospace Reports

Scientific and Technical Aerospace Reports

The fundamental problem of balancing the expected remapping performance
gain against the delay cost was addressed . Stochastic dynamic programming is
used to show that the remapping decision policy minimizing the expected
running ...

Author:

Publisher:

ISBN: OSU:32435060171089

Category: Aeronautics

Page:

View: 705

Lists citations with abstracts for aerospace related reports obtained from world wide sources and announces documents that have recently been entered into the NASA Scientific and Technical Information Database.
Categories: Aeronautics

Dynamic Remapping Decisions in Multi phase Parallel Computations

Dynamic Remapping Decisions in Multi phase Parallel Computations

identify an optimal remapping decision policy for a two - phase model . Optimal
model performance gives us a baseline we use to study the sensitivity of model
performance to the non - estimation of remapping's costs and gains .

Author: Institute for Computer Applications in Science and Engineering

Publisher:

ISBN: NASA:31769000675390

Category:

Page: 48

View: 715

Categories:

Creative Practice Ethnographies

Creative Practice Ethnographies

In Remapping Performance, 3–21. London: Palgrave Macmillan. ——— (ed.).
2015b. Remapping Performance: Common Ground, Uncommon Partners.
Springer. ———. 2012. Engaging Performance: Theatre as Call and Response.

Author: Larissa Hjorth

Publisher: Lexington Books

ISBN: 9781498572132

Category: Social Science

Page: 200

View: 490

Creative Practice Ethnographies focuses on the intersection of creative practice and ethnography and offers new ways to think about the methods, practice, and promise of research in contemporary interdisciplinary contexts. How does creative practice inform new ways of doing ethnography and vice versa? What new forms of expression and engagement are made possible as a result of these creative synergies? By addressing these questions, the authors highlight the important roles that ethnography and creative practice play in socially impactful research. This book is aimed at interdisciplinary researchers, scholars, and students of art, design, sociology, anthropology, games, media, education, and cultural studies.
Categories: Social Science

Compiling Parallel Loops for High Performance Computers

Compiling Parallel Loops for High Performance Computers

Partitioning, Data Assignment and Remapping David E. Hudak, Santosh G.
Abraham. used to reduce data sharing between processors (Fig.4.8). If a linearly
varying computational structure is present, a cyclic partition will be used to
provide ...

Author: David E. Hudak

Publisher: Springer Science & Business Media

ISBN: 0792392833

Category: Computers

Page: 159

View: 138

4. 2 Code Segments . . . . . . . . . . . . . . . 96 4. 3 Determining Communication Parameters . 99 4. 4 Multicast Communication Overhead · 103 4. 5 Partitioning . . . . . . · 103 4. 6 Experimental Results . 117 4. 7 Conclusion. . . . . . . · 121 5 COLLECTIVE PARTITIONING AND REMAPPING FOR MULTIPLE LOOP NESTS 125 5. 1 Introduction. . . . . . . . . 125 5. 2 Program Enclosure Trees. . 128 5. 3 The CPR Algorithm . . 132 5. 4 Experimental Results. . 141 5. 5 Conclusion. . 146 BIBLIOGRAPHY. 149 INDEX . . . . . . . . 157 LIST OF FIGURES Figure 1. 1 The Butterfly Architecture. . . . . . . . . . 5 1. 2 Example of an iterative data-parallel loop . . 7 1. 3 Contiguous tiling and assignment of an iteration space. 13 2. 1 Communication along a line segment. . . 24 2. 2 Access pattern for the access offset, (3,2). 25 2. 3 Decomposing an access vector along an orthogonal basis set of vectors. . . . . . . . . . . . . . . . . . . 26 2. 4 An analysis of communication patterns. 29 2. 5 Decomposing a vector along two separate basis sets of vectors. 31 2. 6 Cache lines aligning with borders. 33 2. 7 Cache lines not aligned with borders. 34 2. 8 nh is the difference of nd and nb. 42 2. 9 nh is the sum of nd and nb. 42 2. 10 The ADAPT system. 44 2. 11 Code segment used in experiments. . 46 2. 12 Execution rates for various partitions. 47 2. 13 Execution time of partitions on Multimax. 48 2. 14 Performance increase as processing power increases. 49 2. 15 Percentage miss ratios for various aspect ratios and line sizes.
Categories: Computers

Performance Transformations for Irregular Applications

Performance Transformations for Irregular Applications

Sparse Matrix A inspector overhead NOT remapped low remapped high # of
indirect executor mem refs locality high low low ... error and the necessity of
changes to the PETSC SOR implementation due to existing performance
optimizations .

Author: Michelle Mills Strout

Publisher:

ISBN: UCSD:31822009432915

Category:

Page: 380

View: 812

Categories:

Remapping World Cinema

Remapping World Cinema

"Covering a broad scope, this collection examines the cinemas of Europe, East Asia, India, Africa and Latin America, and will be of interest to scholars and students of film studies, cultural studies and postcolonial studies, as well as to ...

Author: Stephanie Dennison

Publisher: Wallflower Press

ISBN: 1904764622

Category: Performing Arts

Page: 203

View: 876

"Covering a broad scope, this collection examines the cinemas of Europe, East Asia, India, Africa and Latin America, and will be of interest to scholars and students of film studies, cultural studies and postcolonial studies, as well as to film enthusiasts keen to explore a wider range of world cinema."--Jacket.
Categories: Performing Arts

Distributed Simulation 1989

Distributed Simulation  1989

By contrast , dynamic remapping exploits our a priori understanding of extreme
coarse and fine grained partitions , even if we cannot a priori predict performance
measures . 4 . 2 Land - Battle Simulation We simulate scenarios on a 128 by 128
 ...

Author: Society for Computer Simulation

Publisher: Society for Computer Simulation

ISBN: STANFORD:36105033130696

Category: Digital computer simulation

Page: 204

View: 627

Categories: Digital computer simulation

Fourth International Conference on High Performance Computing

Fourth International Conference on High Performance Computing

g10 -- Remapping *- 3.0 -> f o =l 10 16 24 32 40 48 56 64 16 24 32 40 48 56 64
Number of processors Number of processors Figure 4: Execution times for the
three levels of adaption. be predicted accurately before a load balancing phase
to ...

Author:

Publisher: IEEE Computer Society

ISBN: 0818680679

Category: Computers

Page: 541

View: 185

This text on high-performance computing includes coverage of the topics: applications; I/O and compilers; scientific computing; data and file management; interconnection networks; compilers; image and signal processing; distributed systems; algorithms; architecture; and parallel programming.
Categories: Computers

HPCA

HPCA

The Seventh International Symposium on High-Performance Computer
Architecture : Proceedings, 19-24 January ... ( b ) remapping parative
performance results for our application benchmark suite . emphasize the
performance differences ...

Author:

Publisher: IEEE

ISBN: UOM:39015047510204

Category: Computers

Page: 318

View: 521

Topics covered in this text include: microarchitecture; memory architectures; multiprocessor systems; code generation techniques; energy and thermal management; prediction techniques; application-specific designs; performance modelling and analysis; and latency tolerance techniques.
Categories: Computers

Automated Parallelization of Discrete State space Generation

Automated Parallelization of Discrete State space Generation

First we look at performance when balancing is performed on the memory load .
We see that • performance at the highest remapping frequency is worse than less
aggressive remapping frequencies . This is due to shorter periods of execution ...

Author: David M. Nicol

Publisher:

ISBN: NASA:31769000711435

Category: Parallel processing (Electronic computers)

Page: 19

View: 294

We consider the problem of generating a large state-space in a distributed fashion. Unlike previously proposed solutions that partition the set of reachable states according to a hashing function provided by the user, we explore heuristic methods that completely automate the process. The first step is an initial random walk through the state space to initialize a search tree, duplicated in each processor. Then, the reachability graph is built in a distributed way, using the search tree to assign each newly found state to classes assigned to the available processors. Furthermore, we explore two remapping criteria that attempt to balance memory usage or future workload, respectively. We show how the cost of computing the global snapshot required for remapping will scale up for system sizes in the foreseeable future. An extensive set of results is presented to support our conclusions that remapping is extremely beneficial.
Categories: Parallel processing (Electronic computers)

Research Conducted at the Institute for Computer Applications in Science and Engineering in Applied Mathematics Numerical Analysis and Computer Science

Research Conducted at the Institute for Computer Applications in Science and Engineering in Applied Mathematics  Numerical Analysis and Computer Science

Fundamentally , it is necessary to balance the expected remapping performance
gain against the delay cost of remapping . This paper treats this problem formally
by constructing a probabilistic model of a computation with at most two phases .

Author:

Publisher:

ISBN: NASA:31769000675895

Category:

Page: 75

View: 502

Categories:

Computers Control Information Theory

Computers  Control   Information Theory

We study the issue of deciding when to invoke a global load remapping
mechanism . Such a decision policy must effectively weigh the costs of
remapping against the performance benefits . We treat this problem by
constructing two analytic ...

Author:

Publisher:

ISBN: IND:30000100120314

Category: Computers

Page:

View: 374

Categories: Computers

Journal of Thermophysics and Heat Transfer

Journal of Thermophysics and Heat Transfer

In Figure 6 , we examine the performance of various remapping policies on a
simulation partitioned using recursive inertial bisection . These results show that
SAR performs better than the fixed - interval remapping , but also that , for this ...

Author:

Publisher:

ISBN: UOM:39015036259490

Category: Heat

Page:

View: 197

Categories: Heat

Proceedings of the First International Conference on Massively Parallel Computing Systems MPCS May 2 6 1994 Ischia Italy

Proceedings of the First International Conference on Massively Parallel Computing Systems  MPCS   May 2 6  1994  Ischia  Italy

The goal was a low - cost plug - in board with very high performance on these
algorithms . The approach of 1 ... The C40 achieves high data remapping
performance in spite of having a nominally much lower bandwidth than the ASIC
array .

Author:

Publisher: IEEE Computer Society

ISBN: 0818663227

Category: Multiprocessors

Page: 655

View: 806

Categories: Multiprocessors

Proceedings

Proceedings

Dense Matrix-Matrix Product This section examines the performance benefits of
tile remapping for matrix-matrix product, and compares the results to software tile
copying. Because Impulse places alignment restrictions on remapping, ...

Author:

Publisher: IEEE Computer Society

ISBN: 0769500048

Category: Computers

Page: 324

View: 955

Contains 37 technical papers and overviews of five workshops, but none of the keynote addresses nor summaries of the panel sessions. Considers performance enhancement, simultaneous multi-threading, memory systems, instruction scheduling and speculation, cache coherence, SMP clusters, cache and input"
Categories: Computers

Proceedings Sixth International Symposium on High Performance Computer Architecture HPCA 6

Proceedings  Sixth International Symposium on High Performance Computer Architecture  HPCA 6

Remapping Controller bank controller bus Bank Controller DRAM Bank VECTOR
ACCESS UNIT 1 2 . ... PVA design via gate - level synthesis and simulation , and
have evaluated its performance via functional simulation and formal analysis .

Author: IEEE Computer Society. Technical Committee on Computer Architecture

Publisher: IEEE

ISBN: 0769505503

Category: Computers

Page: 420

View: 195

Sponsored by the IEEE (The Institute of Electrical and Electronics Engineers) Technical Committee on Computer Architecture, HPCA-6 was held in January 2000 in Toulouse, France. The session opened with a keynote address on Relaxing Constraints: Thoughts on the Evolution of Computer Architecture by
Categories: Computers