Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    [S.l.] : American Institute of Physics (AIP)
    Journal of Applied Physics 57 (1985), S. 3508-3510 
    ISSN: 1089-7550
    Source: AIP Digital Archive
    Topics: Physics
    Notes: Measurements are reported on the dc and pulsed magnetic properties of three MetglasRa) alloys in the as-cast, box annealed, and rewound conditions. Alloys 2605SC, 2605S-2 and 2605CO were evaluated for possible use in an induction linear accelerator. It is found that the 2605SC and 2605S-2 give similar good performance and the 2605CO slightly less good performance in this application in the microsecond pulse-width region.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    The journal of supercomputing 1 (1988), S. 395-408 
    ISSN: 1573-0484
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Granularity is a well known concept in parallel processing. While intuitively, the distinction between coarse-grain and fine-grain paralellism is clear, there is no rigorous definition. This paper develops two notions of granularity, each defined formally and represented by a single rational number. The two notions are compared and contrasted with each other and with previously proposed definitions of granularity.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    International journal of parallel programming 14 (1985), S. 107-122 
    ISSN: 1573-7640
    Keywords: Data flow scheme ; abstract complexity measure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract For common data flow schemes, the number of copies of tokens made during a computation is shown to be a Blum complexity measure.(1) Results from abstract complexity theory (see Ref. 2) then hold for the copy measure, indicating, for example, that any implementation of a data flow processor will be constrained by its ability to copy tokens. The copy measure is a natural measure of complexity for data flow computations, and is distinct from the usual time or space measures. The result is generalized to a wider class of data flow schemas, including those with an apply operator. An example is also given of a data flow scheme which makes no copies.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...