標(biāo)題: Titlebook: Algorithms and Architectures for Parallel Processing; 18th International C Jaideep Vaidya,Jin Li Conference proceedings 2018 Springer Natur [打印本頁] 作者: 我要黑暗 時(shí)間: 2025-3-21 18:28
書目名稱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é)科排名
作者: 憎惡 時(shí)間: 2025-3-21 23:07
Adaptive Data Sampling Mechanism for Process Objectve to the current underlying distribution of data in data stream. For finding appropriate data in big data stream to model process object, an adaptive data sampling mechanism is proposed in this paper. Experiments demonstrate the effectiveness of the proposed adaptive data sampling mechanism for process object.作者: keloid 時(shí)間: 2025-3-22 03:18 作者: 短程旅游 時(shí)間: 2025-3-22 04:57 作者: Mindfulness 時(shí)間: 2025-3-22 08:54
0302-9743 lected from numerous submissions. The papers are organized in topical sections on Distributed and Parallel Computing; High Performance Computing; Big Data and Information Processing; Internet of Things and Cloud Computing; and Security and Privacy in Computing..978-3-030-05050-4978-3-030-05051-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 沒有貧窮 時(shí)間: 2025-3-22 15:13
Bürgergesellschaft und Demokratie a scalable structure to record the access information of the vertices on each machine. Second, we prune unnecessary inter-machine communication for previously accessed vertices by checking the records. Evaluation results show that the performance of our method is at least six times higher than that of the original implementation of parallel BFS.作者: 密切關(guān)系 時(shí)間: 2025-3-22 21:04 作者: hemophilia 時(shí)間: 2025-3-22 21:21
PruX: Communication Pruning of Parallel BFS in the Graph 500 Benchmark a scalable structure to record the access information of the vertices on each machine. Second, we prune unnecessary inter-machine communication for previously accessed vertices by checking the records. Evaluation results show that the performance of our method is at least six times higher than that of the original implementation of parallel BFS.作者: FATAL 時(shí)間: 2025-3-23 05:10
https://doi.org/10.1007/978-3-322-84276-3s the fastest in computing speed benefiting from its optimization for CPU, but it suffers from long communication delay due to the dependency on MapReduce framework. The insights and conclusions from our evaluation provides significant reference for improving resource utility of supercomputer resources in distributed deep learning.作者: Horizon 時(shí)間: 2025-3-23 07:34 作者: finite 時(shí)間: 2025-3-23 09:42 作者: Pulmonary-Veins 時(shí)間: 2025-3-23 17:11
Comparative Study of Distributed Deep Learning Tools on Supercomputerss the fastest in computing speed benefiting from its optimization for CPU, but it suffers from long communication delay due to the dependency on MapReduce framework. The insights and conclusions from our evaluation provides significant reference for improving resource utility of supercomputer resources in distributed deep learning.作者: Hiatal-Hernia 時(shí)間: 2025-3-23 21:50 作者: 失眠癥 時(shí)間: 2025-3-24 01:55 作者: Nonflammable 時(shí)間: 2025-3-24 04:47
https://doi.org/10.1007/978-3-030-05051-1artificial intelligence; authentication; cloud computing; computer architecture; computer crime; computer作者: 外星人 時(shí)間: 2025-3-24 10:24
978-3-030-05050-4Springer Nature Switzerland AG 2018作者: canonical 時(shí)間: 2025-3-24 14:17
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153087.jpg作者: Virtues 時(shí)間: 2025-3-24 18:51
Beispiele von Modellen zum Formen,on clusters of commodity hardware. Existing workload grouping strategies in a DSP system can be classified into four categories (i.e. raw and blind, data skewness, cluster heterogeneity, and dynamic load-aware). However, these traditional stream grouping strategies do not consider network distance b作者: dry-eye 時(shí)間: 2025-3-24 21:39 作者: Working-Memory 時(shí)間: 2025-3-25 02:20 作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-25 03:35
https://doi.org/10.1007/978-3-663-16156-1deo contents, including illegal and adult contents, make it necessary to manage different video traffic using different strategies. Unfortunately, there are few research work concerning Internet video traffic type identification. In this paper, we propose a new effective feature extraction method, n作者: 乏味 時(shí)間: 2025-3-25 10:17
https://doi.org/10.1007/978-3-663-16156-1ailure of SLOs, or overprovision resources by suffering higher expenses. The underlying key nature of user behavior in purchasing instances can be essential for maximizing cloud market profits. However, for cloud service providers, there is little knowledge on assessing the risk of user choices on c作者: 用不完 時(shí)間: 2025-3-25 12:45
https://doi.org/10.1007/978-3-322-98698-6ations result in dynamic environments where data, as well as queries, are continuously moving. As a result, there is a tremendous amount of real-time spatial data generated every day. The growth of the data volume seems to outspeed the advance of our computing infrastructure. For instance, in real-t作者: Flirtatious 時(shí)間: 2025-3-25 18:40
Bürgergesellschaft und Demokratiered Merge-tree (LSM-tree) and their variants are widely used in KV storage systems. Conventional LSM-tree organizes KV items into multiple, successively larger components, and uses compaction to push KV items from one smaller component to another adjacent larger component until the KV items reach th作者: 遭遇 時(shí)間: 2025-3-25 23:58 作者: Postulate 時(shí)間: 2025-3-26 02:09 作者: 離開真充足 時(shí)間: 2025-3-26 08:08
,Zusammenfassende Bemerkungen (§§ 147–211),creasingly complex demand. Cloud service composition has become a hot topic. Nevertheless, few researches consider the problem of competition of service compositions among multiple users and interaction between the user and the cloud provider. Aiming at this problem, a service composition reservatio作者: degradation 時(shí)間: 2025-3-26 12:24
Der Hymnus ?Veni Creator Spiritus?work is the foundation of many network research fields. In this paper, we proposed the most memory efficient super points detection scheme. This scheme contains a super points reconstruction algorithm called short estimator and a super points filter algorithm called long estimator. Short estimator g作者: libertine 時(shí)間: 2025-3-26 15:09
Der Hymnus ?Veni Creator Spiritus?nclude the determination of the objects visible from a viewpoint, virtual reality, real-time simulation and 3D interactive design. As one technique to accelerate the rendering speed, the research on visibility computing has gained great attention in recent years. Traditional visibility computing on 作者: 撤退 時(shí)間: 2025-3-26 18:48 作者: obviate 時(shí)間: 2025-3-27 00:53 作者: miracle 時(shí)間: 2025-3-27 02:35 作者: lipoatrophy 時(shí)間: 2025-3-27 09:11
,Die heutigen wirtschaftlichen Verh?ltnisse, proposed so far, most of them work for these data that have all classes of tagged data. A few methods work for positive and unlabeled data and the computational complexity of existing methods is particularly high and they can’t work well for big data. In this paper, we proposed an active learning a作者: 進(jìn)步 時(shí)間: 2025-3-27 12:39 作者: 進(jìn)步 時(shí)間: 2025-3-27 13:59 作者: Bureaucracy 時(shí)間: 2025-3-27 21:33 作者: FUME 時(shí)間: 2025-3-27 22:17
Algorithms and Architectures for Parallel Processing18th International C作者: 性上癮 時(shí)間: 2025-3-28 03:27 作者: noxious 時(shí)間: 2025-3-28 08:22 作者: lanugo 時(shí)間: 2025-3-28 11:27
https://doi.org/10.1007/978-3-658-35783-2ive to the number of the intermediate results. For the purpose of intermediate results reduction, . is proposed for nearest neighbor query based on pairwise similarity. Since only first top-. neighbors are output for each document, the size of records shuffled is kept in the same magnitude as input 作者: CHAFE 時(shí)間: 2025-3-28 17:01
https://doi.org/10.1007/978-3-663-16156-1ately. To test the performance of our proposal, we collect a set of video traffic traces containing two typical video types, romance and action. We conduct a set of comparing experiments on the collected data. The results show that the BCD method can hit extremely high identification accuracies (hig作者: HIKE 時(shí)間: 2025-3-28 22:37
https://doi.org/10.1007/978-3-663-16156-1ch to fine-tuning the instance recommendation. We have evaluated our approach using simulations on real-world workloads and cloud market statistics. The results show that, compared to traditional approaches, our approach provides the best tradeoff between SLOs and costs, as it can maximize the overa作者: Somber 時(shí)間: 2025-3-29 00:48
https://doi.org/10.1007/978-3-322-98698-6formance of the system and simplify data management. But they remain insufficient for real-time spatial Big data; they can’t deal with real-time and stream queries efficiently. Thus, in this paper, we propose a novel data partitioning approach over a sliding window in real-time spatial Big Data name作者: 可轉(zhuǎn)變 時(shí)間: 2025-3-29 03:40 作者: Parley 時(shí)間: 2025-3-29 10:34 作者: 不知疲倦 時(shí)間: 2025-3-29 13:21 作者: 彩色 時(shí)間: 2025-3-29 19:25 作者: anaerobic 時(shí)間: 2025-3-29 21:07 作者: 下級(jí) 時(shí)間: 2025-3-30 01:06
https://doi.org/10.1007/978-3-662-29162-7ificant impact on the heat recirculation and the energy consumption of data centers, failure nodes with different positions are analyzed and evaluated. The experimental results demonstrate that the energy consumption of data centers can be significantly reduced by using the GA and SA algorithms for 作者: 違反 時(shí)間: 2025-3-30 07:56 作者: 反對(duì) 時(shí)間: 2025-3-30 10:17 作者: 修剪過的樹籬 時(shí)間: 2025-3-30 15:33 作者: evasive 時(shí)間: 2025-3-30 19:22
Document Nearest Neighbors Query Based on Pairwise Similarity with MapReduceive to the number of the intermediate results. For the purpose of intermediate results reduction, . is proposed for nearest neighbor query based on pairwise similarity. Since only first top-. neighbors are output for each document, the size of records shuffled is kept in the same magnitude as input 作者: Arroyo 時(shí)間: 2025-3-30 23:26
Accurate Identification of Internet Video Traffic Using Byte Code Distribution Featuresately. To test the performance of our proposal, we collect a set of video traffic traces containing two typical video types, romance and action. We conduct a set of comparing experiments on the collected data. The results show that the BCD method can hit extremely high identification accuracies (hig作者: 獨(dú)特性 時(shí)間: 2025-3-31 01:21
RISC: Risk Assessment of Instance Selection in Cloud Marketsch to fine-tuning the instance recommendation. We have evaluated our approach using simulations on real-world workloads and cloud market statistics. The results show that, compared to traditional approaches, our approach provides the best tradeoff between SLOs and costs, as it can maximize the overa作者: 保留 時(shí)間: 2025-3-31 07:05
Real-Time Data Stream Partitioning over a Sliding Window in Real-Time Spatial Big Dataformance of the system and simplify data management. But they remain insufficient for real-time spatial Big data; they can’t deal with real-time and stream queries efficiently. Thus, in this paper, we propose a novel data partitioning approach over a sliding window in real-time spatial Big Data name作者: 翻動(dòng) 時(shí)間: 2025-3-31 09:55 作者: fulmination 時(shí)間: 2025-3-31 16:34 作者: 制造 時(shí)間: 2025-3-31 18:03
Most Memory Efficient Distributed Super Points Detection on Core Networkson a common GPU to accelerate processing speed. Experiments on several real-world core network traffics show that our algorithm acquires the highest accuracy with only consuming littler than one-fifth memory of other algorithms.作者: Heresy 時(shí)間: 2025-4-1 01:26
Parallel Implementation and Optimizations of Visibility Computing of 3D Scene on Tianhe-2 Supercomputechnique called hemispheric visibility computing is designed, which can overcome the visibility missing of traditional perspective algorithm. Secondly, a distributed parallel algorithm for visibility computing is implemented, which is based on the master-worker architecture. Finally, we discuss the作者: 杠桿支點(diǎn) 時(shí)間: 2025-4-1 05:06
Efficient Algorithms of Parallel Skyline Join over Data Streamsowledge, this is the first paper that addresses parallel computing of . over multiple data streams. Extensive experimental evaluations on real and synthetic data sets show that the algorithms proposed in this paper provide large gains over the state-of-the-art serial algorithm of . over data streams作者: 值得 時(shí)間: 2025-4-1 09:13 作者: 投射 時(shí)間: 2025-4-1 11:58
An Active Learning Based on Uncertainty and Density Method for Positive and Unlabeled DataSAL) automatically annotating some confident unlabeled samples in the each iteration is proposed to reduce the number of manually annotated samples. Experimental results indicate that our proposed method is competitive with other similar methods.作者: 山羊 時(shí)間: 2025-4-1 16:14
Network-Aware Grouping in Distributed Stream Processing Systemson clusters of commodity hardware. Existing workload grouping strategies in a DSP system can be classified into four categories (i.e. raw and blind, data skewness, cluster heterogeneity, and dynamic load-aware). However, these traditional stream grouping strategies do not consider network distance b作者: 教義 時(shí)間: 2025-4-1 19:15
vPlacer: A Co-scheduler for Optimizing the Performance of Parallel Jobs in Xendays. Currently, the existing schedulers of Xen are initially targeting at serial jobs, which achieves a remarkable utilization of computer hardware and impressive overall performance. However, the virtualized systems are expected to accommodate both parallel jobs and serial jobs in practice, and re作者: 迅速飛過 時(shí)間: 2025-4-1 22:58
Document Nearest Neighbors Query Based on Pairwise Similarity with MapReducevariability. Among them, how to organize plenty of web pages and retrieval information needed is a critical one. An important notion is document classification, in which nearest neighbors query is the key issue to be solved. Most parallel nearest neighbors query methods adopt Cartesian Product betwe作者: notification 時(shí)間: 2025-4-2 05:38 作者: Criteria 時(shí)間: 2025-4-2 10:40
