Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300456
M. Yeung, Yu-Kwong Kwok
In this paper, we study the performance of the IR+UIR wireless data cache invalidation approach under a realistic system model: the quality of the wireless channel is time-varying; and there are other downlink traffics in the system. Our analysis and simulation results show that query delay significantly increases as a result of broadcast error and the additional downlink traffics experience longer delay due to extended broadcast period. Exploiting link adaptation (i.e., transmission rate is adjusted dynamically according to channel quality), we then propose three schemes to tackle these two problems. Our results indicate that the proposed scheme outperform IR+UIR under a wide range of system parameters.
{"title":"Design and analysis of channel adaptive wireless cache invalidation strategies with downlink traffic","authors":"M. Yeung, Yu-Kwong Kwok","doi":"10.1109/ISPAN.2004.1300456","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300456","url":null,"abstract":"In this paper, we study the performance of the IR+UIR wireless data cache invalidation approach under a realistic system model: the quality of the wireless channel is time-varying; and there are other downlink traffics in the system. Our analysis and simulation results show that query delay significantly increases as a result of broadcast error and the additional downlink traffics experience longer delay due to extended broadcast period. Exploiting link adaptation (i.e., transmission rate is adjusted dynamically according to channel quality), we then propose three schemes to tackle these two problems. Our results indicate that the proposed scheme outperform IR+UIR under a wide range of system parameters.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126235049","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300480
Robert Elsässer, B. Monien, Stefan Schamberger
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area mainly focused on static networks. However, observations show that diffusive algorithms, originally designed for these networks, can also be applied in nonstatic scenarios. In this paper we prove that the general diffusion scheme can be deployed on dynamic networks and show that its convergence rate depends on the average value of the quotient of the second smallest eigenvalue and the maximum vertex degree of the networks occurring during the iterations. In the presented experiments we illustrate that even if communication links of static networks fail with high probability, load can still be balanced quite efficiently. Simulating diffusion on ad-hoc networks we demonstrate that diffusive schemes provide a reliable and efficient load balancing strategy also in mobile environments.
{"title":"Load balancing in dynamic networks","authors":"Robert Elsässer, B. Monien, Stefan Schamberger","doi":"10.1109/ISPAN.2004.1300480","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300480","url":null,"abstract":"Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area mainly focused on static networks. However, observations show that diffusive algorithms, originally designed for these networks, can also be applied in nonstatic scenarios. In this paper we prove that the general diffusion scheme can be deployed on dynamic networks and show that its convergence rate depends on the average value of the quotient of the second smallest eigenvalue and the maximum vertex degree of the networks occurring during the iterations. In the presented experiments we illustrate that even if communication links of static networks fail with high probability, load can still be balanced quite efficiently. Simulating diffusion on ad-hoc networks we demonstrate that diffusive schemes provide a reliable and efficient load balancing strategy also in mobile environments.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125868504","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300532
Jie Li, A. Kubota, H. Kameda
This paper addresses the dynamic location update for personal communication service (PCS) networks. The four-direction mobility model for the popular grid cellular architectures is introduced to exploit the mobility patterns of all kinds of mobile terminals (MTs). The shape and size of the local area (LA) in the dynamic location update scheme is determined by minimizing the total location management cost with bounding the paging cost. The optimization problem is transferred to maximize expected number of cells traversed by the MT in the LA with a given size of the LA. The analytic model of calculating the probabilities of any MT's moving is established. An algorithm is proposed to solve the optimization problem efficiently.
{"title":"Dynamic location update for PCS networks with consideration of MT mobility patterns","authors":"Jie Li, A. Kubota, H. Kameda","doi":"10.1109/ISPAN.2004.1300532","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300532","url":null,"abstract":"This paper addresses the dynamic location update for personal communication service (PCS) networks. The four-direction mobility model for the popular grid cellular architectures is introduced to exploit the mobility patterns of all kinds of mobile terminals (MTs). The shape and size of the local area (LA) in the dynamic location update scheme is determined by minimizing the total location management cost with bounding the paging cost. The optimization problem is transferred to maximize expected number of cells traversed by the MT in the LA with a given size of the LA. The analytic model of calculating the probabilities of any MT's moving is established. An algorithm is proposed to solve the optimization problem efficiently.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125046647","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300539
Jung-Sheng Fu
Recently, the WK-recursive network has received much attention due to its many favorable properties such as a high degree of regularity, scalability, and symmetry. In this paper, using the recursive construction method, we show that the WK-recursive network is Hamiltonian-connected. A network is Hamiltonian-connected if it contains a Hamiltonian path between every two distinct nodes. In other words, a Hamiltonian-connected network can embed the longest linear array between any two distinct nodes with dilation, congestion, load, and expansion all equal to one.
{"title":"Hamiltonian-connectedness of the WK-recursive network","authors":"Jung-Sheng Fu","doi":"10.1109/ISPAN.2004.1300539","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300539","url":null,"abstract":"Recently, the WK-recursive network has received much attention due to its many favorable properties such as a high degree of regularity, scalability, and symmetry. In this paper, using the recursive construction method, we show that the WK-recursive network is Hamiltonian-connected. A network is Hamiltonian-connected if it contains a Hamiltonian path between every two distinct nodes. In other words, a Hamiltonian-connected network can embed the longest linear array between any two distinct nodes with dilation, congestion, load, and expansion all equal to one.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123197183","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300540
Xingde Jia
In this paper, mobile ad-hoc networks are studied. Chen and Jia (2001) proposed a routing algorithm by utilizing multiple communication channels and localizing the routing information (routing tables) for mobile stations within the wireless network. The routing algorithm relies on a spanning tree of the underlying network. It is proven that both the construction of the spanning tree and the routing algorithm are efficient. The routing algorithm is also reliable because of the frequent update of the spanning tree which the routing scheme is based on. The underlying network is a random geometric graph G(A,n) formed on a set of uniformly randomly located points in the unit disk, in which two vertices are adjacent if and only if their Euclidean distance is at most A.
{"title":"Wireless networks and random geometric graphs","authors":"Xingde Jia","doi":"10.1109/ISPAN.2004.1300540","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300540","url":null,"abstract":"In this paper, mobile ad-hoc networks are studied. Chen and Jia (2001) proposed a routing algorithm by utilizing multiple communication channels and localizing the routing information (routing tables) for mobile stations within the wireless network. The routing algorithm relies on a spanning tree of the underlying network. It is proven that both the construction of the spanning tree and the routing algorithm are efficient. The routing algorithm is also reliable because of the frequent update of the spanning tree which the routing scheme is based on. The underlying network is a random geometric graph G(A,n) formed on a set of uniformly randomly located points in the unit disk, in which two vertices are adjacent if and only if their Euclidean distance is at most A.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120902359","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300547
Han-Yu Chuang, Huai-Kuang Tsai, Cheng-Yan Kao
This paper proposes a genetic algorithm to find the optimal array sets for microarray experimental design problems. Based on family competition, heterogeneous pairing selection and two new genetic operators, the proposed method can find the optimal designs of limited experimental materials under a statistical model (ANOVA). The proposed method is applied to several design problems whose numbers of target mRNA samples range from 5 to 70, which are more extensive than classical studies, with different number of arrays. We apply A-optimality criterion to get best possible designs with the smallest average variance when comparisons between all pairs of treatments are of equal interest. Experimental results demonstrate that our approach can find the optimum of each testing problem rapidly.
{"title":"Optimal designs for microarray experiments","authors":"Han-Yu Chuang, Huai-Kuang Tsai, Cheng-Yan Kao","doi":"10.1109/ISPAN.2004.1300547","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300547","url":null,"abstract":"This paper proposes a genetic algorithm to find the optimal array sets for microarray experimental design problems. Based on family competition, heterogeneous pairing selection and two new genetic operators, the proposed method can find the optimal designs of limited experimental materials under a statistical model (ANOVA). The proposed method is applied to several design problems whose numbers of target mRNA samples range from 5 to 70, which are more extensive than classical studies, with different number of arrays. We apply A-optimality criterion to get best possible designs with the smallest average variance when comparisons between all pairs of treatments are of equal interest. Experimental results demonstrate that our approach can find the optimum of each testing problem rapidly.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125696950","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300524
Susumu Matsumae
This paper studies the simulation problem of meshes with separable buses (MSB) by meshes with multiple partitioned buses (MMPB). The MSB and the MMPB are the mesh-connected computers enhanced by the addition of broadcasting buses along every row and column. The broadcasting buses of the MSB, called separable buses, can be dynamically sectioned into smaller bus segments by program control, while those of the MMPB, called partitioned buses, are statically partitioned in advance. In the MSB model, each row/column has only one separable bus, while in the MMPB model, each row/column has L partitioned buses (L /spl ges/ 1). We present an algorithm that simulates the MSB of size n /spl times/ n in O (n/sup 1/(2L+1)/) steps using the MMPB of size n /spl times/ n, and prove that the time-complexity of the algorithm is optimal in the worst case.
{"title":"Optimal simulation of meshes with dynamically separable buses by meshes with statically partitioned buses","authors":"Susumu Matsumae","doi":"10.1109/ISPAN.2004.1300524","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300524","url":null,"abstract":"This paper studies the simulation problem of meshes with separable buses (MSB) by meshes with multiple partitioned buses (MMPB). The MSB and the MMPB are the mesh-connected computers enhanced by the addition of broadcasting buses along every row and column. The broadcasting buses of the MSB, called separable buses, can be dynamically sectioned into smaller bus segments by program control, while those of the MMPB, called partitioned buses, are statically partitioned in advance. In the MSB model, each row/column has only one separable bus, while in the MMPB model, each row/column has L partitioned buses (L /spl ges/ 1). We present an algorithm that simulates the MSB of size n /spl times/ n in O (n/sup 1/(2L+1)/) steps using the MMPB of size n /spl times/ n, and prove that the time-complexity of the algorithm is optimal in the worst case.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130946873","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300501
M. Guo, Weng-Long Chang, Jiannong Cao
In this paper, we offer the non-continuous direction vector I test, an extension of the direction vector I test, to make sure whether there are integer-valued solutions for one-dimensional arrays with constant bounds and non-one-increment.
本文给出了非连续方向向量I检验的一个推广，用于确定具有常界和非一增量的一维数组是否存在整数值解。
{"title":"The non-continuous direction vector I test","authors":"M. Guo, Weng-Long Chang, Jiannong Cao","doi":"10.1109/ISPAN.2004.1300501","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300501","url":null,"abstract":"In this paper, we offer the non-continuous direction vector I test, an extension of the direction vector I test, to make sure whether there are integer-valued solutions for one-dimensional arrays with constant bounds and non-one-increment.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133318673","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300508
F. Comellas, S. Gago
Many relevant real-life networks like the WWW, Internet, transportation and communication networks, or even biological and social networks can be modelled by small-world scale-free graphs. These graphs have strong local clustering (vertices have many mutual neighbors), a small diameter and a distribution of degrees according to a power law. On the other hand, the knowledge of the spectrum of a graph is important for the relation which the eigenvalues and their multiplicities have with relevant graph invariants and topological and communication properties such as diameter, bisection width, distances, connectivity, expansion, partitions, edge-loading distribution etc. In this paper we introduce a new family of deterministic small-world graphs, we determine analytically their spectra and we show how these graphs can model the eigenvalue power-law of the Internet network.
{"title":"Deterministic small-world graphs and the eigenvalue power law of Internet","authors":"F. Comellas, S. Gago","doi":"10.1109/ISPAN.2004.1300508","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300508","url":null,"abstract":"Many relevant real-life networks like the WWW, Internet, transportation and communication networks, or even biological and social networks can be modelled by small-world scale-free graphs. These graphs have strong local clustering (vertices have many mutual neighbors), a small diameter and a distribution of degrees according to a power law. On the other hand, the knowledge of the spectrum of a graph is important for the relation which the eigenvalues and their multiplicities have with relevant graph invariants and topological and communication properties such as diameter, bisection width, distances, connectivity, expansion, partitions, edge-loading distribution etc. In this paper we introduce a new family of deterministic small-world graphs, we determine analytically their spectra and we show how these graphs can model the eigenvalue power-law of the Internet network.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134210396","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}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300491
G. Theodoropoulos, Qianyi Zhang
Synchronous VLSI design is approaching a critical point, with clock distribution becoming an increasingly costly and complicated issue and power consumption rapidly emerging as a major concern. Hence, recently, there has been a resurgence of interest in asynchronous digital design techniques as they promise to liberate VLSI systems from clock skew problems, offer the potential for low power and high performance and encourage a modular design philosophy which makes incremental technological migration a much easier task. In a pipelined architecture, if a control hazard occurs, the prefetched instructions following a hazard must be discarded and removed from the pipeline before instructions from the new stream are executed. In an asynchronous microprocessor the exact number of the prefetched instructions is nondeterministic and unpredictable. The processor must be able to distinguish between instructions originating from the branch or the exception target, which may thus be executed, and instructions already prefetched when the hazard took place, which must therefore be thrown away. This paper discusses a distributed, asynchronous technique for dealing with control hazards in asynchronous pipelines where control hazards may potentially occur in more than one stage.
{"title":"A distributed colouring algorithm for control hazards in asynchronous pipelines","authors":"G. Theodoropoulos, Qianyi Zhang","doi":"10.1109/ISPAN.2004.1300491","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300491","url":null,"abstract":"Synchronous VLSI design is approaching a critical point, with clock distribution becoming an increasingly costly and complicated issue and power consumption rapidly emerging as a major concern. Hence, recently, there has been a resurgence of interest in asynchronous digital design techniques as they promise to liberate VLSI systems from clock skew problems, offer the potential for low power and high performance and encourage a modular design philosophy which makes incremental technological migration a much easier task. In a pipelined architecture, if a control hazard occurs, the prefetched instructions following a hazard must be discarded and removed from the pipeline before instructions from the new stream are executed. In an asynchronous microprocessor the exact number of the prefetched instructions is nondeterministic and unpredictable. The processor must be able to distinguish between instructions originating from the branch or the exception target, which may thus be executed, and instructions already prefetched when the hazard took place, which must therefore be thrown away. This paper discusses a distributed, asynchronous technique for dealing with control hazards in asynchronous pipelines where control hazards may potentially occur in more than one stage.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124831971","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：