Parallel Language

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 89949 Experts worldwide ranked by ideXlab platform

Marie Källkvist - One of the best experts on this subject based on the ideXlab platform.

  • Global flows in local Language planning: articulating Parallel Language use in Swedish university policies
    Current Issues in Language Planning, 2015
    Co-Authors: Francis M. Hult, Marie Källkvist
    Abstract:

    In this paper, the Language policies of three Swedish universities are examined as instances of Language planning in local contexts. Although Sweden has the national Language Act of 2009 (SFS 2009:600) as well as a general Higher Education Ordinance (SFS 1993:100; SFS 2014:1096), Language planning for higher education is left to the purview of individual institutions. Since Language planning in local contexts often involves the intersection of locally situated communication needs and wider circulating ideologies, the present study considers how national Language planning goals are taken up and reinterpreted by higher education institutions. In particular, the focus is on universities whose policies are framed using the Nordic Language planning concept of “Parallel Language use”, which has emerged over the last 20 years as a way to theorize a sociopolitical balance between English and Scandinavian Languages. The concept indexes a range of issues related to the relative position of Swedish and English, incl...

  • Discursive mechanisms and human agency in Language policy formation: negotiating bilingualism and Parallel Language use at a Swedish university
    International Journal of Bilingual Education and Bilingualism, 2014
    Co-Authors: Marie Källkvist, Francis M. Hult
    Abstract:

    In the wake of the enactment of Sweden's Language Act in 2009 and in the face of the growing presence of English, Swedish universities have been called upon by the Swedish Higher Education Authority to craft their own Language policy documents. This study focuses on the discursive negotiation of institutional bilingualism by a Language policy committee at one Swedish university during the process of developing a draft Language policy. Following an ethnographic/discourse analytic orientation to Language policy and planning research, data were collected during Language policy committee meetings at the university. Using nexus analysis, circulating discourses are mapped and analyzed, with a specific focus on how these discourses were negotiated through mediated actions during committee meeting interaction and then entextualized in a draft policy. Analysis reveals how ‘bilingualism’ became reinterpreted as ‘Parallel Language use,’ a concept developed and used in Nordic Language planning over the past 15 years....

Francis M. Hult - One of the best experts on this subject based on the ideXlab platform.

  • Global flows in local Language planning: articulating Parallel Language use in Swedish university policies
    Current Issues in Language Planning, 2015
    Co-Authors: Francis M. Hult, Marie Källkvist
    Abstract:

    In this paper, the Language policies of three Swedish universities are examined as instances of Language planning in local contexts. Although Sweden has the national Language Act of 2009 (SFS 2009:600) as well as a general Higher Education Ordinance (SFS 1993:100; SFS 2014:1096), Language planning for higher education is left to the purview of individual institutions. Since Language planning in local contexts often involves the intersection of locally situated communication needs and wider circulating ideologies, the present study considers how national Language planning goals are taken up and reinterpreted by higher education institutions. In particular, the focus is on universities whose policies are framed using the Nordic Language planning concept of “Parallel Language use”, which has emerged over the last 20 years as a way to theorize a sociopolitical balance between English and Scandinavian Languages. The concept indexes a range of issues related to the relative position of Swedish and English, incl...

  • Discursive mechanisms and human agency in Language policy formation: negotiating bilingualism and Parallel Language use at a Swedish university
    International Journal of Bilingual Education and Bilingualism, 2014
    Co-Authors: Marie Källkvist, Francis M. Hult
    Abstract:

    In the wake of the enactment of Sweden's Language Act in 2009 and in the face of the growing presence of English, Swedish universities have been called upon by the Swedish Higher Education Authority to craft their own Language policy documents. This study focuses on the discursive negotiation of institutional bilingualism by a Language policy committee at one Swedish university during the process of developing a draft Language policy. Following an ethnographic/discourse analytic orientation to Language policy and planning research, data were collected during Language policy committee meetings at the university. Using nexus analysis, circulating discourses are mapped and analyzed, with a specific focus on how these discourses were negotiated through mediated actions during committee meeting interaction and then entextualized in a draft policy. Analysis reveals how ‘bilingualism’ became reinterpreted as ‘Parallel Language use,’ a concept developed and used in Nordic Language planning over the past 15 years....

Tatiana Shpeisman - One of the best experts on this subject based on the ideXlab platform.

  • safe nondeterminism in a deterministic by default Parallel Language
    Symposium on Principles of Programming Languages, 2011
    Co-Authors: Robert L Bocchino, Stephen T Heumann, Nima Honarmand, Sarita V Adve, Vikram Adve, Adam Welc, Tatiana Shpeisman
    Abstract:

    A number of deterministic Parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound search, remains an open question. We present a Language together with a type and effect system that supports nondeterministic computations with a deterministic-by-default guarantee: nondeterminism must be explicitly requested via special Parallel constructs (marked nd), and any deterministic construct that does not execute any nd construct has deterministic input-output behavior. Moreover, deterministic Parallel constructs are always equivalent to a sequential composition of their constituent tasks, even if they enclose, or are enclosed by, nd constructs. Finally, in the execution of nd constructs, interference may occur only between pairs of accesses guarded by atomic statements, so there are no data races, either between atomic statements and unguarded accesses (strong isolation) or between pairs of unguarded accesses (stronger than strong isolation alone). We enforce the guarantees at compile time with modular checking using novel extensions to a previously described effect system. Our effect system extensions also enable the compiler to remove unnecessary transactional synchronization. We provide a static semantics, dynamic semantics, and a complete proof of soundness for the Language, both with and without the barrier removal feature. An experimental evaluation shows that our Language can achieve good scalability for realistic Parallel algorithms, and that the barrier removal techniques provide significant performance gains.

  • POPL - Safe nondeterminism in a deterministic-by-default Parallel Language
    Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11, 2011
    Co-Authors: Robert L Bocchino, Stephen T Heumann, Nima Honarmand, Sarita V Adve, Vikram Adve, Adam Welc, Tatiana Shpeisman
    Abstract:

    A number of deterministic Parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound search, remains an open question. We present a Language together with a type and effect system that supports nondeterministic computations with a deterministic-by-default guarantee: nondeterminism must be explicitly requested via special Parallel constructs (marked nd), and any deterministic construct that does not execute any nd construct has deterministic input-output behavior. Moreover, deterministic Parallel constructs are always equivalent to a sequential composition of their constituent tasks, even if they enclose, or are enclosed by, nd constructs. Finally, in the execution of nd constructs, interference may occur only between pairs of accesses guarded by atomic statements, so there are no data races, either between atomic statements and unguarded accesses (strong isolation) or between pairs of unguarded accesses (stronger than strong isolation alone). We enforce the guarantees at compile time with modular checking using novel extensions to a previously described effect system. Our effect system extensions also enable the compiler to remove unnecessary transactional synchronization. We provide a static semantics, dynamic semantics, and a complete proof of soundness for the Language, both with and without the barrier removal feature. An experimental evaluation shows that our Language can achieve good scalability for realistic Parallel algorithms, and that the barrier removal techniques provide significant performance gains.

Hans P. Zima - One of the best experts on this subject based on the ideXlab platform.

  • Data-Parallel Language Features for Sparse Codes
    Languages Compilers and Run-Time Systems for Scalable Computers, 1996
    Co-Authors: Manuel Ujaldón, E.l. Zapata, Barbara Chapman, Hans P. Zima
    Abstract:

    This paper proposes a new approach to improve data-Parallel Languages in the context of sparse and irregular computation. We analyze the capabilities of High Performance Fortran (HPF) and Vienna Fortran, and identify a set of problems leading to sub-optimal Parallel code generation for such computations on distributed-memory machines. Finally, we propose extensions to the data distribution facilities in Vienna Fortran which address these issues and provide a powerful mechanism for efficiently expressing sparse algorithms.

  • IPPS - New data-Parallel Language features for sparse matrix computations
    Proceedings of 9th International Parallel Processing Symposium, 1
    Co-Authors: Manuel Ujaldón, E.l. Zapata, Barbara Chapman, Hans P. Zima
    Abstract:

    High level data Parallel Languages such as Vienna Fortran and High Performance Fortran (HPF) have been introduced to allow the programming of massively Parallel distributed memory machines at a relatively high level of abstraction, based on the single program multiple data (SPMD) paradigm. Their main features include mechanisms for expressing the distribution of data across the processors of a machine. The paper introduces additional Language functionality to allow the efficient processing of sparse matrix codes. It introduces methods for the representation and distribution of sparse matrices, which forms a powerful mechanism for storing and manipulating sparse matrices able to be efficiently implemented on massively Parallel machines. >

Huibiao Zhu - One of the best experts on this subject based on the ideXlab platform.

  • UTP - Towards a pomset semantics for a shared-variable Parallel Language
    Unifying Theories of Programming, 2010
    Co-Authors: Yongxin Zhao, Xu Wang, Huibiao Zhu
    Abstract:

    In this paper we present a pomset semantics for a shared-variable Parallel Language which is an extension of the one studied by Brookes in [5]. The pomset semantics lifts the transition trace semantics to the non-interleaving setting, where Parallel events in a pomset transition trace are labeled by conditionally independent actions. Most of the important laws from the interleaving setting also hold in the noninterleaving setting. Similarities and differences with other related works are discussed.