waashk/acm huggingface dataset:
researches in network development of junet  junet was developed in order to provide a testing environment for studies of computer networking and distributed processing by connecting a large number of computers and by providing actual services for the users. research interests in development of the network have been focused on resource name managing, japanese character handling and communication technologies.  for the name managements, the hierarchical domain concept is employed to construct a name space for the network, and a mechanism for text message exchange is implemented using the concept. an environment for text message exchange using japanese characters is achieved as results of general discussions to handle 16-bit kanji codes in computers. efficient data transmissions with the high speed modems are achieved by a new uucp protocol and the dial-up ip link mechanism developed with a tty driver which provides host-to-modem flow control mechanism.  as the result of researches described above, junet currently connects various types of organizations relating computer science which are 87 organizations with more than 250 computers in number. it connects universities and major research laboratories in japan, and the protocols currently used are tcp/ip over leased lines as well as dial-up lines, and uucp over dial-up lines. the services such as electronic mail and network news have been provided since the network was started, and special technologies for japanese character handling, name servers, and multimedia mail supports have been developed.  in this paper, the current status of junet and its research results in development of the network are described.  j. murai a. kato
instruction set design issues relating to a static dataflow computer  in an effort to minimize traffic in the distribution network of a static dataflow machine the design of the system includes alternate data paths so that data movement may take place over "shorter" paths when it is permissible to do so. the main emphasis of this approach is to allow rapid transfer of data in sequential code segments residing in single memory blocks. this decreases crowding in the more expensive distribution network utilized by data that fans out to two or more blocks as required when more concurrent activity is to be initiated during the execution of the program. the objective of data movement minimization has also influenced the design of the instruction set. in this case, composite, that is, "multi-actor" instructions have been proposed as an effective strategy. this has been done without compromizing the utility of the instructions or overly increasing the time and space requirements of their execution. in the paper, these principles are illustrated by defining controlled instructions that are especially useful in the management of loops.  f. j. burkowski
combined tuning of rf power and medium access control for wlans  mobile communications, such as handhelds and laptops, still suffer from short operation time due to limited battery capacity. we exploit the approach of protocol harmonization to extend the time between battery charges in mobile devices using an ieee 802.11 network interface. many known energy saving mechanisms only concentrate on a single protocol layer while others only optimize the receiving phase by on/off switching. we show, that energy saving is also possible during the sending process. this is achieved by a combined tuning of the data link control and physical layer. in particular, harmonized operation of power control and medium access control will lead to reduction of energy consumption. we show a rf power and medium access control trade-off. furthermore we discuss applications of the results in ieee 802.11 networks.
a simulation based study of tlb performance  this paper presents the results of a simulation-based study of various translation lookaside buffer (tlb) architectures, in the context of a modern vlsi risc processor. the simulators used address traces, generated by instrumented versions of the spec marks and several other programs running on a decstation 5000. the performance of two-level tlbs and fully-associative tlbs were investigated. the amount of memory mapped was found to be the dominant factor in tlb performance. small first-level fifo instruction tlbs can be effective in two level tlb configurations. for some applications, the cyles-per-instruction (cpi) loss due to tlb misses can be reduced from as much as 5cpi to negligible levels with typical tlb parameters through the use of variable-sized pages.  j. bradley chen anita borg norman p. jouppi
simulation of a market model for distributed control  decentralized control in the allocation of computing resources to tasks in a multiprocessing environment is designed using a general concept of a market. two different market models are developed: auction and barter. in both cases, the tasks compete among themselves for computing resources rather than having them assigned by a host. definite relationships between market strategy and system performance were found. moreover, the results varied with machine configuration and appear applicable to systems of distributed control.  ross a. gagliano martin d. fraser mark e. schaefer
measurement and evaluation of the mips architecture and processor  mips is a 32-bit processor architecture that has been implemented as an nmos vlsi chip. the instruction set architecture is risc-based. close coupling with compilers and efficient use of the instruction set by compiled programs were goals of the architecture. the mips architecture requires that the software implement some constraints in the design that are normally considered part of the hardware implementation. this paper presents experimental results on the effectiveness of this processor as a program host. using sets of large and small benchmarks, the instruction and operand usage patterns are examined both for optimized and unoptimized code. several of the architectural and organizational innovations in mips, including software pipeline scheduling, multiple-operation instructions, and word-based addressing, are examined in light of this data.  thomas r. gross john l. hennessy steven a. przybylski christopher rowen
improved algorithms for synchronizing computer network clocks  the network time protocol (ntp) is widely deployed in the internet to synchronize computer clocks to each other and to international standards via telephone modem, radio and satellite. the protocols and algorithms have evolved over more than a decade to produce the present ntp version 3 specification and implementations. most of the estimated deployment of 100,000 ntp servers and clients enjoy synchronization to within a few tens of milliseconds in the internet of today.  this paper describes specific improvements developed for ntp version 3 which have resulted in increased accuracy, stability and reliability in both local- area and wide-area networks. these include engineered refinements of several algorithms used to measure time differences between a local clock and a number of peer clocks in the network, as well as to select the best ensemble from among a set of peer clocks and combine their differences to produce a clock accuracy better than any in the ensemble.  this paper also describes engineered refinements of the algorithms used to adjust the time and frequency of the local clock, which functions as a disciplined oscillator. the refinements provide automatic adjustment of message-exchange intervals in order to minimize network traffic between clients and busy servers while maintaining the best accuracy. finally, this paper describes certain enhancements to the unix operating system software in order to realize submillisecond accuracies with fast workstations and networks.  david l. mills
a novel adaptive hybrid arq scheme for wireless atm networks  this paper describes the design and performance of a novel adaptive hybrid arq scheme using concatenated fec codes for error control over wireless atm networks. the wireless links are characterized by higher, time - varying error rates and burstier error patterns in comparison with the fiber - based links for which atm was designed. the purpose of the hybrid arq scheme is to provide a capability to dynamically support reliable atm - based transport over wireless channels by using a combination of our arq scheme called sdlp and the concatenated fec scheme. the key ideas in the proposed hybrid arq scheme are to adapt the code rate to the channel conditions using incremental redundancy and to increase the starting code rate as much as possible with the concatenated fec, maximizing the throughput efficiency. the numerical results show that our proposed scheme outperforms other arq schemes for all snr values.  inwhee joe
analytical modeling and architectural modifications of a dataflow computer  dataflow computers are an alternative to the von neumann architectures and are capable of exploiting large amount of parallelism inherent in many computer applications. this paper deals with the performance analysis of the manchester dataflow computer based on queueing network models. the model of the dataflow computer has been validated by comparing the analytical results with those obtained from the prototype manchester dataflow computer. the bottleneck centers in the prototype machine have been identified through the model and various architectural modifications have been investigated both from performance and reliability viewpoints.  d. ghosal l. n. bhuyan
scheduling data broadcast in asymmetric communication environments  with the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to wireless clients are of significant interest. the environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the clients. in such environments, often it is not possible (or not desirable) for the clients to send explicit requests to the server. it has been proposed that in such systems the server should broadcast the data periodically. one challenge in implementing this solution is to determine the schedule for broadcasting the data, such that the wait encountered by the clients is minimized. a broadcast schedule determines what is broadcast by the server and when. in this paper, we present algorithms for determining broadcast schedules that minimize the wait time. broadcast scheduling algorithms for environments subject to errors, and systems where different clients may listen to different number of broadcast channels are also considered. performance evaluation results are presented to demonstrate that our algorithms perform well.  nitin h. vaidya sohail hameed
an effective scheme for pre-emptive priorities in dual bus metropolitan area networks  the ieee 802.6 standard for metropolitan area networks does not provide multiple priority traffic for connectionless data services. a priority mechanism that was considered for the standard showed to be not effective. as of now, there exists no protocol for multiple access dual bus networks that is able to implement pre-emptive priorites and, at the same time, can satisfy minimal fairness requirements for transmissions at the highest priority level. in this study, a protocol with strictly pre-emptive priorities, i.e., a protocol that does not admit low priority traffic if the load from high priority traffic exceeds the capacity of the transmission channel, is presented. the protocol is derived from a unique bandwidth allocation scheme with a full utilization of the bus capacity, with a fair distribution of bandwidth respective to traffic from a particular priority level and with pre- emptive priorities. the performance of the presented protocol is compared to a priority mechanism that is based on the bandwidth balancing mechanism. it is shown that adopting the new protocol results in shorter access delays for high priority transmissions.  jörg liebeherr ian f. akyildiz asser n. tantawi
a conceptual framework for network and client adaptation  modern networks are extremely complex, varying both statically and dynamically. this complexity and dynamism are greatly increased when the network contains mobile elements. a number of researchers have proposed solutions to these problems based on dynamic adaptation to changing network conditions and application requirements. this paper summarizes the results of several such projects and extracts several important general lessons learned about adapting data flows over difficult network conditions. these lessons are then formulated into a conceptual framework that demonstrates how a few simple and powerful ideas can describe a wide variety of different software adaptation systems. this paper describes an adaptation framework in the context of the several successful adaptation systems and suggests how the framework can help researchers think about the problems of adaptivity in networks.  b. badrinath armando fox leonard kleinrock gerald popek peter reiher m. satyanarayanan
a new cache replacement scheme based on backpropagation neural networks in this paper, we present a new neural network-based algorithm, **kora** (_k_halid shad_o_w _r_eplacement _a_lgorithm), that uses backpropagation neural network (bpnn) for the purpose of guiding the line/block replacement decisions in cache. this work is a continuation of our previous research presented in [1]-[3]. the kora algorithm attempts to approximate the replacement decisions made by the optimal scheme (opt). the key to our algorithm is to identify and subsequently discard the dead lines in cache memories. this allows our algorithm to provide better cache performance as compared to the conventional lru (least recently used), mru (most recently used), and fifo (first in first out) replacement policies. extensive trace- driven simulations were performed for 30 different cache configurations using different spec (standard performance evaluation corp.) programs. simulation results have shown that kora can provide substantial improvement in the miss ratio over the conventional algorithms. our work opens new dimensions for research in the development of new and improved page replacement schemes for virtual memory systems and disk caches. humayun khalid
architectural and performance evaluation of giganet and myrinet interconnects on clusters of small-scale smp servers  giganet and myrinet are two of the leading interconnects for clusters of commodity computer systems. both provide memory-protected user-level network interface access, and deliver low- latency and high-bandwidth communication to applications. giganet is a connection-oriented interconnect based on a hardware implementation of virtual interface (vi)architecture and asynchronous transfer mode (atm) technologies. myrinet is a connection-less interconnect which leverages packet switching technologies from experimental massively parallel processors (mpp) networks. this paper investigates their architectural differences and evaluates their performance on two commodity clusters based on two generations of symmetric multiple processors (smp) servers. the performance measurements reported here suggest that the implementation of message passing interface (mpi) significantly affects the cluster performance. although mpich-gm over myrinet demonstrates lower latency with small messages, the polling-driven implementation of mpich-gm often leads to tight synchronization betweencommunication processes and higher cpu overhead.  jenwei hsieh tau leng victor mashayekhi reza rooholamini
assigning codes in wireless networks: bounds and scaling properties  in the code division multiple access (cdma) framework, collisions that can occur in wireless networks are eliminated by assigning orthogonal codes to stations, a problem equivalent to that of coloring graphs associated to the physical network. in this paper we present new upper and lower bounds for two versions of the problem (hidden and primary collision avoidance -- hp- ca -- or hidden collision avoidance only -- h-ca). in particular, optimal assignments for special topologies and heuristics for general topologies are proposed. the schemes show better average results with respect to existing alternatives. furthermore, the gaps between the upper bound given by the heuristic solution, the lower bound obtained from the maximum-clique problem, and the optimal solution obtained by branch and bound are investigated in the different settings. a scaling law is then proposed to explain the relations between the number of codes needed in euclidean networks with different station densities and connection distances. the substantial difference between the two versions hp-ca and h-ca of the problem is investigated by studying the probabilistic distribution of connections as a function of the distance, and the asymptotic size of the maximum cliques.  roberto battiti alan a. bertossi maurizio a. bonuccelli
command execution in a heterogeneous environment  as a user's computing environment grows from a single time-shared host to a network of specialized and general-purpose machines, the capability for the user to access all of these resources in a consistent and transparent manner becomes desirable. instead of viewing commands as binary files, we expect the user to view commands as services provided by servers in the network. the user interacts with a personal workstation that locates and executes services on his behalf.  executing a single service provided by any server in the network is useful, but the user would also like to combine services from different machines to perform complex computations. to provide this facility we expand on the unix notion of pipes to a generalized pipeline mechanism containing services from a variety of servers. in this paper we explain the merits of a multi-machine pipeline for solving problems of accessing services in a heterogeneous environment. we also give a design and performance evaluation of a general mechanism for multi-machine pipes using the darpa udp and tcp protocols.  j t korb c e wills
use of tcp decoupling in improving tcp performance over wireless networks we propose using the tcp decoupling approach to improve a tcp connection's goodput over wireless networks. the performance improvement can be analytically shown to be proportional to , where mtu is the maximum transmission unit of participating wireless links and hp_sz is the size of a packet containing only a tcp/ip header. for example, on a wavelan [32] wireless network, where mtu is 1500 bytes and hp_sz is 40 bytes, the achieved goodput improvement is about 350%. we present experimental results demonstrating that tcp decoupling outperforms tcp reno and tcp sack. these results confirm the analysis of performance improvements.
a simple and efficient routing protocol for the umts access network  this paper presents a simple network layer protocol that integrates routing and connectionless transfer of data in a wireless environment. the protocol is specifically geared towards supporting transfer of signalling in mobile networks based on a rooted tree topology. exploiting the special characteristics of such a topology allows the specification of a very simple and processing efficient routing function. using the routing function, a connectionless message transport service is implemented. the connec- tionless transport service is comparable to that of typical network layer protocols of existing data networks. the protocol has originally been specified to carry signalling messages in the control plane of mobile, cellular systems but has the potential to be used also in other environments.  håkan mitts harri hansen
a comparison study of the two-tier and the single-tier personal communications services systems  a two-tier pcs system integrates the high tier pcs system and the low tier pcs systems into a single system to provide the advantages of both tiers. such a system is expected to provide better service (more available and more cost effective to the users) at the expense of the extra tier switching management. we compare the performance of the two-tier pcs system and the single low tier system in two aspects: the registration traffic and the service availability. because of the tier management, the two- tier system generates more registration traffic than the single low tier system. under the range of the input parameters in our study, we show that the two-tier system generates less than 10cases and generates less than 20system is better than the single one tier system. we also study the probability that a call is forced terminated in the single low tier system because the low tier becomes unavailable during the call (such a call can be continued in the two- tier system).  yi-bing lin
optical link and processor clustering in the delft parallel processor  the avoidance of transfer-bound processing in large parallel computers is first analyzed with respect to the processor interconnectability. a quantitative measure is introduced for the processor substask interactivity, based on the number on nonzeroes in the interaction matrix. a similar quantitative measure can be introduced for the processor interconnectability in case of a multi-bus communication system. for a parallel computer with p processors and p busses the asymptotic speedup for large p is proportional to p, both for tightly and loosely coupled tasks. in case of 2-level parallelization considerably more speedup can be obtained by application of powerful interconnects at both levels. as to the question compute- versus transfer-bound processing, it is discussed that also the choice of the data exchange protocol is of great importance. it proves that the 'newspaper' protocol in combination with full processor interconnectability is an appropriate way to avoid transfer-bound processing. for a parallel computer with many processors one global newspaper for all processors may frequently result in a too small efficiency. an improvement can be obtained through the introduction of a multi-newspaper protocol, based on the interaction matrix as a function of time. it is elucidated that this protocol requires dynamic processor clustering during a parallel run. the delft parallel processor dpp84 (with maximally 16 processors) is mentioned as an example of a parallel processor, based on complete processor interconnectability, where electrical interconnects have been applied. it is discussed that for large parallel computers, like the dpp8x (with maximally 1000 processors) full interconnectability is only feasible by the way of optical interconnects, consisting of a combination of optical wave guides and free space kaleidoscopic devices and provided with multi-input, multi-output electro-to- optic and opto-o-electric transducers. as an example of an opto-to-electric transducer, the powerram is discussed. this transducer has been realized as a prototype multi-accessible processor input memory ic capable to accept a multi-variable input in one data transfer clock cycle.  l. dekker e. e. e. frietman
design issues in multimedia messaging for next generation wireless systems  current wireless systems allow simple messaging services such as one- or two- way text messaging using short messaging service (sms), paging and voicemail.  motivated by the convergence of messaging (eg., emails) with information services (eg., request for stock quotes), entertainment (eg., interactive games), commerce (eg., advertisements) etc. in the wireless space, emerging wireless telecommunication systems envisage messaging applications with much richer media involving audio, video, web and text.  in this paper, we discuss various design issues that arise in multimedia messaging from a telecommunications carrier point of view. we present a simple system design that addresses many of these issues, a key challenge being data management of (shared) multimedia messaging content.  darin nelson s. muthukrishnan