waashk/acm huggingface dataset:
an efficient pipelined dataflow processor architecture  this paper demonstrates that the principles of pipelined instruction execution can be effectively applied in dataflow computers, yielding an architecture that avoids the main sources of pipeline gaps during program execution in many conventional processor designs. the new processing element design uses an architecture called argument-fetch dataflow architecture. it has two parts: a dataflow instruction scheduling unit (disu) and a pipelined instruction processing unit (pipu). the pipu is an instruction processor that uses many conventional techniques to achieve fast pipelined operation. the disu holds the dataflow signal graph of the collection of dataflow instructions allocated to the processing element, and maintains a large pool of enabled instructions available for execution by the pipu. the new architecture provides a basis for achieving high performance for many scientific applications. to show that the realization of an efficient dataflow processing element is feasible, a trial design and fabrication of an enable memory-a key component of the disu-is reported.  j. b. dennis g. r. gao
location update optimization in personal communication systems  mobility tracking is concerned with finding a mobile subscriber (ms) within the area serviced by the wireless network. the two basic operations for tracking an ms, location updating and paging, constitute additional load on the wireless network. the total cost of updating and paging can be minimized by optimally dividing the service area into location registration (lr) areas. there are various factors affecting this cost, including the mobility and call patterns of the individual ms, the shape, size and orientation of the lr area, and the method of searching for the ms within the lr area. based on various mobility patterns of users and network architecture, the design of the lr area is formulated as a combinatorial optimization problem. the objective is to minimize the location update cost subject to a constraint on the size of the lr area.  ahmed abutaleb victor o.k. li
an approach for interconnecting sna and xns networks  interest in computer internetworking has resulted from the proliferation of wide area and local area networks. the ccitt, darpa/dod, and iso/ecma internetworking models, which have become widely accepted for doing this, do not address the pragmatic problem of interconnecting computer networks that are based upon closed-system, vendor-proprietary network architectures. this paper presents an approach for interconnecting private data networks that are based upon ibm's system network architecture (sna) and xerox's network system (xns). paramount to the solution of the sna/xns network interconnection problem is the identification and definition of a number of gateway-provided data transport and application protocol support services, which can be incorporated into a multi-function, multi-level, protocol translation gateway.  kenneth o. zoline william p. lidinsky
data networks as cascades: investigating the multifractal nature of internet wan traffic in apparent contrast to the well-documented self-similar (i.e., monofractal) scaling behavior of measured lan traffic, recent studies have suggested that measured tcp/ip and atm wan traffic exhibits more complex scaling behavior, consistent with multifractals. to bring multifractals into the realm of networking, this paper provides a simple construction based on cascades (also known as multiplicative processes) that is motivated by the protocol hierarchy of ip data networks. the cascade framework allows for a plausible physical explanation of the observed multifractal scaling behavior of data traffic and suggests that the underlying multiplicative structure is a traffic invariant for wan traffic that co-exists with self-similarity. in particular, cascades allow us to refine the previously observed self-similar nature of data traffic to account for local irregularities in wan traffic that are typically associated with networking mechanisms operating on small time scales, such as tcp flow control.to validate our approach, we show that recent measurements of internet wan traffic from both an isp and a corporate environment are consistent with the proposed cascade paradigm and hence with multifractality. we rely on wavelet-based time-scale analysis techniques to visualize and to infer the scaling behavior of the traces, both globally and locally. we also discuss and illustrate with some examples how this cascade- based approach to describing data network traffic suggests novel ways for dealing with networking problems and helps in building intuition and physical understanding about the possible implications of multifractality on issues related to network performance analysis. a. feldmann a. c. gilbert w. willinger
improving dqdb behaviour: combining bandwidth balancing and priority mechanism  dqdb is a new standard for mans. in this paper we first present the dqdb standard. previous investigations have shown that the combination of bwb and the priority mechanism in a dqdb network does not work correctly. we shall analyze that behaviour and develop some solutions to overcome the problems. the principle ideals of the proposed solutions were developed by the way when focusing on aspects of network management [ro"thig 91]. they were shortly outlined and published in [seitz 91]. in this paper they shall be explained in detail and simulation results shall show how the various mechanisms affect dqdb behaviour.  jurgen rothig
scalable multicasting  most of the multicast routing protocols for ad hoc networks today are based on shared or source-based trees; however, keeping a routing tree connected for the purpose of data forwarding may lead to a substantial network overhead. a different approach to multicast routing consists of building a shared mesh for each multicast group. in multicast meshes, data packets can be accepted from any router, as opposed to trees where data packets are only accepted from routers with whom a "tree branch" has been established. the difference among multicast routing protocols based on meshes is in the method used to build these structures. some mesh-based protocols require the flooding of sender or recieved announcements over the whole network. this paper presents the core- assisted mesh protocol, which uses mesh for data forwarding, and avoids flooding by generalizing the notion of core-based trees introduced for internet multicasting. group members form the mesh of a group by sending join requests to a set of cores. simulation experiments show that meshes can be used effectively as multicast routing structures without the need for flooding control packets.  ewerton l. madruga j. j. garcia-luna-aceves
selective eager execution on the polypath architecture control-flow misprediction penalties are a major impediment to high performance in wide- issue superscalar processors. in this paper we present _selective eager execution_ (see), an execution model to overcome mis- speculation penalties by executing both paths after diffident branches. we present the micro- architecture of the _polypath_ processor, which is an extension of an aggressive superscalar, out-of-order architecture. the polypath architecture uses a novel instruction tagging and register renaming mechanism to execute instructions from multiple paths simultaneously in the same processor pipeline, while retaining maximum resource availability for single-path code sequences.results of our execution-driven, pipeline-level simulations show that see can improve performance by as much as 36% for the go benchmark, and an average of 14% on specint95, when compared to a normal superscalar, out-of- order, speculative execution, monopath processor. moreover, our architectural model is both elegant and practical to implement, using a small amount of additional state and control logic. artur klauser abhijit paithankar dirk grunwald
a micro-vectorprocessor architecture: performance modeling and benchmarking  this paper proposes and examines some architectural features suitable for micro-vectorprocessors. due to the i/o-pin bottleneck, micro-vectorprocessors should save the off-chip memory bandwidth by exploiting the on-chip register bandwidth instead. those features include the vector-instruction-level multithreading and fifo vector registers. there are three variations of multithreading:periodic, forced, and round-robin. the paper also formulates the performance of micro-vectorprocessors with such architectural features. and then, the paper evaluates the performance attainable by those micro- vectorprocessors with such architectural features. and then, the paper evaluates the performance attainable by those micro-vectorprocessors through software simulation. from the benchmark results, it is found that the vector- instruction-level multithreading and fifo vector registers can improve the performance of the micro-vectorprocessors with the half memory bandwidth comparable to that of ones with the full memory bandwidth. furthermore, forced multithreading is found to be tolerant to the large memory access latency. from these results, the paper concludes that the forced multithreading at the vector-instruction level is a good candidate for the architectural features suitable to micro-vectorprocessors.  takashi hashimoto kazuaki murakami tetsuo hironaka hiroto yasuura
selecting sequence numbers a characteristic of almost all communication protocols is the use of unique numbers to identify individual pieces of data. these identifiers permit error control through acknowledgement and retransmission techniques. usually successive pieces of data are identified with sequential numbers and the identifiers are thus called sequence numbers.this paper discusses techniques for selecting and synchronizing sequence numbers such that no errors will occur if certain network characteristics can be bounded and if adequate data error detection measures are taken. the discussion specifically focuses on the protocol described by cerf and kahn (1), but the ideas are applicable to other similar protocols. raymond s. tomlinson
verification of a methodology for designing reliable communication protocols  in this paper we present a new methodology for designing reliable communication protocols. this methodology enhances communicating processes with a synchronization mechanism so that they can detect and resolve the errors caused by collisions automatically. the major advantages of this new methodology include: (1) the "state explosion" problem involved in protocol validation is alleviated; and (2) the burden of handling errors due to collisions is removed from the protocol designer. there is a need to verify that this methodology is applicable to arbitrary protocols. in this paper we also discuss the application of a program verification technique to this methodology.  huai-an lin ming t. liu charles j. graff
a scalable, distributed middleware service architecture to support mobile internet applications middleware layers placed between user clients and applicationservers have been used to perform a variety of functions. inprevious work we have used middleware to perform a new capability,application session handoff, using a single middleware server toprovide all functionality. however, to improve the scalability ofour architecture, we have designed an efficient distributedmiddleware service layer that properly maintains applicationsession handoff semantics while being able to service a largenumber of clients. we show that this service layer improves thescalability of general client-to-application server interaction aswell as the specific case of application session handoff. we detailprotocols involved in performing handoff and analyse animplementation of the architecture that supports the use of a realmedical teaching tool. from experimental results it can be seenthat our middleware service effectively provides scalability as aresponse to increased workload. thomas phan richard guy rajive bagrodia
multicast routing in datagram internetworks and extended lans  multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. although multicast capability is available and widely used in local area networks, when those lans are interconnected by store-and-forward routers, the multicast service is usually not offered across the resulting internetwork. to address this limitation, we specify extensions to two common internetwork routing algorithms---distance- vector routing and link-state routing---to support low-delay datagram multicasting beyond a single lan. we also describe modifications to the single-spanning-tree routing algorithm commonly used by link-layer bridges, to reduce the costs of multicasting in large extended lans. finally, we discuss how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks.  stephen e. deering david r. cheriton
a geographically distributed framework for embedded system design and validation  the difficulty of emb edded system co-design is increasing rapidly due to the incr easing complexity of individual parts, the variety of parts available and pr essure to use multiple processors to me et performanc e criteria. v alidation tools should contain sever al features in order to keep up with this trend, including the ability to dynamically change detail levels, built in protection for intellectual property, and supp ort for gradual migr ation of functionalityfrom a simulation environment to the real hardware. in this paper, we present our appr oach to the problem which includes a geographically distributed co-simulation framework. this fr amework is a system of nodes such that each can include either portions of the simulator or real hardware. in supp ort of this, the framework includes a me chanism for maintaining consistent versions of virtual time.  ken hines gaetano borriello
wireless atm mac performance evaluation, a case study: hiperlan type 1 vs. modified mdr  this paper deals with wireless atm and in particular with mac (medium access control) mechanisms. the requirements for wireless atm mac are discussed, and contention-based and tdma/reservation based mac protocols are compared. the objective is to find out the suitability of current wireless mac schemes for atm interworking, in comparison to new wireless atm mac proposals. two candidate mechanisms, ey-npma used in hiperlan type 1, and a modified mdr protocol, are discussed in more detail and their performance in different traffic scenarios is evaluated through simulations.  jouni mikkonen liina nenonen
network assisted power control for wireless data  the cellular telephone success story prompts the wireless communications community to turn its attention to other information services, many of them in the category of "wireless data" communications. one lesson of cellular telephone network operation is that effective power control is essential to promote system quality and efficiency. in recent we have applied microeconomic theories to power control taking into account motions of utility and pricing. our earlier work has shown that this new approach to power control for wireless data performs better than traditional techniques applied for voice signals. however, the operating points of such a strategy result in an unfair equilibrium in that users operate with unequal signal-to-interface ratios. further, the power control algorithms required to achieve such operating points are more complex than the simple signal-to-interference ratio balancing algorithms for voice,. in this paper, we introduce a new concept, network assisted power control (napc) that maximizes utilities for users while maintaining equal signal-to-interference ratios for all users. the power control algorithm is easily implemented via signal-to-interference ratio balancing with the assistance of the network that broadcasts the common signal-to-interference ratio target.  david goodman narayan mandayam
group-based multicast and dynamic membership in wireless networks with incomplete spatial coverage  in this paper we examine the problem of group-based multicast communication in the context of mobile computing with wireless communication technology. we propose a protocol in which group members may be mobile computers and such that the group membership may change dynamically. multicasts are delivered in the same order at all group members (totally-ordered multicast). mobile computers are resource-poor devices that communicate with a wired network through a number of spatially limited cells defining wireless links. the spatial coverage provided by wireless links may be either complete or incomplete, which makes the overall system model both general and realistic. the proposed protocol is simple and does not require any hand-off in the wired network upon movements of group members. moreover, there is no part of the protocol requiring that group members do not move during its execution. this feature leads to mobility assumptions that are practical because they involve only the global movement of group members, e.g., assumptions of the form "a group member does not move very fast all the time".  alberto bartoli
architectural considerations for a new generation of protocols  the current generation of protocol architectures, such as tcp/ip or the iso suite, seem successful at meeting the demands of todays networks. however, a number of new requirements have been proposed for the networks of tomorrow, and some innovation in protocol structuring may be necessary. in this paper, we review some key requirements for tomorrow's networks, and propose some architectural principles to structure a new generation of protocols. in particular, this paper identifies two new design principles, application level framing and integrated layer processing. additionally, it identifies the presentation layer as a key aspect of overall protocol performance.  d. d. clark d. l. tennenhouse
local networking and internetworking in the v-system  local networking can be treated as a subset of internetworking for remote terminal access and file transfer. however, a distributed operating system, such as the v-system uses a local network more as an extended backplane than a fast, minature long-haul network.  this paper describes the use of server-based "intelligent gateways" to provide internetworking using standard protocols in conjunction with an efficient light-weight protocol for v ipc on a local network. besides providing good local network performance, this design allows a gateway to act as an access control mechanism, addressing some reliability and security issues that arise with local networks.  david r. cheriton
performance bounds in communication networks with variable-rate links in most network models for quality of service support, the communication links interconnecting the switches and gateways are assumed to have fixed bandwidth and zero error rate. this assumption of steadiness, especially in a heterogeneous internet-working environment, might be invalid owing to subnetwork multiple-access mechanism, link-level flow/error control, and user mobility. techniques are presented in this paper to characterize and analyze work-conserving communication nodes with varying output rate. in the deterministic approach, the notion of "fluctuation constraint," analogous to the "burstiness constraint" for traffic characterization, is introduced to characterize the node. in the statistical approach, the variable-rate output is modelled as an "exponentially bounded fluctuation" process in a way similar to the "exponentially bounded burstiness" method for traffic modelling. based on these concepts, deterministic and statistical bounds on queue size and packet delay in isolated variable-rate communication server-nodes are derived, including cases of single-input and multiple-input under first-come-first- serve queueing. queue size bounds are shown to be useful for buffer requirement and packet loss probability estimation at individual nodes. our formulations also facilitate the computation of end-to-end performance bounds across a feedforward network of variable-rate server-nodes. several numerical examples of interest are given in the discussion. kam lee
a mobile user location update and paging mechanism under delay constraints a mobile user location management mechanism is introduced that incorporates a distance based location update scheme and a paging mechanism that satisfies predefined delay requirements. an analytical model is developed which captures the mobility and call arrival pattern of a terminal. given the respective costs for location update and terminal paging, the average total location update and terminal paging cost is determined. an iterative algorithm is then used to determine the optimal location update threshold distance that results in the minimum cost. analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements. ian f. akyildiz joseph s. m. ho
measuring the scalability of parallel computer systems  this paper discusses scalability and outlines a specific approach to measuring the scalability of parallel computer systems. the relationship between scalability and speedup is described. it is shown that a parallel system is scalable for a given algorithm if and only if its speedup is unbounded. a technique is proposed that can be used to help determine whether a candidate model is correct, that is, whether it adequately approximates the system's scalability. experimental results illustrate this technique for both a poorly scalable and a very scalable system.  j. r. zirbas d. j. reble r. e. vankooten
a closer look at noahnet  noahnet is a robust, highly available, high bandwidth local area network (lan) architecture, in the implementation phase at the university of delaware. noahnet uses a distributed switch-oriented node topology, a flooding approach for message routing, and high bandwidth communication media. the purpose of this paper is to consider some of the important issues in detail such as: the various ways flood control can be implemented; their relative advantages/disadvantages; the functions of a node; and one possible implementation of a node in noahnet. expected performance of the noahnet in comparison to ethernet and token ring networks is also discussed. though noahnet uses more complex structure and protocol, we demonstrate that the overhead of using flooding in noahnet is minimal and that a noahnet node implementation is very simple and inexpensive. the paper concludes that noahnet provides features such as robustness, high availability, high throughput, and high communication band width at almost no additional cost.  d j faber g m parulkar