標(biāo)題: Titlebook: Algorithms and Architectures for Parallel Processing; 8th International Co Anu G. Bourgeois,S. Q. Zheng Conference proceedings 2008 Springe [打印本頁(yè)] 作者: Jefferson 時(shí)間: 2025-3-21 18:35
書目名稱Algorithms and Architectures for Parallel Processing影響因子(影響力)
書目名稱Algorithms and Architectures for Parallel Processing影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Architectures for Parallel Processing網(wǎng)絡(luò)公開度
書目名稱Algorithms and Architectures for Parallel Processing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Architectures for Parallel Processing被引頻次
書目名稱Algorithms and Architectures for Parallel Processing被引頻次學(xué)科排名
書目名稱Algorithms and Architectures for Parallel Processing年度引用
書目名稱Algorithms and Architectures for Parallel Processing年度引用學(xué)科排名
書目名稱Algorithms and Architectures for Parallel Processing讀者反饋
書目名稱Algorithms and Architectures for Parallel Processing讀者反饋學(xué)科排名
作者: Panther 時(shí)間: 2025-3-21 23:49
Architecture Aware Partitioning Algorithms,ms is critical. We developed such algorithms that can address the partitioning requirements of scientific computations, and can correctly model the architectural characteristics of emerging hardware platforms.作者: Flinch 時(shí)間: 2025-3-22 00:33
A Simple and Efficient Fault-Tolerant Adaptive Routing Algorithm for Meshes,mesh. We also show that our scheme does not lead to diminish the performance of the network and only three virtual channels per physical channels are sufficient for tolerating multiple boundary faulty regions.作者: exclusice 時(shí)間: 2025-3-22 04:56 作者: Acquired 時(shí)間: 2025-3-22 12:30 作者: esculent 時(shí)間: 2025-3-22 16:46
A Non-blocking Multithreaded Architecture with Support for Speculative Threads, of load/store instructions compared to computational instructions, miss speculation rates and the degree of thread level speculation. Our architecture presents a viable alternative to complex superscalar and super-speculative CPUs.作者: 競(jìng)選運(yùn)動(dòng) 時(shí)間: 2025-3-22 19:43
Conference proceedings 2008ist of two keynote addresses, seven technical sessions, and one tutorial. Included in these proceedings are papers whose authors are from Australia, Brazil, Canada, China, Cyprus, France, India, Iran, Israel, Italy, Japan, Korea, Germany, Greece, Mexico, Poland, Portugal, Romania, Spain, Switzerland作者: 溫和女孩 時(shí)間: 2025-3-22 22:15 作者: Guaff豪情痛飲 時(shí)間: 2025-3-23 02:53
,Ausl?sende Faktoren des Herzinfarktes,ordering at input linecards without any computation and communication overhead. As the simulation results demonstrate, UFFS-k offers improved delay performance among existing scheduling algorithms that guarantee packet ordering.作者: 外面 時(shí)間: 2025-3-23 06:58
Heilungsfaktoren allgemeiner Art,hypercube and mesh as basic network. Some topological properties of BSN have been investigated, and some algorithms have been developed on the BSN such as sorting and matrix multiplication etc. In this paper, we discuss the fault tolerant issue of the BSN including network connectivity and fault diameter.作者: 保留 時(shí)間: 2025-3-23 12:14
Evaluation of a Novel Load-Balancing Algorithm with Variable Granularity,ordering at input linecards without any computation and communication overhead. As the simulation results demonstrate, UFFS-k offers improved delay performance among existing scheduling algorithms that guarantee packet ordering.作者: Herpetologist 時(shí)間: 2025-3-23 16:45 作者: 破布 時(shí)間: 2025-3-23 18:32 作者: CANON 時(shí)間: 2025-3-23 23:45
,Pharmakologische überlegungen,ms is critical. We developed such algorithms that can address the partitioning requirements of scientific computations, and can correctly model the architectural characteristics of emerging hardware platforms.作者: CUMB 時(shí)間: 2025-3-24 06:15
https://doi.org/10.1007/978-3-642-51380-0mesh. We also show that our scheme does not lead to diminish the performance of the network and only three virtual channels per physical channels are sufficient for tolerating multiple boundary faulty regions.作者: microscopic 時(shí)間: 2025-3-24 10:33 作者: 大約冬季 時(shí)間: 2025-3-24 11:15
https://doi.org/10.1007/978-3-662-31652-8ffectively validate the path of BGP. Through analysis and simulation we show that this scheme has little impact on the performance and memory usage for the original BGP, and can be adopted in practice as an operational approach.作者: BLA 時(shí)間: 2025-3-24 18:06
https://doi.org/10.1007/978-3-322-98841-6 of load/store instructions compared to computational instructions, miss speculation rates and the degree of thread level speculation. Our architecture presents a viable alternative to complex superscalar and super-speculative CPUs.作者: –LOUS 時(shí)間: 2025-3-24 22:52
,Pharmakologische überlegungen,ent interpretation of pheromone trails..The goodness of the proposed algorithm, in term of load balancing and average queue waiting time, has been evaluated by mean of a vast campaign of simulations carried out on some real scenarios of a grid infrastructure.作者: prolate 時(shí)間: 2025-3-25 00:47 作者: 倔強(qiáng)不能 時(shí)間: 2025-3-25 04:39
https://doi.org/10.1007/978-3-642-92380-7plemented a message passing interface (MPI) program on an AMD Opteron Model 270 cluster system to verify the proposed parallel algorithm, since the PRAM model is not available in the real world. The experimental results show that the speedup is saturated when the number of processors used is more than four, regardless of the problem size.作者: Graduated 時(shí)間: 2025-3-25 09:18
https://doi.org/10.1007/978-3-662-34646-4ect method for MD simulations and O(r)+O(logM) time complexity for the Multigrid method, where r is N/M and M is the size of R-Mesh. Our work supports the theory that reconfigurable models are a good direction for biological studies which require high computing power.作者: Cpap155 時(shí)間: 2025-3-25 13:44
https://doi.org/10.1007/978-3-662-31652-8n MVPPs having hundreds of queries and thousands of views. Also, in our experimental study we show that our method provides a significant improvement in the quality of the obtained set of materialized views over existing heuristic and sequential simulated annealing algorithms.作者: Infantry 時(shí)間: 2025-3-25 17:05 作者: 使無(wú)效 時(shí)間: 2025-3-25 20:24 作者: 陳腐思想 時(shí)間: 2025-3-26 03:38 作者: 充足 時(shí)間: 2025-3-26 07:57
Neighbourhood Broadcasting and Broadcasting on the (,, ,)-Star Graph, to find an optimal broadcasting algorithm on the all-port model of the (., .)-star. The running time of this algorithm matches those of previous ones but the algorithm is simpler by using a dominating set instead of spanning trees. In addition, the algorithm has no redundancy in that no node receives the same message more than once.作者: Esalate 時(shí)間: 2025-3-26 11:05 作者: 后退 時(shí)間: 2025-3-26 14:07
Examining the Feasibility of Reconfigurable Models for Molecular Dynamics Simulation,ect method for MD simulations and O(r)+O(logM) time complexity for the Multigrid method, where r is N/M and M is the size of R-Mesh. Our work supports the theory that reconfigurable models are a good direction for biological studies which require high computing power.作者: Ingrained 時(shí)間: 2025-3-26 17:22
Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments,n MVPPs having hundreds of queries and thousands of views. Also, in our experimental study we show that our method provides a significant improvement in the quality of the obtained set of materialized views over existing heuristic and sequential simulated annealing algorithms.作者: 別炫耀 時(shí)間: 2025-3-27 00:57 作者: STALE 時(shí)間: 2025-3-27 04:27 作者: Perineum 時(shí)間: 2025-3-27 05:37 作者: Perceive 時(shí)間: 2025-3-27 13:15 作者: 諂媚于人 時(shí)間: 2025-3-27 14:53
https://doi.org/10.1007/978-3-540-69501-1algorithms; ant colony optimization; broadcasting; cluster computing; component-based SE; computational s作者: Alveolar-Bone 時(shí)間: 2025-3-27 20:32 作者: 外科醫(yī)生 時(shí)間: 2025-3-28 01:25 作者: Crumple 時(shí)間: 2025-3-28 05:22 作者: arsenal 時(shí)間: 2025-3-28 09:30 作者: 獸皮 時(shí)間: 2025-3-28 11:34
,Ausl?sende Faktoren des Herzinfarktes,d-balanced switches by assigning k cells of the same flow to the fixed k successive intermediate inputs. The UFFS-k algorithm first guarantees packet ordering at input linecards without any computation and communication overhead. As the simulation results demonstrate, UFFS-k offers improved delay pe作者: 替代品 時(shí)間: 2025-3-28 18:05
https://doi.org/10.1007/978-3-642-85412-5gning the nodes to the processors. However, sometimes it is very difficult to estimate the execution time of several parts of a program and the communication delays under different circumstances. In this paper, an uncertain intelligent scheduling algorithm based on an expected value model and a gene作者: 草率女 時(shí)間: 2025-3-28 20:38
,Pharmakologische überlegungen, are several algorithms that try to obtain the best performance possible for the specified requirements; taking into account that the issue of allocating jobs on resources is a combinatorial optimization problem, NP-hard in most cases, several heuristics have been proposed to provide good performanc作者: debble 時(shí)間: 2025-3-29 00:25
,Pharmakologische überlegungen,ms. On such architectures, effective load balancing can only be achieved if the graph is distributed so that it properly takes into account the available resources (CPU speed, network bandwidth). With heterogeneous technologies becoming more popular, the need for suitable graph partitioning algorith作者: 復(fù)習(xí) 時(shí)間: 2025-3-29 04:53 作者: Admire 時(shí)間: 2025-3-29 10:13
https://doi.org/10.1007/978-3-642-51380-0nce technique is presented based on a new turn model for 2D tori. In order to avoid cyclic channel dependencies completely, we propose the new odd-even turn model for 2D tori. The new model is an improved algorithm of the original turn model, and sets some constraints for some special turns. As far 作者: 忘川河 時(shí)間: 2025-3-29 11:29 作者: peritonitis 時(shí)間: 2025-3-29 19:12
Heilungsfaktoren allgemeiner Art, and total nodes are 2.., and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. Some topological properties of BSN have been investigated, and some algorithms have been developed on the BSN suc作者: 團(tuán)結(jié) 時(shí)間: 2025-3-29 23:40
https://doi.org/10.1007/978-3-642-92380-7ent image computation problems, especially for three dimensional (3D) space. We achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size . ., our parallel algorithm can be run in .(log.) time using . .processors on the concurrent read作者: 咽下 時(shí)間: 2025-3-30 01:54 作者: 皺痕 時(shí)間: 2025-3-30 05:41
https://doi.org/10.1007/978-3-662-34646-4d by an N-body problem and the simulation is continued until the energy reaches equilibrium. Many applications use MD for biomolecular simulations and the simulations are performed in multiscale of time and length. The simulations of the relevant scales require strong and fast computing power, but i作者: 鐵砧 時(shí)間: 2025-3-30 09:27 作者: 繁榮地區(qū) 時(shí)間: 2025-3-30 13:57
https://doi.org/10.1007/978-3-662-31652-8ince it cannot ensure the authenticity of the path attributes announced by BGP routers. Despite several solutions have been proposed to address this vulnerability, none of them is operational in real-world due to their immense impact on original BGP. In this paper, we propose a . scheme, which can e作者: 防御 時(shí)間: 2025-3-30 19:30
https://doi.org/10.1007/978-3-662-31652-8nnections, was proposed. The performance of SMART is determined by the performance of its hyperchannels, which are essentially optical buses or light-trails. Previously proposed CSMA protocols for unidirectional optical buses can be used as distributed medium access control protocols for hyperchanne作者: 處理 時(shí)間: 2025-3-30 23:08
https://doi.org/10.1007/978-3-662-31652-8ness and adaptive behavior. While context awareness guarantees that the applications are aware of both their context and their own state, dynamic adaptivity enables them to react on their knowledge about it and optimize their offered services. However, because in pervasive computing environments the作者: 情感脆弱 時(shí)間: 2025-3-31 03:30 作者: Insufficient 時(shí)間: 2025-3-31 07:57 作者: ascetic 時(shí)間: 2025-3-31 10:48
Algorithms and Architectures for Parallel Processing978-3-540-69501-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Barter 時(shí)間: 2025-3-31 15:50
Conference proceedings 2008ork to ICA3PP 2008, and all Program Committee members and additional reviewers for their diligent work in the paper review process ensuring a collection of high-quality papers. We are grateful to Hong Shen University of Adelaide, Australia and Kleanthis Psarris University of Texas at San Antonio, Un
