Conceptualizing historical organization studies

© 2016 Academy of Management Review. The promise of a closer union between organizational and historical research has long been recognized. However, its potential remains unfulfilled: The authenticity of theory development expected by organization studies and the authenticity of historical veracity required by historical research place exceptional conceptual and empirical demands on researchers. We elaborate the idea of historical organization studies-organizational research that draws extensively on historical data, methods, and knowledge to promote historically informed theoretical narratives attentive to both disciplines. Building on prior research, we propose a typology of four differing conceptions of history in organizational research: History as evaluating, explicating, conceptualizing, and narrating. We identify five principles of historical organization studies-dual integrity, pluralistic understanding, representational truth, context sensitivity, and theoretical fluency-and illustrate our typology holistically from the perspective of institutional entrepreneurship. We explore practical avenues for a creative synthesis, drawing examples from social movement research and microhistory. Historically informed theoretical narratives whose validity derives from both historical veracity and conceptual rigor afford dual integrity that enhances scholarly legitimacy, enriching understanding of historical, contemporary, and future-directed social realities

Effective Compile-Time Analysis for Data Prefetching In Java

The memory hierarchy in modern architectures continues to be a major performance bottleneck. Many existing techniques for improving memory performance focus on Fortran and C programs, but memory latency is also a barrier to achieving high performance in object-oriented languages. Existing software techniques are inadequate for exposing optimization opportunities in object-oriented programs. One key problem is the use of high-level programming abstractions which make analysis difficult. Another challenge is that programmers use a variety of data structures, including arrays and linked structures, so optimizations must work on a broad range of programs. We develop a new unified data-flow analysis for identifying accesses to arrays and linked structures called recurrence analysis. Prior approaches that identify these access patterns are ad hoc, or treat arrays and linked structures independently. The data-flow analysis is intra- and inter-procedural, which is important in Java programs that use encapsulation to hide implementation details. We sho