The Experts below are selected from a list of 306 Experts worldwide ranked by ideXlab platform
K.e. Batcher - One of the best experts on this subject based on the ideXlab platform.
-
ICPP, Vol. 1 - Minimizing communication of a recirculating bitonic sorting network
Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing, 1996Co-Authors: K.e. BatcherAbstract:This paper presents the construction of a new recirculating bitonic sorting network which reduces the O(Nlog/sup 2/N) Cost Complexity of the original bitonic sorting network to O(NlogN) while preserving the well known time Complexity of O(log/sup 2/N). Network communication is reduced by one half by leaving the N/2 even-parity keys in the local memory of each comparator.
-
SPDP - ON the role of K-Bits bitonic sorting network in multicast routing
Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing, 1994Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:Using both modified bit-level comparators and the bitonic sorting algorithm, three multicast routing networks are introduced. The first is dynamic network, which possess a time Complexity of O(log/sup 2/ N) and Cost Complexity of O(N log N). The next two are Hypercube and 2D-MESH static topology networks. A new type of wormhole router is adopted to achieve a general multicast time Complexity of O(log/sup 2/ N) and O(/spl radic/N) for the Hypercube and 2D-MESH respectively. >
-
Low Cost Complexity of a general multicast network
Proceedings of 8th International Parallel Processing Symposium, 1994Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:This paper presents a new multicasting network constructed with a bit-level Cost Complexity of O(N log N) and a bit-level time Complexity of O(log 2 N) using comparators with bit-level O(1) time and Cost complexities. The requested addresses for connection and the addresses of the source nodes to be connected to, are sorted together in a pipeline fashion (worm-hole routed) bit-serially most-significant-bit first through the network. This network achieves sorting by recirculating its inputs through its 3(1+log N) stages. Input items of the network are constructed of leading addresses (request or adversely nodes addresses), return addresses, and data packets. Packets are broadcast during the process of sorting between two equal leading addresses.
-
IPPS - Low Cost Complexity of a general multicast network
Proceedings of 8th International Parallel Processing Symposium, 1994Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:This paper presents a new multicasting network constructed with a bit-level Cost Complexity of O(N log N) and a bit-level time Complexity of O(log 2 N) using comparators with bit-level O(1) time and Cost complexities. The requested addresses for connection and the addresses of the source nodes to be connected to, are sorted together in a pipeline fashion (worm-hole routed) bit-serially most-significant-bit first through the network. This network achieves sorting by recirculating its inputs through its 3(1+log N) stages. Input items of the network are constructed of leading addresses (request or adversely nodes addresses), return addresses, and data packets. Packets are broadcast during the process of sorting between two equal leading addresses. >
-
ICPP (3) - On the Bit-Level Complexity of Bitonic Sorting Networks
1993 International Conference on Parallel Processing - ICPP'93 Vol3, 1993Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:Bitonic sorting networks can be implemented with a bit-level Cost Complexity of O(N log^2 N) using comparators with bit-level O(1) time and Cost complexities. Items to be sorted are pipelined (worm-hole routed) bit-serially most-significant-bit first through the network. The Cost Complexity can be reduced to O(N log N) by recirculating items of length O(logN) through logN stages.
Yongsheng Zhang - One of the best experts on this subject based on the ideXlab platform.
-
mobility management schemes at radio network layer for lte femtocells
Vehicular Technology Conference, 2009Co-Authors: Lan Wang, Yongsheng ZhangAbstract:Femtocell, a small cellular base station in home and small business environment, is an attractive solution for operators to improve indoor coverage and network capacity in 3G networks. However, there are technical problems due to its mass deployment. The paper presents a femtocell architecture for LTE and investigates different handover scenarios. Two mobility management schemes at radio network layer (RNL) are proposed and their signaling Cost, Complexity, standard impact and application scenarios are also discussed.
-
VTC Spring - Mobility Management Schemes at Radio Network Layer for LTE Femtocells
VTC Spring 2009 - IEEE 69th Vehicular Technology Conference, 2009Co-Authors: Lan Wang, Yongsheng ZhangAbstract:Femtocell, a small cellular base station in home and small business environment, is an attractive solution for operators to improve indoor coverage and network capacity in 3G networks. However, there are technical problems due to its mass deployment. The paper presents a femtocell architecture for LTE and investigates different handover scenarios. Two mobility management schemes at radio network layer (RNL) are proposed and their signaling Cost, Complexity, standard impact and application scenarios are also discussed.
M.z. Al-hajery - One of the best experts on this subject based on the ideXlab platform.
-
Bit-level bitonic sorting networks and their role in wormholes multicast routing
1995Co-Authors: M.z. Al-hajeryAbstract:When the Bitonic sorter was first introduced, it was constructed with a bit-level Cost Complexity of O(N $\rm log\sp2$ N) and a bit-level time Complexity of $\rm O(log\sp2$ N) using comparators with bit-level O(1) time and Cost complexities. A new improvement, up to a factor of log N in the Cost Complexity, is achieved. Items to be sorted are pipelined (worm-hole routed) bit-serially most-significant-bit first through the network. This achievement is made possible by recirculating items of length k bits each through $\lceil{k\over\log N}\rceil$ log N stages. Using both the modified bit-level comparators and the bitonic sorting algorithm, four multicast routing networks are introduced. The first two are dynamic networks, which possess a time Complexity of $\rm O(log\sp2$ N). One is a circuit and the other is a packet switching network with Cost complexities of O(N $\rm log\sp2$ N) and O(N log N) respectively. The last two are Hypercube and 2D-MESH static topology networks. A new type of wormhole router is adopted to achieve a general multicast time Complexity of $\rm O(log\sp2$ N) and O($\sqrt{N})$ for the Hypercube and 2D-MESH respectively.
-
Low Cost Complexity of a general multicast network
Proceedings of 8th International Parallel Processing Symposium, 1994Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:This paper presents a new multicasting network constructed with a bit-level Cost Complexity of O(N log N) and a bit-level time Complexity of O(log 2 N) using comparators with bit-level O(1) time and Cost complexities. The requested addresses for connection and the addresses of the source nodes to be connected to, are sorted together in a pipeline fashion (worm-hole routed) bit-serially most-significant-bit first through the network. This network achieves sorting by recirculating its inputs through its 3(1+log N) stages. Input items of the network are constructed of leading addresses (request or adversely nodes addresses), return addresses, and data packets. Packets are broadcast during the process of sorting between two equal leading addresses.
-
IPPS - Low Cost Complexity of a general multicast network
Proceedings of 8th International Parallel Processing Symposium, 1994Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:This paper presents a new multicasting network constructed with a bit-level Cost Complexity of O(N log N) and a bit-level time Complexity of O(log 2 N) using comparators with bit-level O(1) time and Cost complexities. The requested addresses for connection and the addresses of the source nodes to be connected to, are sorted together in a pipeline fashion (worm-hole routed) bit-serially most-significant-bit first through the network. This network achieves sorting by recirculating its inputs through its 3(1+log N) stages. Input items of the network are constructed of leading addresses (request or adversely nodes addresses), return addresses, and data packets. Packets are broadcast during the process of sorting between two equal leading addresses. >
-
ICPP (3) - On the Bit-Level Complexity of Bitonic Sorting Networks
1993 International Conference on Parallel Processing - ICPP'93 Vol3, 1993Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:Bitonic sorting networks can be implemented with a bit-level Cost Complexity of O(N log^2 N) using comparators with bit-level O(1) time and Cost complexities. Items to be sorted are pipelined (worm-hole routed) bit-serially most-significant-bit first through the network. The Cost Complexity can be reduced to O(N log N) by recirculating items of length O(logN) through logN stages.
-
On the Bit-Level Complexity of Bitonic Sorting Networks
1993 International Conference on Parallel Processing - ICPP'93, 1993Co-Authors: M.z. Al-hajery, K.e. BatcherAbstract:Bitonic sorting networks can be implemented with a bit-level Cost Complexity of O(N log^2 N) using comparators with bit-level O(1) time and Cost complexities. Items to be sorted are pipelined (worm-hole routed) bit-serially most-significant-bit first through the network. The Cost Complexity can be reduced to O(N log N) by recirculating items of length O(logN) through logN stages.
Lan Wang - One of the best experts on this subject based on the ideXlab platform.
-
mobility management schemes at radio network layer for lte femtocells
Vehicular Technology Conference, 2009Co-Authors: Lan Wang, Yongsheng ZhangAbstract:Femtocell, a small cellular base station in home and small business environment, is an attractive solution for operators to improve indoor coverage and network capacity in 3G networks. However, there are technical problems due to its mass deployment. The paper presents a femtocell architecture for LTE and investigates different handover scenarios. Two mobility management schemes at radio network layer (RNL) are proposed and their signaling Cost, Complexity, standard impact and application scenarios are also discussed.
-
VTC Spring - Mobility Management Schemes at Radio Network Layer for LTE Femtocells
VTC Spring 2009 - IEEE 69th Vehicular Technology Conference, 2009Co-Authors: Lan Wang, Yongsheng ZhangAbstract:Femtocell, a small cellular base station in home and small business environment, is an attractive solution for operators to improve indoor coverage and network capacity in 3G networks. However, there are technical problems due to its mass deployment. The paper presents a femtocell architecture for LTE and investigates different handover scenarios. Two mobility management schemes at radio network layer (RNL) are proposed and their signaling Cost, Complexity, standard impact and application scenarios are also discussed.
Frans Van Den Reep - One of the best experts on this subject based on the ideXlab platform.
-
Social companies part two: Back to the heart of the matter: recursion and the revival of meaning
2010Co-Authors: Frans Van Den ReepAbstract:The Internet is changing the way we organize work. It is shifting the requirement for what we call the ‘schedule push’ and the hierarchical organization that it implies, and therefore it is removing the type of control that is conventionally used to match resources to tasks, and customer demand to supplies and services. Organizational hierarchies have become too expensive to sustain, and in many cases their style of coordination is simply no longer necessary. The Cost Complexity of the industrial complex starts to outweigh the benefits and the Internet is making it redundant.
-
From schedule push to reality pull
2009Co-Authors: Frans Van Den ReepAbstract:The Internet is changing the way we organise work. It is shifting the requirement for what we call the ‘schedule push’ and the hierarchical organisation that it implies, and therefore it is removing the type of control that is conventionally used to match resources to tasks, and customer demand to supplies and services. Organisational hierarchies have become too expensive to sustain, and in many cases their style of coordination is simply no longer necessary. The Cost Complexity of the industrial complex starts to outweigh the benefits and the Internet is making it redundant.
-
From Schedule Push to Reality Pull: Reality Pull prefers Retail
2005Co-Authors: Frans Van Den ReepAbstract:The Internet is changing the way we organise work. It is shifting the requirement for what we call the ‘schedule push’ and the hierarchical organisation that it implies, and therefore it is removing the type of control that is conventionally used to match resources to tasks, and customer demand to supplies and services. Organisational hierarchies have become too expensive to sustain, and in many cases their style of coordination is simply no longer necessary. The Cost Complexity of the industrial complex starts to outweigh the benefits and the Internet is making it redundant.
