2006 International Conference on Computer Engineering and Systems最新文献

筛选
英文 中文
Scheduler Optimization by Exploring Wakeup Locality 探索唤醒局部性的调度器优化
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320434
Kuo-Su Hsiao, C. Chen
{"title":"Scheduler Optimization by Exploring Wakeup Locality","authors":"Kuo-Su Hsiao, C. Chen","doi":"10.1109/ICCES.2006.320434","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320434","url":null,"abstract":"In a high-performance superscalar processor, the instruction scheduler often comes with poor scalability and high complexity due to the expensive instruction wakeup operation. Using detailed simulation-based analyses, we find that the wakeup distances between two dependent instructions are short. By exploiting this wakeup locality, an effective wakeup design is proposed to improve the speed, power, and scalability of the dynamic scheduler. By limiting the wakeup range of instructions, load capacitance and match activities on the scheduler's critical path can be reduced. The architectural level simulation and circuit-level timing analyses show that the proposed design saves 65-76% of the power consumption, reduces 44-78% in the wakeup latency with negligible (less than 1%) performance degradation. The results also show that the proposed design is excellent in scalability","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016242","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}
引用次数: 0
Performance Enhancement of Downlink Multiuser DS-CDMA Detectors Using Processing by Independent Component Analysis 利用独立分量分析增强下行多用户DS-CDMA检测器的性能
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320454
S. E. El-Khamy, Mohamed Abed
{"title":"Performance Enhancement of Downlink Multiuser DS-CDMA Detectors Using Processing by Independent Component Analysis","authors":"S. E. El-Khamy, Mohamed Abed","doi":"10.1109/ICCES.2006.320454","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320454","url":null,"abstract":"In this paper, the attention is focused on the generation of the received digital signal and its linear detection over a synchronous multiuser direct sequence code division multiple access (DS-CDMA) downlink system considering various spreading codes, additive white Gaussian noise (AWGN) and introducing varying signal-to-noise ratios (SNRs) and users' power distributions. The aim of the paper is to test the efficiency of implementing an independent component analysis (ICA) based estimator of the transmitted symbols preceded by principal component analysis (PCA) pre-processing of the received data to reduce dimension and decrease the noise effects. The noisy ICA algorithm is used either as: (1) a pre-processor prior to conventional detection: The idea here is to estimate the mixing matrix that contains the basic vectors and fading terms using the separating matrix and PCA subspace or as (2) a post-processor attached to a linear DS-CDMA receiver. Numerical simulations indicate that the first schema could constitute a powerful tool for channel and symbols estimations and has the advantage that it doesn't necessitate any prior knowledge of the users' codes or paths delays and strengths except providing a short pilot sequence (presenting 1% to 4% of the transmitted symbols of the user of interest) that is used to give a good enough initial guess of the demising matrix columns and so force the ICA iteration to be in the wanted user subspace. The second schema shows performance comparable to or superior than the exact blind detectors at relatively high SNR values","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129690881","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}
引用次数: 4
The Cryptanalysis of LFSR/FCSR Based Alternating Step Generator 基于LFSR/FCSR交替阶跃发生器的密码分析
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320452
Shun-lung Su, Ko-Ming Chiu, Lih-Chyau Wuu
{"title":"The Cryptanalysis of LFSR/FCSR Based Alternating Step Generator","authors":"Shun-lung Su, Ko-Ming Chiu, Lih-Chyau Wuu","doi":"10.1109/ICCES.2006.320452","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320452","url":null,"abstract":"The alternating step generator (ASG) was proposed by Gunther in 1988 and consists of three LFSRs. After several serious attacks to ASG were proposed in recent years, the security of ASG has been carefully reexamined. A new structure of LFSR/FCSR based ASG and a new combination function are proposed in this research. Here, the structures of LFSR/FCSR based ASG are found to have lower probability of finding the corresponding pairs of two base sequences from an output sequence. In other words, it can resist edit distance correlation attacks efficiently. From the overall evaluation in this research, the structures of LFSR/FCSR based ASG are regarded to be more secure than ASG","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123515081","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}
引用次数: 11
Performance Comparison of CBT and PIM Multicast Routing Protocols over MPLS Networks MPLS网络中CBT与PIM组播路由协议性能比较
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320442
Nada El-shenawy, M. El-Derini, Mahmoud M. Fahmy, El-Sayed M. El-Alfy
{"title":"Performance Comparison of CBT and PIM Multicast Routing Protocols over MPLS Networks","authors":"Nada El-shenawy, M. El-Derini, Mahmoud M. Fahmy, El-Sayed M. El-Alfy","doi":"10.1109/ICCES.2006.320442","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320442","url":null,"abstract":"Multi-protocol label switching (MPLS) is a promising cutting-edge technology for advanced forwarding of IP packets. Better performance of multicast routing in large-scale networks is expected when it is implemented over MPLS. In this paper, we simulate core-based tree (CBT) multicast routing protocol over MPLS-based networks using NS2, and compare its performance with protocol-independent multicast-sparse mode (PIM-SM). Simulations are performed for different network topologies with various group sizes using a modified version of the MPLS Network Simulator (MNS). Results reveal that as the number of source nodes increases CBT gives better performance than PIM-SM in terms of routing table size, join time, and total hop count. On the other hand, PIM-SM has less end-to-end delay than CBT","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114225356","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}
引用次数: 4
Static RWA in All-Optical Network under Multifiber, Multiple Requests Assumption 多光纤、多请求全光网络中的静态RWA
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320443
Z.M. Wali, K. Elsayed, Aamir Hassan
{"title":"Static RWA in All-Optical Network under Multifiber, Multiple Requests Assumption","authors":"Z.M. Wali, K. Elsayed, Aamir Hassan","doi":"10.1109/ICCES.2006.320443","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320443","url":null,"abstract":"This paper introduces a new approach targeting the RWA problem for static traffic and under the general assumptions of multiple requests between the same SD pairs and multifiber links. The case of infeasibility of the problem is also discussed and integrated into our frame work. We first present a categorization of the RWA problems according to the different assumptions involved. In addition, a classification of the available approaches is presented along with a brief comparison and overview of each. The proposed approach is tested by applying it to different network models; results for NSFNET and cost239 networks are presented. Furthermore, the results are also compared with a recent heuristic approach","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116190953","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}
引用次数: 1
Randomized Cryptosystems Attacks and Defenses 随机密码系统攻击与防御
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320453
G. Hussein
{"title":"Randomized Cryptosystems Attacks and Defenses","authors":"G. Hussein","doi":"10.1109/ICCES.2006.320453","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320453","url":null,"abstract":"In this paper, an evaluation of (one time pad) OTP, Rabin everlasting encryption and two stage random number generator (TSRG) randomized cryptosystems are introduced. TSRG uses randomized encryption techniques for designing an algorithm of a provably secure cryptosystem for message exchange. A built-in TSRG RNG is a distinguishable primitive in the proposed cryptosystem design where instantaneous real time OTP-like data is generated. Most cryptography relies on unproven complexity assumptions like integer factorization being computationally hard, with the adversary limited by computing power. However, advances in cryptanalysis, unpublished researches and computing technology, especially in the emerging quantum cryptography, may make current cryptosystems insecure. Shannon's pessimistic result essentially denotes that if the adversary is all-powerful, then efficient practical solutions for information-theoretic security do not exist. However, the TSRG use the concept of dynamic modeling to achieve provable security based on insoluble problem with respect to attacker. This requires a secure way of exchanging of the OTP-like special seed to be expanded at the receiver side as well as preventing the attackers from mounting state compromise attacks. The paper also explains the relation among the three discussed cryptosystems and randomized encryption techniques","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116263679","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}
引用次数: 1
DF Experimentation through Parametric Simulation 参数化仿真的DF实验
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320430
D. Hunter, D. Joachim
{"title":"DF Experimentation through Parametric Simulation","authors":"D. Hunter, D. Joachim","doi":"10.1109/ICCES.2006.320430","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320430","url":null,"abstract":"In most direction-finding experiments, beamforming is one of the simplest and most robust means of spatial filtering. Beamforming implementation is typically done using ordinary or some type of commercial style microphones. We plan to fabricate a microphone array on a micro-scale, which will allow for several more applications in direction-finding. However, this approach can be difficult due to the requirements for direction-finding and the constraints that are practical in micro-electro mechanical systems (MEMS). The purpose of this work is to model and simulate the entire direction-finding system. The results from these simulations will provide insight for an optimal design of a sensor that can be applied to direction-finding. This project will also provide the flexibility to alter parameters in order to test the microphone performance. Furthermore, an optimal design of the microphone will lead to a more accurate direction-finding system","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124085110","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}
引用次数: 0
High Speed Search Algorithms for Block-Based Motion Estimation Video Compression 基于块的运动估计视频压缩的高速搜索算法
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320466
M. Sushmitha, M. Rizkalla, P. Salama, M. El-Sharkawy
{"title":"High Speed Search Algorithms for Block-Based Motion Estimation Video Compression","authors":"M. Sushmitha, M. Rizkalla, P. Salama, M. El-Sharkawy","doi":"10.1109/ICCES.2006.320466","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320466","url":null,"abstract":"The enormous computations associated with motion estimation prevent software implementations from running in real time. A hardware implementation to achieve real time video compression was demonstrated utilizing mentor graphics tools. Several block-matching criteria and architectures were developed to improve the hardware efficiency and computational speed of block-matching VLSI chips. The VHDL code for block-based motion estimation was designed using high speed arithmetic units. As the complexity of motion estimation is greatly influenced by the search algorithm and search range, the design focuses mainly on the high throughput rate and scalability for increased search ranges. The design was simulated for different image sizes at different clock frequencies with varying block sizes and search areas. The paper details the search algorithms and simulation results in order to achieve high speed hardware processing. With a clock frequency of 400MHz, the estimated time for motion estimation for QCIF and CIF sequences shows the feasibility for real-time video-codec","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128281068","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}
引用次数: 5
Digital Image Watermarking: Scalar Wavelets versus Multiwavelets 数字图像水印:标量小波与多小波
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320468
MahmoudI . Khalil
{"title":"Digital Image Watermarking: Scalar Wavelets versus Multiwavelets","authors":"MahmoudI . Khalil","doi":"10.1109/ICCES.2006.320468","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320468","url":null,"abstract":"Multiwavelets have been used in image processing applications. They offer superior performance compared with scalar wavelets. This paper proposes a watermarking embedding and extraction techniques. It compares the performance of three multiwavelets and two scalar wavelets. The experiments compare the visibility requirement and robustness against some attacks. The experiments show that the multiwavelets outperform the scalar wavelets","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132039492","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}
引用次数: 1
Scalable and Self-Organizing Server Clusters for QoS-aware Applications 用于qos感知应用程序的可伸缩和自组织服务器集群
2006 International Conference on Computer Engineering and Systems Pub Date : 2006-11-01 DOI: 10.1109/ICCES.2006.320473
S. Senbel
{"title":"Scalable and Self-Organizing Server Clusters for QoS-aware Applications","authors":"S. Senbel","doi":"10.1109/ICCES.2006.320473","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320473","url":null,"abstract":"We present a new scalable and decentralized design for a server cluster that provides a single service with a certain QoS objective: maximum response time guarantee. Our design is based upon providing autonomy for each node in the cluster by having the node maintain only partial information about the system and having a mechanism for each node to process jobs or redirect it to a neighbor node. Also, each node decides whether it should remain an active node in the system or got to a standby mode, based upon information about its neighbor node and its own utilization. The metrics for the system performance are the rate of rejected requests in the system, the average experienced response time for service requests, the system size, and the ability of the system to react rapidly to changes in external load or node failures. Our system performed well in all metrics compared to a similar system that provides the same goals","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"5 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128792581","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信