標(biāo)題: Titlebook: Advances in Computer Systems Architecture; 11th Asia-Pacific Co Chris Jesshope,Colin Egan Conference proceedings 2006 Springer-Verlag Berli [打印本頁(yè)] 作者: ANNOY 時(shí)間: 2025-3-21 16:26
書目名稱Advances in Computer Systems Architecture影響因子(影響力)
書目名稱Advances in Computer Systems Architecture影響因子(影響力)學(xué)科排名
書目名稱Advances in Computer Systems Architecture網(wǎng)絡(luò)公開度
書目名稱Advances in Computer Systems Architecture網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Computer Systems Architecture被引頻次
書目名稱Advances in Computer Systems Architecture被引頻次學(xué)科排名
書目名稱Advances in Computer Systems Architecture年度引用
書目名稱Advances in Computer Systems Architecture年度引用學(xué)科排名
書目名稱Advances in Computer Systems Architecture讀者反饋
書目名稱Advances in Computer Systems Architecture讀者反饋學(xué)科排名
作者: ARCHE 時(shí)間: 2025-3-21 22:41
978-3-540-40056-1Springer-Verlag Berlin Heidelberg 2006作者: 太空 時(shí)間: 2025-3-22 03:52
Advances in Computer Systems Architecture978-3-540-40058-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 天空 時(shí)間: 2025-3-22 05:22
Mathematische Modelle einer Str?mung techniques into a coordination language: stream processing and various forms of subtyping. The talk will present the organisation of SNet, its major type inferencing algorithms and will briefly discuss the current state of implementation and possible applications.作者: Rotator-Cuff 時(shí)間: 2025-3-22 11:58 作者: 縫紉 時(shí)間: 2025-3-22 14:56
Esteban Ferrer,Soledad Le Claincheever, this is preventing steep software challenges – both in the migration of application software and in the adaptation of system software..In this talk, we discuss the challenges as well as opportunities facing software technology in the era of the emerging multi-core chips. We review the software作者: NICE 時(shí)間: 2025-3-22 18:29 作者: 進(jìn)取心 時(shí)間: 2025-3-22 23:15 作者: 中國(guó)紀(jì)念碑 時(shí)間: 2025-3-23 03:11
Mathematische Modelle einer Str?munglicies, and avoids the performance overheads of prior policies. The proposed policy reduces leakage energy by more than 92% with only less than 0.3% performance overhead on average. The key to this new on-demand policy is to use branch prediction information for the wakeup prediction. In the propose作者: larder 時(shí)間: 2025-3-23 07:56
https://doi.org/10.1007/978-3-642-24378-3en demonstrated on Imagine. However the research whether scientific computing applications are suited for Imagine is open. In this paper, we studied some key issues of scientific computing applications mapping to Imagine, and present the experimental results of some representative scientific computi作者: 省略 時(shí)間: 2025-3-23 10:48 作者: remission 時(shí)間: 2025-3-23 14:13
https://doi.org/10.1007/978-3-662-63265-9post-link optimizer to reduce cache misses, improve branch prediction and minimize other performance bottlenecks. This paper discusses different instruction hints available on modern processor architectures and shows the potential performance impact on many benchmark programs. Some hints can be effe作者: cancellous-bone 時(shí)間: 2025-3-23 19:17
Josephson Qubits as Probes of 1/, Noise,ems. With nearly the entire operating system running as a set of user-mode servers and drivers atop a minimal kernel, the system is fully compartmentalized..By moving most of the code to unprivileged user-mode processes and restricting the powers of each one, we gain proper fault isolation and limit作者: vasospasm 時(shí)間: 2025-3-24 01:36 作者: 同步信息 時(shí)間: 2025-3-24 03:57 作者: CRUMB 時(shí)間: 2025-3-24 08:19 作者: 拒絕 時(shí)間: 2025-3-24 13:02 作者: 沐浴 時(shí)間: 2025-3-24 16:24
The CFO’s Mission and Aspirationstiprocessors based on arrays of microthreaded microprocessors as these processors directly implement the concepts introduced in the language. However, it is more general than that and is being used in other projects as an interface defining dynamic concurrency. Ideally, a program written in .TC is a作者: 沒花的是打擾 時(shí)間: 2025-3-24 19:43
https://doi.org/10.1007/978-1-4302-3757-0 1GHz and thus affect the performance of sequential code sequences. We propose dealing with these delays through a dynamic functional unit chaining approach. We study the performance benefits of a superscalar, out-of-order processor augmented with a two-by-two array of ALUs interconnected by a fast,作者: isotope 時(shí)間: 2025-3-24 23:43
Budgeting as a Control Mechanismn improved algorithm for identifying and constructing the traces in a binary program and present a trace-based optimisation for reducing leakage energy in data caches. Our experimental results using Mediabench benchmarks show that good leakage energy savings can be achieved at the cost of some small作者: Endoscope 時(shí)間: 2025-3-25 03:47
Procedures for Quintessential Tasksrs. However, this also means that computers will run an application at full speed only if that application is parallelized. To take advantage of more than a fraction of compute resource on a die, we develop a compiler to parallelize a common and powerful programming paradigm, namely reduction. Our g作者: corporate 時(shí)間: 2025-3-25 09:23 作者: 土坯 時(shí)間: 2025-3-25 13:47
Frank Van Reeth,Rudi Welter,Eddy Flerackerstions is an important phase for implementing an application on an extensible processor with a reconfigurable functional unit. Custom instructions (CIs) usually are extracted from critical portions of applications. This paper presents approaches for CI generation with respect to the RFU constraints t作者: 阻撓 時(shí)間: 2025-3-25 16:50
Dynamic Analysis-Based Human Animationocessor simulator developed in high level language is useful because of its easily changeable system architecture which includes application specific instruction sets and functions. However, there is a problem in processing speed that both PCs and workstations provide insufficient performance for th作者: 藝術(shù) 時(shí)間: 2025-3-25 21:41 作者: Incommensurate 時(shí)間: 2025-3-26 00:17
Streaming Networks for Coordinating Data-Parallel Programs (Position Statement),978-3-662-41615-0作者: 贊成你 時(shí)間: 2025-3-26 08:11 作者: 欺騙手段 時(shí)間: 2025-3-26 09:20
Scientific Computing Applications on the Imagine Stream Processor,978-3-642-99237-7作者: Mnemonics 時(shí)間: 2025-3-26 14:31 作者: cyanosis 時(shí)間: 2025-3-26 18:09
A Study of the Performance Potential for Dynamic Instruction Hints Selection,978-3-662-24974-1作者: STYX 時(shí)間: 2025-3-26 21:02
Critical-Task Anticipation Scheduling Algorithm for Heterogeneous and Grid Computing,978-3-662-01230-7作者: 飾帶 時(shí)間: 2025-3-27 03:03 作者: BRAWL 時(shí)間: 2025-3-27 07:35
A Study on Transformation of Self-similar Processes with Arbitrary Marginal Distributions,978-3-642-52859-0作者: 半身雕像 時(shí)間: 2025-3-27 11:34
,,TC – An Intermediate Language for Programming Chip Multiprocessors,978-3-662-30404-4作者: palliative-care 時(shí)間: 2025-3-27 17:11 作者: Communicate 時(shí)間: 2025-3-27 20:19 作者: exophthalmos 時(shí)間: 2025-3-27 23:23 作者: Semblance 時(shí)間: 2025-3-28 04:07 作者: 透明 時(shí)間: 2025-3-28 06:25
A High Performance Simulator System for a Multiprocessor System Based on a Multi-way Cluster,978-3-662-29706-3作者: 集合 時(shí)間: 2025-3-28 11:23
Esteban Ferrer,Soledad Le Clainchen multithreading from execution/architecture models, system software technology, and relevant application software studies in the past decade. We then outline our recent experience in working on software issues for the next generation multi-core chip architectures. We will present a case study on a 作者: 倔強(qiáng)不能 時(shí)間: 2025-3-28 15:55 作者: Commentary 時(shí)間: 2025-3-28 21:16 作者: 殺人 時(shí)間: 2025-3-29 01:25
Dynamic Analysis-Based Human Animation Also, each inter-processor communication process is implemented using MPI library, which can minimize the CPU resource usage in a communication waiting state. The evaluation results of the processing and communication performance using a distributed application program such as JPEG encoding show th作者: Cardiac-Output 時(shí)間: 2025-3-29 04:14
0302-9743 embraces both architectural and systems issues. In 2003, the conference again ventured offshore to reflect its constituency and since then has been held in Japa978-3-540-40056-1978-3-540-40058-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: periodontitis 時(shí)間: 2025-3-29 08:35
Implementations of Square-Root and Exponential Functions for Large FPGAs,ntsprechend sind die den Tabellen entnommenen Konstanten zu kürzen. 4 stellige Logarithmentafeln sind fast stets ausreichend und auf 1 oder 2 Seiten zusammenstellbar, also ohne bl?ttern zu benutzen, im Gegensatz zu 5 stelligen.作者: 肌肉 時(shí)間: 2025-3-29 12:53 作者: 混合,攙雜 時(shí)間: 2025-3-29 19:20
Trace-Based Data Cache Leakage Reduction at Link Time,ist, zu den E Rechnungen be- C‘ nutzt, verlangert Abb. I. man eine Tangente AB iiber den Winkelpunkt hinaus, setzt eine beliebige Strecke a auf der Verlangerung und auf der anderen Hofer, Bogentafeln. 7. Auf!. 2 Einfiihrung. Tangente ab (BD = BE = a) und miJ3t die Ent- fernung DE = b. Dann ist I -b 作者: Discrete 時(shí)間: 2025-3-29 20:55
Implementations of Square-Root and Exponential Functions for Large FPGAs,sinnlos, hieraus das Resultat auf 4, 5 oder gar 10 Ziffern ?genau“ zu berechnen Die letzteren Ziffern w?ren nicht nur überflüssig, sondern unrichtig. Der Rauminhalt eines prismatischen K?rpers von 2511 mm L?nge, 283 mm Breite und 154 mm H?he betr?gt nicht 109,434402 dm., sondern 109 dm.. W?ren die e作者: Radiculopathy 時(shí)間: 2025-3-30 03:05 作者: amplitude 時(shí)間: 2025-3-30 05:28 作者: d-limonene 時(shí)間: 2025-3-30 09:56 作者: Heart-Rate 時(shí)間: 2025-3-30 13:28
https://doi.org/10.1007/978-3-642-24378-3acteristics well suited for Imagine architecture, analyze the performance potentiality of scientific computing applications on Imagine compared with common processor and explore the optimizations of scientific stream program.作者: Provenance 時(shí)間: 2025-3-30 18:17
https://doi.org/10.1007/978-3-662-63265-9ests are sent to memory directly without tag checks at intermediary levels in the cache hierarchy. Overall, we find that we can robustly reduce the miss rate by 23% and improve IPC with 14% on average for memory bound SPEC2000 applications without degrading performance of the other SPEC2000 applications.作者: Organonitrile 時(shí)間: 2025-3-30 21:27 作者: jaundiced 時(shí)間: 2025-3-31 02:32 作者: inhibit 時(shí)間: 2025-3-31 07:55
https://doi.org/10.1007/978-1-4302-3757-0s. A detailed study of benchmark simulations demonstrates these first steps towards mapping binaries to a small coarse-grained array at runtime can improve instruction throughput by over 18% and 25% when the microarchitecure includes bypass delays of one cycle and two cycles, respectively.作者: 發(fā)酵劑 時(shí)間: 2025-3-31 10:58 作者: deactivate 時(shí)間: 2025-3-31 15:17
Mathematische Modelle einer Str?mung typically add to branch misprediction penalty, in this case, the extra wakeup stage on the normal fetch path can be overlapped with misprediction recovery. With such consistently accurate wakeup prediction, all cache lines except the next expected cache line are in the leakage saving mode, minimizing leakage energy.作者: 大看臺(tái) 時(shí)間: 2025-3-31 19:47
Spectral Trimming of Photonic Crystals,ighted directed acyclic graphs with various characteristics. We have implemented the . algorithm along with the . scheduling algorithm on the simulator. The . algorithm is shown to be effective in terms of speedup and easy to implement.作者: 容易做 時(shí)間: 2025-4-1 01:03
Generally Accepted Fiscal Policiesof the input process where the output marginal distributions (exponential, gamma, Pareto with .= 20.0, uniform and Weibull) have finite variances, and the ICDF transformation is applied to long-range dependent self-similar processes with normal marginal distributions.作者: 有限 時(shí)間: 2025-4-1 05:20
The CFO’s Mission and Aspirationsch as C and concurrent composition languages, such as Snet. .TC’s advantage over other approaches is that it allows an abstract representation of maximal concurrency in a schedule-independent form. Both Snet and .TC are being used in a European project called AETHER, in order to support all aspects of self-adaptive computation.作者: Insul島 時(shí)間: 2025-4-1 07:48 作者: pellagra 時(shí)間: 2025-4-1 11:17
Frank Van Reeth,Rudi Welter,Eddy Flerackersng aware temporal partitioning algorithm is used to generate CIs which are mappable on the RFU. Temporal partitioning iterates and modifies partitions incrementally to generate CIs. In addition, a mapping algorithm is presented which supports CIs with critical path length more than the RFU depth.
