kth.sePublications
Change search
Refine search result
1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Doroshenko, Anatoly
    et al.
    Institute of Software Systems, National Academy of Sciences of Ukraine, Kiev 252187, Ukraine.
    Thorelli, Lars-Erik
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Vlassov, Vladimir
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Coordination models and facilities could be parallel software accelerators1999In: HIGH-PERFORMANCE COMPUTING AND NETWORKING, PROCEEDINGS, Berlin: Springer Berlin/Heidelberg, 1999, p. 1219-1222Conference paper (Refereed)
    Abstract [en]

     A  new  coordination  model  is  constructed  for  distributed shared  memory parallel programs.  It  exploits typing of shared resources and  formal specification of a  priori known  synchronization constraints.

  • 2.
    Thorelli, Lars-Erik
    et al.
    KTH, Superseded Departments (pre-2005), Microelectronics and Information Technology, IMIT.
    Vlassov, Vladimir
    KTH, Superseded Departments (pre-2005), Microelectronics and Information Technology, IMIT.
    An Approach to Composing Parallel Programs2001In: PARALLEL COMPUTING TECHNOLOGIES / [ed] Malyshkin, V, Berlin: Springer Berlin/Heidelberg, 2001, p. 371-378Conference paper (Refereed)
    Abstract [en]

    Principles  for  coordination  and  composition  of  parallel/distributed programs  are  discussed.  We  advocate  a  synchronizing  shared  memory  model (EDA) for coordination and an algebraic approach to building programs using a linking language (LL) based on module composition, restriction and renaming. A prototype system ErlEda illustrating these principles is described. The system uses   the   concurrent   programming   language   Erlang   and   its   distributed environment as a basis. We illustrate the approach using the Dirichlet problem.

  • 3.
    Vlassov, Vladimir
    et al.
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Ahmed, Hallo
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Thorelli, Lars-Erik
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    mEDA-2: An extension of PVM1995In: Parallel Computing Technologies, Berlin: Springer Berlin/Heidelberg, 1995, p. 288-293Conference paper (Refereed)
    Abstract [en]

    This  article  presents  mEDA-2,  an  extension  to  PVM  which provides  Virtual  Shared  Memory,  VSM,  for  inter-task  communication and synchronization, mEDAl2  consists of functions to access  VSM  and a daemon to manage parallel program termination. Access to VSM is based on  the  semantics  of the  EDA  model.  The  aim  of  developing  mEDA-2 was  to facilitate construction  of parallel programs  in  PVM  by providing a  unified  approach  to message  passing  and  shared  memory models.

  • 4.
    Vlassov, Vladimir
    et al.
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Ahmed, Hallo
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Thorelli, Lars-Erik
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Ayani, Rassul
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    A simulation platform for multi-threaded architectures1996In: Proceedings of the Fourth International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1996. MASCOTS '96, 1996, p. 102-108Conference paper (Refereed)
    Abstract [en]

    Simulation is a powerful tool for studying behavior of novel architectures and improving their performance. However the time, effort and resources invested in developing a reliable simulator with the required level of detail may become prohibitively large. We present a simulation platform specifically designed to simulate the class of multithreaded architectures. The most important features of this simulator are its flexibility and ease of use. The simulation model provides the user with a wide range of design criteria, architectural parameters and workload characteristics. The simulation platform includes several tools, such as: an experiment planner, an interface to Matlab for processing and displaying results, and an interface to PVM for the execution of independent experiments in parallel. The simulation model is validated by comparison of analytical and experimental results.

  • 5.
    Vlassov, Vladimir
    et al.
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Ayani, Rassul
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Thorelli, Lars-Erik
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Modeling and Simulation of Multithreaded Architectures1997In: Simulation (San Diego, Calif.), ISSN 0037-5497, E-ISSN 1741-3133, ISSN 0037-5497, Vol. 68, no 4, p. 219-230Article in journal (Refereed)
    Abstract [en]

    Multithreaded architectures are widely used for, among other things, hiding long memory latency. In such an architecture, a number of threads are allocated to each Processing Element (PE), and whenever a running thread becomes suspended, the PE switches to the next ready thread. We have developed a simulation platform, MTASim, that can be used to test and evaluate various policies and parameters of a multithreaded computer. The most important features of the MTASim are its flexibility and its ease of use. The MTASim model is based on finite state machines and can be easily modified and expanded. The simulation platform includes an experimental planner, an interface to PVM for the execution of independent experiments in parallel, and an interface to Matlab for processing and displaying results. The MTASim has been used to, among other things, determine the optimal number of threads and to evaluate various prefetching strategies and thread replacement algorithms.

  • 6.
    Vlassov, Vladimir
    et al.
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Thorelli, Lars-Erik
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    A synchronizing shared memory: Model and programming implementation1997In: RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE / [ed] Bubak, M; Dongarra, J; Wasniewshi, J, Berlin: Springer Berlin/Heidelberg, 1997, p. 159-166Conference paper (Refereed)
    Abstract [en]

    In  this  article  we  concentrate   on  implementation  issues  of  a  new shared-memory programming model, mEDA, on top of PVM. The main goal of this research is to provide a flexible, effective and relatively  simple model of in- ter-task communication  and synchronization  via synchronizing shared  memory.

  • 7.
    Vlassov, Vladimir
    et al.
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Thorelli, Lars-Erik
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Analytical models of multithreading with data prefetching1996In: Euro-Par'96 Parallel Processing: Proceedings, Volume II / [ed] Luc Bougé, Pierre Fraigniaud, Anne Mignotte and Yves Robert, Springer Berlin/Heidelberg, 1996, p. 714-723Conference paper (Refereed)
    Abstract [en]

    A combination of multithreading with prefetching allows increased efficiency of large-scale multiprocessors. In this paper, we evaluate two prefetching techniques in multi-threaded architectures: switch-on-prefetch and run-on-prefetch. We present two basic analytical models of multithreading with prefetching, which allow rough performance prediction on the first stages of top-down system design. The first model is the first-order approximation for efficiency of multi-threaded architectures with prefetching. The second model is a queuing network of the architecture.

  • 8.
    Vlassov, Vladimir
    et al.
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Thorelli, Lars-Erik
    KTH, Superseded Departments (pre-2005), Teleinformatics.
    Synchronizing communication primitives for a shared memory programming model1998In: Euro-Par’98 Parallel Processing / [ed] David Pritchard and Jeff Reeve, Berlin: Springer Berlin/Heidelberg, 1998, p. 682-687Conference paper (Refereed)
    Abstract [en]

    In this  article  we concentrate on semantics  of operations  on synchronizing  shared  memory  that  provide  useful  primitives  for shared memory access  and update.  The  operations  are  a  part  of a  new  shared- memory  programming  model  called  mEDA.  The  main  goal  of  this  re- search  is  to  provide  a  flexible,   effective  and  relatively  simple  model of inter-process  communication  and  synchronization  via  synchronizing shared  memory.

1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf