<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05793342</id>
  <dt>j</dt>
  <an>05793342</an>
  <augroup>
    <au>Nagy, Marius</au>
  </augroup>
  <ti>Locating the median of a tree in real time.</ti>
  <so>Parallel Process. Lett. 19, No. 1, 39-55 (2009).</so>
  <py>2009</py>
  <pu>World Scientific, Singapore</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>median problem</ut>
    <ut>real time</ut>
    <ut>parallelism</ut>
    <ut>synergy</ut>
    <ut>quality-up</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1142/S0129626409000055</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Determining the optimal location of a switching center in a tree network of users is accurately modeled by the median problem. A real-time approach is used in this paper to investigate the dynamics of such a communication network in two cases: (1) a growing tree of nodes associated with equal demand rates, and (2) a stream of corrections that arbitrarily change the demand rates at the nodes. The worst-case analysis performed in both situations clearly demonstrates the importance of parallelism in such real-time paradigms. It is shown that the error generated by the best sequential algorithm in the first case can be arbitrarily large. A synergistic behavior is revealed when the quality-up is investigated in the second case.</ab>
    <rv></rv>
  </abgroup>
</item>