標題: Titlebook: Parallel Processing and Applied Mathematics; 4th International Co Roman Wyrzykowski,Jack Dongarra,Jerzy Wa?niewski Conference proceedings 2 [打印本頁] 作者: Iridescent 時間: 2025-3-21 18:34
書目名稱Parallel Processing and Applied Mathematics影響因子(影響力)
書目名稱Parallel Processing and Applied Mathematics影響因子(影響力)學科排名
書目名稱Parallel Processing and Applied Mathematics網絡公開度
書目名稱Parallel Processing and Applied Mathematics網絡公開度學科排名
書目名稱Parallel Processing and Applied Mathematics被引頻次
書目名稱Parallel Processing and Applied Mathematics被引頻次學科排名
書目名稱Parallel Processing and Applied Mathematics年度引用
書目名稱Parallel Processing and Applied Mathematics年度引用學科排名
書目名稱Parallel Processing and Applied Mathematics讀者反饋
書目名稱Parallel Processing and Applied Mathematics讀者反饋學科排名
作者: 變形 時間: 2025-3-22 00:03 作者: 壓迫 時間: 2025-3-22 02:25 作者: 省略 時間: 2025-3-22 04:48 作者: Hectic 時間: 2025-3-22 12:08
Stanis?aw Gawiejnowicz,Wies?aw Kurc,Lidia PankowskaPatienten mit gest?rter Abwehr sind besonders infektionsgef?hrdet. Art und Ausma? der St?rung (Granulozytopenie, zellul?rer Immundefekt, humoraler Immundefekt) entscheiden, ob sie für bakterielle, virale, parasit?re oder Pilzinfektionen pr?disponiert sind (Tabelle 14-1).作者: PURG 時間: 2025-3-22 13:21 作者: 事先無準備 時間: 2025-3-22 17:34
Marek Tudruj,?ukasz Maskoe observation time was 5 4/12 years (range 4 months-13 years). In all patients surgery was performed by the same orthopedic surgeon (M.R.); perioperative hemostaseologic management and stand-by at the operation were carried out by the same hemostaseologist (E.O.M.).作者: Flatus 時間: 2025-3-22 21:12
Noriyuki Fujimoto,Kenichi Hagiharaund das subtraktive System beschreiben die relative Zusammensetzung von Farben aus drei Grund- oder Prim?rfarben. Das CIE-System hingegen ist ein absolutes System, in dem einer bestimmten Farbe drei numerische Koordinaten in einem Farbmodell zugewiesen werden.作者: Gerontology 時間: 2025-3-23 02:40 作者: 巨大沒有 時間: 2025-3-23 06:49 作者: 移動 時間: 2025-3-23 10:12 作者: 字形刻痕 時間: 2025-3-23 15:50 作者: 我的巨大 時間: 2025-3-23 19:57 作者: 串通 時間: 2025-3-24 01:13
Processing Time and Memory Requirements for Multi-instalment Divisible Job Processingo an arbitrary number of independent tasks. In this work we analyse a new type of communication that can shorten the schedule length and reduce memory requirements. Two types of multi-instalment processing models are taken into account; their influence on processing time and memory requirements is examined.作者: GLOOM 時間: 2025-3-24 05:59
The Performance of Different Communication Mechanisms and Algorithms Used for Parallelization of Molecular Dynamics Codenication algorithms and communication mechanisms were used in parallelization of molecular dynamics code. In is shown that in the case of fast communication hardware well scaling algorithm must be used. Presented data shows that MD code can be also run efficiently on the pentium cluster but low latency communication mechanism must be used.作者: 防止 時間: 2025-3-24 08:24 作者: Host142 時間: 2025-3-24 12:41
Parallel Processing and Applied Mathematics978-3-540-48086-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 厭倦嗎你 時間: 2025-3-24 18:20 作者: insert 時間: 2025-3-24 19:19 作者: LAY 時間: 2025-3-25 00:29
Applications of Virtual Data in the LIGO Experimentmental physical phenomena. Virtual Data is a concept that unifies the view of the data whether it is raw or derived. It provides a new degree of transparency in how data-handling and processing capabilities are integrated to deliver data products to end-users or applications, so that requests for su作者: conceal 時間: 2025-3-25 04:23 作者: capsule 時間: 2025-3-25 07:46 作者: gruelling 時間: 2025-3-25 14:35
A Parallel System Architecture Based on Dynamically Configurable Shared Memory Clusters-time reconfigurable multi-processor clusters; each organized around a local shared memory module placed in a common address space. Each memory module is accessed by a local cluster bus and a common inter-cluster bus. Programs are organized accordingly to their macro dataflow graphs in which tasks a作者: 退出可食用 時間: 2025-3-25 18:44
SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithmne vision applications. In this sense it deals with the peculiarities of systems which combine generic-type processors with Image Acquisition and Processing Boards. The main goal of the algorithm is total processing time reduction; such are the requirements when we deal with automated industrial ins作者: GIBE 時間: 2025-3-25 20:44 作者: Myosin 時間: 2025-3-26 02:46
A Greedy Approach for a Time-Dependent Scheduling Problem problem. In the problem the processing time .. of each job is described by a function of the starting time . of the job, .. = 1+α.., where α. > 0 for . = 0,1, 2,..., . Jobs are non-preemptable and independent, there are neither ready times nor deadlines, and the criterion of optimality is the total作者: Efflorescent 時間: 2025-3-26 06:54 作者: periodontitis 時間: 2025-3-26 09:31 作者: iodides 時間: 2025-3-26 15:14 作者: MOT 時間: 2025-3-26 18:49
Task Scheduling for Dynamically Configurable Multiple SMP Clusters Based on Extended DSC Approachs. A cluster contains processors with data caches connected to a data memory module by an internal cluster bus. Each data memory module is also accessible for a global inter-cluster bus that is available for all processors. Execution of tasks in a processor is done according to a specific macro data作者: Endometrium 時間: 2025-3-26 23:00
Processing Time and Memory Requirements for Multi-instalment Divisible Job Processingo an arbitrary number of independent tasks. In this work we analyse a new type of communication that can shorten the schedule length and reduce memory requirements. Two types of multi-instalment processing models are taken into account; their influence on processing time and memory requirements is e作者: 依法逮捕 時間: 2025-3-27 03:25 作者: Maximize 時間: 2025-3-27 09:10
Evaluation of Parallel Programs by Measurement of Its Granularityel programming the goal of the design process cannot be reduced to optimise a single metrics like for example speed. While evaluating a parallel program a problem specific function of execution time, memory requirements, communication cost, implementation cost, and others have to be taken into consi作者: Generosity 時間: 2025-3-27 13:15
The Performance of Different Communication Mechanisms and Algorithms Used for Parallelization of Molecular Dynamics Codenication algorithms and communication mechanisms were used in parallelization of molecular dynamics code. In is shown that in the case of fast communication hardware well scaling algorithm must be used. Presented data shows that MD code can be also run efficiently on the pentium cluster but low late作者: GREG 時間: 2025-3-27 13:49
FEM Computations on Clusters Using Different Models of Parallel Programminginvestigation of the package performance on the ACCORD cluster, which this year was built in the Institute of Mathematics and Computer Science of this University. At present, ACCORD contains 18 Pentium III 750 MHz processors, or 9 SMP nodes, connected both by the fast MYRINET network and standard Fa作者: cluster 時間: 2025-3-27 21:20
Viktor K. Decyk,Dean E. Daugerations of vitamin K-dependent coagulation factors, i.e., prothrombin, and contact factors [1, 2]. The capacity of newborn plasma to generate thrombin is decreased to 30–50% of adult values [3, 4]. In addition, alpha.-macroglobulin (α.-M) has been suggested as a major anticoagulant protein in infancy
