|
Parallel Breadth-first Search
The breadth-first search, breadth-first-search algorithm is a way to explore the vertices of a graph layer by layer. It is a basic algorithm in graph theory which can be used as a part of other graph algorithms. For instance, BFS is used by Dinic's algorithm to find maximum flow in a graph. Moreover, BFS is also one of the kernel algorithms in Graph500 benchmark, which is a benchmark for data-intensive supercomputing problems. This article discusses the possibility of speeding up BFS through the use of parallel computing. Serial breadth-first search In the conventional sequential BFS algorithm, two data structures are created to store the frontier and the next frontier. The frontier contains all vertices that have the same distance (also called "level") from the source vertex, these vertices need to be explored in BFS. Every neighbor of these vertices will be checked, some of these neighbors which are not explored yet will be discovered and put into the next frontier. At the begi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Breadth-first Search
Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Extra memory, usually a queue, is needed to keep track of the child nodes that were encountered but not yet explored. For example, in a chess endgame a chess engine may build the game tree from the current position by applying all possible moves, and use breadth-first search to find a win position for white. Implicit trees (such as game trees or other problem-solving trees) may be of infinite size; breadth-first search is guaranteed to find a solution node if one exists. In contrast, (plain) depth-first search, which explores the node branch as far as possible before backtracking and expanding other nodes, may get lost in an infinite branch and never make it to the solution node. Iterative deepening depth-first search avoids ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bit Array
A bit array (also known as bitmask, bit map, bit set, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure. A bit array is effective at exploiting bit-level parallelism in hardware to perform operations quickly. A typical bit array stores ''kw'' bits, where ''w'' is the number of bits in the unit of storage, such as a byte or word, and ''k'' is some nonnegative integer. If ''w'' does not divide the number of bits to be stored, some space is wasted due to internal fragmentation. Definition A bit array is a mapping from some domain (almost always a range of integers) to values in the set . The values can be interpreted as dark/light, absent/present, locked/unlocked, valid/invalid, et cetera. The point is that there are only two possible values, so they can be stored in one bit. As with other arrays, the access to a single bit can be managed by applying an index to the array. Assuming its size ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Patterson (computer Scientist)
David Andrew Patterson (born November 16, 1947) is an American computer pioneer and academic who has held the position of professor of computer science at the University of California, Berkeley since 1976. He announced retirement in 2016 after serving nearly forty years, becoming a distinguished software engineer at Google. He currently is vice chair of the board of directors of the RISC-V Foundation, and the Pardee Professor of Computer Science, Emeritus at UC Berkeley. Patterson is noted for his pioneering contributions to reduced instruction set computer (RISC) design, having coined the term RISC, and by leading the Berkeley RISC project. As of 2018, 99% of all new chips use a RISC architecture. He is also noted for leading the research on redundant arrays of inexpensive disks (RAID) storage, with Randy Katz. His books on computer architecture, co-authored with John L. Hennessy, are widely used in computer science education. Hennessy and Patterson won the 2017 Turing Award for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Krste Asanović
Krste Asanović from the University of California, Berkeley has written and co-authored many academic papers concerning computer architecture. , he is chairman of the Board of the RISC-V Foundation. Asanović was named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2014 ''for contributions to computer architecture''. He was elected as an ACM Fellow in 2018 for "contributions to computer architecture, including the open RISC-V instruction set and Agile hardware". Asanović received a PhD in computer science from Berkeley in 1998 under John Wawrzynek John Wawrzynek is Professor of Electrical Engineering and Computer Science at the University of California at Berkeley. He holds a joint appointment with Lawrence Berkeley National Laboratory Lawrence Berkeley National Laboratory (LBNL), .... In 2015, along with RISC-V researchers he co-founded SiFive, a fabless semiconductor company and provider of commercial RISC-V processor IP, where he serv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Small-world Network
A small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other and most nodes can be reached from every other node by a small number of hops or steps. Specifically, a small-world network is defined to be a network where the typical distance ''L'' between two randomly chosen nodes (the number of steps required) grows proportionally to the logarithm of the number of nodes ''N'' in the network, that is: :L \propto \log N while the global clustering coefficient is not small. In the context of a social network, this results in the small world phenomenon of strangers being linked by a short chain of acquaintances. Many empirical graphs show the small-world effect, including social networks, wikis such as Wikipedia, gene networks, and even the underlying architecture of the Internet. It is the inspiration for many network-on-chip architectures in contempo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Steven Strogatz
Steven Henry Strogatz (), born August 13, 1959, is an American mathematician and the Jacob Gould Schurman Professor of Applied Mathematics at Cornell University. He is known for his work on nonlinear systems, including contributions to the study of synchronization in dynamical systems, and for his research in a variety of areas of applied mathematics, including mathematical biology and complex network theory. Strogatz is the host of ''Quanta Magazines ''The Joy of x'' podcast, named after his book of the same name. Education Strogatz attended high school at Loomis Chaffee from 1972 to 1976. He then attended Princeton University, graduating summa cum laude with a B.A. in mathematics. Strogatz completed his senior thesis, titled "The mathematics of supercoiled DNA: an essay in geometric biology", under the supervision of Frederick J. Almgren, Jr. Strogatz then studied as a Marshall Scholar at Trinity College, Cambridge from 1980 to 1982, and then received a Ph.D in applied mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duncan J
Duncan may refer to: People * Duncan (given name), various people * Duncan (surname), various people * Clan Duncan * Justice Duncan (other) Places * Duncan Creek (other) * Duncan River (other) * Duncan Lake (other), including Lake Duncan Australia *Duncan, South Australia, a locality in the Kangaroo Island Council *Hundred of Duncan, a cadastral unit on Kangaroo Island in South Australia Bahamas *Duncan Town, Ragged Island, Bahamas ** Duncan Town Airport Canada * Duncan, British Columbia, on Vancouver Island * Duncan Dam, British Columbia * Duncan City, Central Kootenay, British Columbia; see List of ghost towns in British Columbia United States * Duncan Township (other) * Duncan, Arizona * Duncan, Indiana * Duncan, Iowa * Duncan, Kentucky (other) * Duncan City, Cheboygan, Michigan * Duncan, Mississippi * Duncan, Missouri * Duncan, Nebraska * Duncan, North Carolina * Duncan, Oklahoma * Duncan, South Carolina * Fo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Point-to-point (telecommunications)
In telecommunications, a point-to-point connection refers to a communications connection between two communication endpoints or nodes. An example is a telephone call, in which one telephone is connected with one other, and what is said by one caller can only be heard by the other. This is contrasted with a ''point-to-multipoint'' or ''broadcast'' connection, in which many nodes can receive information transmitted by one node. Other examples of point-to-point communications links are leased lines and microwave radio relay. The term is also used in computer networking and computer architecture to refer to a wire or other connection that links only two computers or circuits, as opposed to other network topologies such as buses or crossbar switches which can connect many communications devices. ''Point-to-point'' is sometimes abbreviated as ''P2P''. This usage of ''P2P'' is distinct from ''P2P'' meaning ''peer-to-peer'' in the context of file sharing networks or other data-sh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Torus Interconnect
A torus interconnect is a switch-less network topology for connecting processing nodes in a parallel computer system. Introduction In geometry, a torus is created by revolving a circle about an axis coplanar to the circle. While this is a general definition in geometry, the topological properties of this type of shape describes the network topology in its essence. Geometry illustration The following images are 1D, and 2D torus. 1D torus is a simple circle, and 2D torus has the shape of a doughnut. The animation below illustrates how a 2D torus is generated from a rectangle by connecting its two pairs of opposite edges. Here the concept of torus is used to describe essentially the beginning and ending of a sequence of nodes are connected, like a doughnut. To better illustrate the concept, and understand what the topology means in network interconnect, we give 3 examples of parallel interconnected nodes using torus topology. At one dimension, a torus topology is equivalent to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
