2009 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第7页

Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net 递归双网中的不相交路径与容错路由

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1142/S0129054111008532

Yamin Li, S. Peng, Wanming Chu

引用次数: 15

A Speculative Technique for Auto-Memoization Processor with Multithreading 多线程自动记忆处理器的一种设想技术

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.67

Y. Kamiya, Tomoaki Tsumura, H. Matsuo, Y. Nakashima

引用次数: 3

How to be a More Efficient Snoop: Refined Probe Complexity of Quorum Sets 如何成为一个更有效的窥探者:改进仲裁集的探测复杂度

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.31

Timo Warns, C. Storm, Oliver E. Theel

引用次数: 1

Single Sensor Acoustic Feature Extraction for Embedded Realtime Vehicle Classification 嵌入式实时车辆分类的单传感器声学特征提取

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.18

Andreas Starzacher, B. Rinner

引用次数: 14

Supporting Partial Ordering with the Parallel Iterator 用并行迭代器支持部分排序

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.11

Nasser Giacaman, O. Sinnen

引用次数: 0

Equi-Width Data Swapping for Private Data Publication 私有数据发布的等宽数据交换

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.69

Yidong Li, Hong Shen

{"title":"Equi-Width Data Swapping for Private Data Publication","authors":"Yidong Li, Hong Shen","doi":"10.1109/PDCAT.2009.69","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.69","url":null,"abstract":"Data Swapping is a popular value-invariant data perturbation technique. The quality of a data swapping method is measured by how well it preserves data privacy and data utility. As swapping data globally is computationally impractical, to guarantee its performance in these metrics appropriate, localization schemes are often conducted in advance. Equi-depth partitioning is preferred by most of the existing data perturbation techniques as it provides uniform privacy protection for each data tuple. However, this method performs ineffectively for two types of applications: one is to maintain statistics based on equi-width partitioning, such as the multivariate histogram with equal bin width, and the other is to preserve parametric statistics, such as covariance, in the context of sparse data with non-uniform distribution. As a natural solution for the above application, this paper explores the possibility of using data swapping with equi-width partitioning for private data publication, which has been little used in data perturbation due to the difficulty of preserving data privacy. With extensive theoretical analysis and experimental results, we show that, Equi-Width Swapping (EWS)can achieve a similar performance in privacy preservation to that of Equi-Depth Swapping (EDS) if the number of partitions is sufficiently large (e. g. &get;=sqrt(N), where N is the size of dataset). Our experimental results in both synthetic and real-world data validate our theoretical analysis.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133340380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

An Improved Score Level Fusion in Multimodal Biometric Systems 在多模态生物识别系统中改进的分数水平融合

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.82

S. Horng, Yuan-Hsin Chen, R. Run, Rong-Jian Chen, Jui-Lin Lai, Kevin Octavius Sentosa

引用次数: 33

A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines 非相关并行机器上的广义多组织调度

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.26

Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi

{"title":"A Generalized Multi-Organization Scheduling on Unrelated Parallel Machines","authors":"Fukuhito Ooshita, Tomoko Izumi, Taisuke Izumi","doi":"10.1109/PDCAT.2009.26","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.26","url":null,"abstract":"We consider the parallel computing environment where m organizations provide machines and several jobs to be executed. While cooperation of organizations is required to minimize the global makespan, each organization also expects the faster completion of its own jobs primarily and thus it is not necessarily cooperative. To handle the situations, we formulate the alpha-cooperative multi-organization scheduling problem (alpha-MOSP), where alpha≫= 1 is a parameter representing the degree of cooperativeness.alpha-MOSP minimizes the makespan under the cooperation constraint that each organization does not allow the completion time of its own jobs to be delayed alpha times of that in the case where those jobs are executed by itself. In this paper, we aim to reveal the relation between the makespan and the degree of cooperativeness. First, we investigate the relation between alpha and the quality of the global makespan. For alpha=1 (i. e., each organization never sacrifices its completion time), we show an instance where the cooperation constraint degrades the optimal makespan by $m$ times. In contrast, for alpha≫1, we can construct an algorithm transforming any unconstrained schedule to one satisfying the cooperation constraint. This algorithm bounds the degradation ratio by alpha / (alpha - 1), which implies that weak cooperation improves the makespan dramatically. Second, we study the complexity of alpha-MOSP. We show its strongly NP-hardness and inapproximability for the approximation factor less than max{(alpha + 1)/alpha, 3/2}. We also show the hardness of transformation: Even if an optimal schedule under no cooperation constraint is given, no polynomial-time algorithm finds an optimal schedule for alpha-MOSP. This result is a witness for inexistence of general polynomial-time transformation algorithms that preserve the approximation ratio.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121362382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Maotai 2.0: Data Race Prevention in View-Oriented Parallel Programming 茅台2.0:面向视图并行编程中的数据竞争预防

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.12

K. Leung, Zhiyi Huang, Qihang Huang, P. Werstein

引用次数: 7

Cache Partitioning on Chip Multi-Processors for Balanced Parallel Scientific Applications 平衡并行科学应用的芯片多处理器缓存分区

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.48

Guang Suo

引用次数: 1