標(biāo)題: Titlebook: Algorithms and Architectures for Parallel Processing; 14th International C Xian-he Sun,Wenyu Qu,Lei Liu Conference proceedings 2014 Springe [打印本頁] 作者: 他剪短 時間: 2025-3-21 18:12
書目名稱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é)科排名
作者: relieve 時間: 2025-3-21 23:44 作者: engagement 時間: 2025-3-22 00:23 作者: 極深 時間: 2025-3-22 07:04
Acceleration of Solving Non-Equilibrium Ionization via Tracer Particles and MapReduce on Eulerian M easily adapted to other simulations modeling reactive flow on Eulerian mesh. Evaluations on up to 192 cores show that our approach can improve the end-to-end performance of a real world simulation by 3-fold above.作者: 心胸開闊 時間: 2025-3-22 12:35
Utilizing Multiple Xeon Phi Coprocessors on One Compute Node,penMP counterpart. All the programming approaches are tested by a real-world 3D application, for which the COI-SCIF approach shows a performance upper hand on a Tianhe-2 compute node with three Xeon Phi coprocessors.作者: Hamper 時間: 2025-3-22 15:38
HPSO: Prefetching Based Scheduling to Improve Data Locality for MapReduce Clusters,w tasks. To this end, we have implemented HPSO in Hadoop-1.1.2. The experiment results have shown that the method can reduce the map tasks causing remote data delay, and improves the performance of Hadoop clusters.作者: Oscillate 時間: 2025-3-22 19:47
Similar Samples Cleaning in Speculative Multithreading, the program features, similarity values between samples are calculated to assess the similar degree. In this paper, we introduce a novel way of assessing the similarity of two program samples using Theory of Fuzzy. We firstly calculate the Euclidean Distance of two different program samples as the 作者: legitimate 時間: 2025-3-23 01:18 作者: Inflammation 時間: 2025-3-23 01:44
A Platform for Stock Market Simulation with Distributed Agent-Based Modeling,related problems. The sample simulation on the platform is verified to be compatible with the data from Euronext-NYSE and the platform shows fair scalability and performance under different parallelism configurations.作者: 壁畫 時間: 2025-3-23 06:19
C2CU : A CUDA C Program Generator for Bulk Execution of a Sequential Algorithm,all algorithm, and Montgomery modulo multiplication. Our implementations running on GeForce GTX Titan for the bulk execution can be 199 times faster for bitonic sort, 54 times faster for Floyd-Warshall algorithm, and 78 times faster for Montgomery modulo multiplication, over the implementations on a作者: 擔(dān)心 時間: 2025-3-23 12:20 作者: Infirm 時間: 2025-3-23 15:35 作者: 繞著哥哥問 時間: 2025-3-23 19:35
https://doi.org/10.1007/978-3-540-78457-9ion results show that the proposed hybrid computation model not only achieves reliable MapReduce computation, reduces task response time and improves the performance of MapReduce, but also reduces the computation cost and achieves a greener computing mode.作者: 投射 時間: 2025-3-23 23:40 作者: 形上升才刺激 時間: 2025-3-24 03:12 作者: 變化無常 時間: 2025-3-24 10:04 作者: 節(jié)省 時間: 2025-3-24 11:30
https://doi.org/10.1007/978-3-540-71131-5w tasks. To this end, we have implemented HPSO in Hadoop-1.1.2. The experiment results have shown that the method can reduce the map tasks causing remote data delay, and improves the performance of Hadoop clusters.作者: allergy 時間: 2025-3-24 16:18
https://doi.org/10.1007/978-3-322-82616-9 the program features, similarity values between samples are calculated to assess the similar degree. In this paper, we introduce a novel way of assessing the similarity of two program samples using Theory of Fuzzy. We firstly calculate the Euclidean Distance of two different program samples as the 作者: FLIT 時間: 2025-3-24 20:02
,Beginn der Gesch?ftsführert?tigkeit,s in intermediate results) is processed; at last, a chain pattern sub-join is decomposed into several MapReduce jobs or single MapReduce job by dynamic programming to obtain an optimal scheme for the chain pattern sub-join. We conducted extensive experiments, and the results show that our method is 作者: 辮子帶來幫助 時間: 2025-3-25 02:20 作者: 咽下 時間: 2025-3-25 04:20 作者: 確定 時間: 2025-3-25 09:02 作者: 震驚 時間: 2025-3-25 13:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153077.jpg作者: Organonitrile 時間: 2025-3-25 16:33
https://doi.org/10.1007/978-3-540-78457-9er nodes and heterogeneous desktop PCs in Internet or Intranet can be integrated to form a hybrid computing environment. In this way, the computation and storage capability of large-scale desktop PCs can be fully utilized to process large-scale datasets. HybridMR relies on a hybrid distributed file 作者: 同時發(fā)生 時間: 2025-3-25 22:07
https://doi.org/10.1007/978-3-662-59724-8lution. However, due to its sequential nature, .-means++ requires a large number of iterations to complete the initialization and it becomes inefficient as the size of data increase. Even though scalable .-means++ can drastically reduce the iterations and can be easily applied to the MapReduce syste作者: LUT 時間: 2025-3-26 00:36 作者: Invertebrate 時間: 2025-3-26 04:36
https://doi.org/10.1007/978-3-540-71131-5ork profiling. With the development of internet, network attacks occur frequently such as worm spreading, DDoS attack and port scanning and so on. One common characteristic of these attacks is that they usually generate a lot of traffic connections in a short time which will lead the host cardinalit作者: 不法行為 時間: 2025-3-26 08:44 作者: 迅速飛過 時間: 2025-3-26 15:09 作者: 易受刺激 時間: 2025-3-26 20:19
https://doi.org/10.1007/978-3-540-71131-5 access delay. Data locality is becoming one of the most critical factors to affect performance of MapReduce clusters. As machines in MapReduce clusters have large memory capacities, which are often underutilized, in-memory prefetching input data is an effective way to improve data locality. However作者: 閑逛 時間: 2025-3-27 00:40
https://doi.org/10.1007/978-3-540-71131-5 hinders the development of vehicle electronics. First, in this paper, we proposed a SOA-based middleware for vehicular embedded system, which makes it possible for each ECU to dispatch and receive data on the bus by service, it will hide the underlying heterogeneity. Second, on the basis of the veh作者: notification 時間: 2025-3-27 03:22 作者: 適宜 時間: 2025-3-27 05:37 作者: Detain 時間: 2025-3-27 10:31 作者: 小淡水魚 時間: 2025-3-27 16:45
https://doi.org/10.1007/3-540-30388-Xrk, we propose a concolic execution engine for Python applications named Conpy. Conpy is easy to deploy since it is written in pure Python and it is not dependent on any third-party tools. Conpy is also easy to use. Anyone with basic knowledge of Python and concolic execution can quickly get start w作者: 機密 時間: 2025-3-27 18:30
Buchführung, Rechnungslegung und Steuernters are limited by the computing capability as breakthroughs in financial research need much larger amount of agents. This paper introduces a platform for stock market simulation with ABM focusing on large scale parallel agents in a distributed computing environment such as Cluster and MPP. With th作者: peptic-ulcer 時間: 2025-3-28 02:01
Kündigung des Anstellungsvertragson, signal processing, sorting, dynamic programming, and encryption/decryption can be performed by oblivious sequential algorithms. Bulk execution of a sequential algorithm is to execute it for many independent inputs in turn or in parallel. The main contribution of this paper is to develop a tool t作者: Needlework 時間: 2025-3-28 05:43 作者: 完整 時間: 2025-3-28 08:16
Aufhebung und sonstige Beendigungl image of the earth. However, this program takes considerable time due to its high computational cost; hence the working efficiency of the oil industry is affected. The general purpose Graphic Processing Unit (GPU) and the Compute Unified Device Architecture (CUDA) developed by NVIDIA have provided作者: Accommodation 時間: 2025-3-28 12:45
Aufhebung und sonstige BeendigungWe find two major results in this paper:(1) For any integer .?≥?4, two node-disjoint 3D meshes of size 2 ×2 ×2. can be embedded into .. with dilation 1 and expansion 2. (2) For any integer .?≥?6, four node-disjoint 4 ×2 ×2. meshes can be embedded into .. with dilation 1 and expansion 4. Further, an 作者: 細(xì)胞 時間: 2025-3-28 17:52
Beendigung der Gesch?ftsführerstellung the maximum eigenvalue. Existing algorithms of finding the maximum eigenvalue of matrices are implemented sequentially. With the increasing of the orders of matrices, the workload of calculation is getting heavier. Therefore, traditional sequential methods are unable to meet the need of fast calcul作者: Dislocation 時間: 2025-3-28 20:09
Versorgung und soziale Absicherungthe application. The speculation accuracy is one of the key factors to the performance of software speculative parallel model. In this paper, we proposed a novel value prediction mechanism named Inter-thread Fetching Value Prediction(IFVP). It supports a speculative thread to read the values of conf作者: 不透明性 時間: 2025-3-29 00:31 作者: intelligible 時間: 2025-3-29 05:53
https://doi.org/10.1007/978-3-319-11194-0embedded systems; network architectures; parallel algorithms; sensor networks; software organization and作者: Irritate 時間: 2025-3-29 08:14 作者: indemnify 時間: 2025-3-29 12:32 作者: 搖曳 時間: 2025-3-29 19:03 作者: OUTRE 時間: 2025-3-29 23:11
Acceleration of Solving Non-Equilibrium Ionization via Tracer Particles and MapReduce on Eulerian M the NEI solver with Eulerian mesh infrastructure, introduced high overhead on computing, memory and communication. In order to overcome the shortcomings of the pure Eulerian scheme, a new approach employing tracer particles and MapReduce model to solve the NEI problem was proposed. We introduce (1)作者: lesion 時間: 2025-3-30 00:55 作者: 狂亂 時間: 2025-3-30 06:43 作者: CAB 時間: 2025-3-30 08:54
Utilizing Multiple Xeon Phi Coprocessors on One Compute Node,multiple Xeon Phi coprocessors that lie inside one compute node. Besides a standard MPI-OpenMP programming approach, which belongs to the symmetric usage mode, two offload-mode programming approaches are considered. The first offload approach is conventional and uses compiler pragmas, whereas the se作者: 音樂戲劇 時間: 2025-3-30 14:21 作者: 禁止,切斷 時間: 2025-3-30 19:48
Service Scheduling Algorithm in Vehicle Embedded Middleware, hinders the development of vehicle electronics. First, in this paper, we proposed a SOA-based middleware for vehicular embedded system, which makes it possible for each ECU to dispatch and receive data on the bus by service, it will hide the underlying heterogeneity. Second, on the basis of the veh作者: COM 時間: 2025-3-30 23:09 作者: 讓步 時間: 2025-3-31 04:47
Equi-join for Multiple Datasets Based on Time Cost Evaluation Model,ion, equi-join is an important operation. However, it is inefficient to perform equi-join operations in MapReduce when multiple datasets are involved in the join. In this paper, a time cost evaluation model is extended for an equi-join by considering the time cost of calculation. In addition, the su作者: 共同確定為確 時間: 2025-3-31 08:48 作者: extinct 時間: 2025-3-31 09:30
Conpy: Concolic Execution Engine for Python Applications,rk, we propose a concolic execution engine for Python applications named Conpy. Conpy is easy to deploy since it is written in pure Python and it is not dependent on any third-party tools. Conpy is also easy to use. Anyone with basic knowledge of Python and concolic execution can quickly get start w作者: nepotism 時間: 2025-3-31 16:47
A Platform for Stock Market Simulation with Distributed Agent-Based Modeling,ters are limited by the computing capability as breakthroughs in financial research need much larger amount of agents. This paper introduces a platform for stock market simulation with ABM focusing on large scale parallel agents in a distributed computing environment such as Cluster and MPP. With th作者: cipher 時間: 2025-3-31 17:30 作者: FANG 時間: 2025-3-31 23:15 作者: 全國性 時間: 2025-4-1 02:56 作者: Armada 時間: 2025-4-1 06:42
