default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Brandwajn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Alexandre Brandwajn
, Thomas Begin:
Approximation Method for a Non-preemptive Multiserver Queue with Quasi-Poisson Arrivals. ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(1): 3:1-3:21 (2024)- 2022
- [c30]Alexandre Brandwajn, Thomas Begin:
A Note on the Determination of the Processing Capacity in a Multiserver Job System as a Model of Cloud Datacenters. CloudCom 2022: 49-52 - [c29]Thomas Begin, Alexandre Brandwajn, Alain Tchana:
Data center disaggregation: when and how much? FiCloud 2022: 62-66
2010 – 2019
- 2019
- [j32]Alexandre Brandwajn, Thomas Begin:
First-come-first-served queues with multiple servers and customer classes. Perform. Evaluation 130: 51-63 (2019) - 2018
- [j31]Alexandre Brandwajn, Thomas Begin, Hind Castel-Taleb, Tülin Atmaca:
A Study of Systems with Multiple Operating Levels, Probabilistic Thresholds and Hysteresis. IEEE Trans. Parallel Distributed Syst. 29(4): 748-757 (2018) - 2017
- [j30]Alexandre Brandwajn, Thomas Begin:
Multi-server preemptive priority queue with general arrivals and service times. Perform. Evaluation 115: 150-164 (2017) - 2016
- [j29]Alexandre Brandwajn, Thomas Begin:
Breaking the dimensionality curse in multi-server queues. Comput. Oper. Res. 73: 141-149 (2016) - [j28]Tülin Atmaca, Thomas Begin, Alexandre Brandwajn, Hind Castel-Taleb:
Performance Evaluation of Cloud Computing Centers with General Arrivals and Service. IEEE Trans. Parallel Distributed Syst. 27(8): 2341-2348 (2016) - [c28]Thomas Begin, Alexandre Brandwajn:
Predicting the System Performance by Combining Calibrated Performance Models of its Components: A Preliminary Study. ICPE 2016: 95-100 - 2014
- [j27]Alexandre Brandwajn, Thomas Begin:
Reduced complexity in M/Ph/c/N queues. Perform. Evaluation 78: 42-54 (2014) - 2013
- [c27]Thomas Begin, Alexandre Brandwajn:
A Note on the Accuracy of Several Existing Approximations for M/Ph/m Queues. COMPSAC Workshops 2013: 730-735 - 2012
- [j26]Alexandre Brandwajn, Thomas Begin:
A Recurrent Solution of PH/M/c/N-Like and PH/M/c-Like Queues. J. Appl. Probab. 49(1): 84-99 (2012) - [c26]Thomas Begin, Alexandre Brandwajn:
A Tool for Solving Ph/M/c and Ph/M/c/N Queues. QEST 2012: 205-206 - [c25]Alexandre Brandwajn, Thomas Begin:
An approximate solution for Ph/Ph/1 and Ph/Ph/1/N queues. ICPE 2012: 57-62 - 2011
- [c24]Alexandre Brandwajn, Thomas Begin:
Performance Evaluation of a Single Node with General Arrivals and Service. ASMTA 2011: 85-98 - 2010
- [j25]Thomas Begin, Bruno Baynat, Francis Sourd, Alexandre Brandwajn:
A DFO technique to calibrate queueing models. Comput. Oper. Res. 37(2): 273-281 (2010) - [j24]Thomas Begin, Alexandre Brandwajn, Bruno Baynat, Bernd E. Wolfinger, Serge Fdida:
High-level approach to modeling of observed system behavior. Perform. Evaluation 67(5): 386-405 (2010)
2000 – 2009
- 2009
- [j23]Alexandre Brandwajn, Thomas Begin:
Higher-order distributional properties in closed queueing networks. Perform. Evaluation 66(11): 607-620 (2009) - [c23]Alexandre Brandwajn, Thomas Begin:
Preliminary Results on a Simple Approach to G/G/c-Like Queues. ASMTA 2009: 159-173 - [c22]Thomas Begin, Alexandre Brandwajn:
Considerations in Workload Characterization for Parallel Access Volumes. Int. CMG Conference 2009 - [c21]Alexandre Brandwajn, Thomas Begin:
A Note on the Effects of Service Time Distribution in the M/G/1 Queue. SPEC Benchmark Workshop 2009: 138-144 - 2008
- [j22]Farid Benbadis, Katia Obraczka, Jorge Cortés, Alexandre Brandwajn:
Exploring Landmark Placement Strategies for Topology-Based Localization in Wireless Sensor Networks. EURASIP J. Adv. Signal Process. 2008 (2008) - [j21]Alexandre Brandwajn, Hongyun Wang:
A conditional probability approach to M/G/1-like queues. Perform. Evaluation 65(5): 366-381 (2008) - [i1]Thomas Begin, Alexandre Brandwajn:
Note sur les temps de service résiduels dans les systèmes type M/G/c. CoRR abs/0802.1176 (2008) - 2007
- [j20]Thomas Begin, Alexandre Brandwajn, Bruno Baynat, Bernd E. Wolfinger, Serge Fdida:
High-level approach to modeling of observed system behavior. SIGMETRICS Perform. Evaluation Rev. 35(3): 34-36 (2007) - [c20]Thomas Begin, Alexandre Brandwajn, Bruno Baynat, Bernd E. Wolfinger, Serge Fdida:
Towards an Automatic Modeling Tool for Observed System Behavior. EPEW 2007: 200-212 - [c19]Farid Benbadis, Katia Obraczka, Jorge Cortés, Alexandre Brandwajn:
Exploring Landmark Placement Strategies for Self-Localization in Wireless Sensor Networks. PIMRC 2007: 1-5 - 2003
- [j19]Alexandre Brandwajn:
A model of periodic acknowledgement. Perform. Evaluation 52(4): 221-235 (2003) - [c18]Alexandre Brandwajn:
An Approach to Modeling FICON Channel Performance. Int. CMG Conference 2003: 129-137 - 2002
- [j18]Alexandre Brandwajn:
A note on SCSI bus waits. SIGMETRICS Perform. Evaluation Rev. 30(2): 41-47 (2002) - [c17]Alexandre Brandwajn:
Insight through simplicity. Int. CMG Conference 2002: 379-386 - 2000
- [e1]Alexandre Brandwajn, Jim Kurose, Philippe Nain:
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, Santa Clara, CA, USA, June 18-21, 2000. ACM 2000, ISBN 1-58113-194-1 [contents]
1990 – 1999
- 1998
- [c16]Alexandre Brandwajn:
Fast decomposition in large stochastic models. SMC 1998: 3073-3078 - 1994
- [c15]Alexandre Brandwajn, David E. Levy:
A Study of Cached RAID5 I/O. Int. CMG Conference 1994: 393-404 - 1993
- [j17]Alexandre Brandwajn, Anil K. Sahai:
Aspects of the Solution of Some Multiclass Loss Systems. Perform. Evaluation 17(2): 141-154 (1993)
1980 – 1989
- 1989
- [j16]Alexandre Brandwajn, Anil K. Sahai:
A Note on Approximate Iterative Solution of Open Tandem Networks with Blocking. Perform. Evaluation 10(3): 211-218 (1989) - [c14]Alexandre Brandwajn:
Performance Benefits of Parallelism in Cached DASD Controllers. Int. CMG Conference 1989: 123-140 - 1988
- [j15]Alexandre Brandwajn, Yung-Li Lily Jow:
An Approximation Method for Tandem Queues with Blocking. Oper. Res. 36(1): 73-83 (1988) - [j14]Alexandre Brandwajn:
Load Imbalance in DASD Dynamic Reconnection. Inf. Process. Lett. 28(3): 111-119 (1988) - 1986
- [c13]Alexandre Brandwajn:
Modeling DASDs and Disk Caches. Int. CMG Conference 1986: 206-216 - 1985
- [j13]Alexandre Brandwajn:
Equivalence and Decomposition in Queueing Systems - A Unified Approach. Perform. Evaluation 5(3): 175-186 (1985) - [c12]Alexandre Brandwajn, Yung-Li Lily Jow:
A Note on Service Interruptions. SIGMETRICS 1985: 140-146 - 1984
- [c11]Alexandre Brandwajn, William M. McCormack:
Efficient Approximation for Models of Multiprogramming with Shared Domains. SIGMETRICS 1984: 186-194 - 1983
- [j12]Alexandre Brandwajn:
Models of DASD Subsystems with Multiple Access Paths: A Throughput-Driven Approach. IEEE Trans. Computers 32(5): 451-463 (1983) - [c10]Alexandre Brandwajn:
Aspects of DASD Performance. Int. CMG Conference 1983: 374-382 - [c9]Alexandre Brandwajn:
A study of dynamic reconnection. SIGMETRICS 1983: 1-11 - 1982
- [j11]Alexandre Brandwajn:
A Finite Difference Equations Approach to a Priority Queue. Oper. Res. 30(1): 74-81 (1982) - [c8]Alexandre Brandwajn:
Fast Approximate Solution of Multiprogramming Models. SIGMETRICS 1982: 141-149 - 1981
- [j10]Alexandre Brandwajn:
Models of DASD subsystems: Basic model of reconnection. Perform. Evaluation 1(3): 263-281 (1981) - [j9]Alexandre Brandwajn, Jean-Alain Hernandez:
A Study of a Mechanism for Controlling Multiprogammed Memory in an Interactive System. IEEE Trans. Software Eng. 7(3): 321-331 (1981) - 1980
- [j8]Alexandre Brandwajn, René Joly:
A Scheme for Fault-Tolerant Virtual Memory. Inf. Process. Lett. 10(2): 99-103 (1980) - [c7]Alexandre Brandwajn:
Further results on equivalence and decomposition in queueing network models. Performance 1980: 93-104
1970 – 1979
- 1979
- [j7]Alexandre Brandwajn:
An Iterative Solution of Two-Dimensional Birth and Death Processes. Oper. Res. 27(3): 595-605 (1979) - [c6]Alexandre Brandwajn, Jean-Alain Hernandez, René Joly, Philippe Kruchten:
Overview of the ARCADE System. ISCA 1979: 42-49 - [c5]Alexandre Brandwajn, Jean-Alain Hernandez:
A Study of a Mechanism for Controlling Multiprogrammed Memory in an Interacitve System. Performance 1979: 487-500 - 1978
- [j6]Alexandre Brandwajn, Philippe Kruchten, Jean-Alain Hernandez:
ARCADE - A System for Research and Education in Computer Architecture. Inf. Process. Lett. 7(2): 78-85 (1978) - 1977
- [j5]Alexandre Brandwajn, B. Mouneix:
A Study of a Page-on-Demand System. Inf. Process. Lett. 6(4): 125-132 (1977) - [j4]Alexandre Brandwajn:
A Queueing Model of Multiprogrammed Computer Systems Under Full Load Conditions. J. ACM 24(2): 222-240 (1977) - [c4]Alexandre Brandwajn:
A Study of a Page-On-Demand System. Modelle für Rechensysteme 1977: 163-174 - 1976
- [j3]Alexandre Brandwajn:
A Model of a Virtual Memory System. Acta Informatica 6: 365-386 (1976) - [j2]Alexandre Brandwajn:
Simulation of the load of an interactive system. SIGMETRICS Perform. Evaluation Rev. 5(2): 69-92 (1976) - 1975
- [c3]Alexandre Brandwajn:
A Model of a Time-Sharing System with two Classes of Processes. GI Jahrestagung 1975: 547-566 - 1974
- [j1]Alexandre Brandwajn:
A Model of a Time Sharing Virtual Memory System Solved Using Equivalence and Decomposition Methods. Acta Informatica 4: 11-47 (1974) - [c2]Alexandre Brandwajn:
Equivalence and decomposition methods with application to a model of a time-sharing virtual memory system. Symposium on Operating Systems 1974: 56-88 - 1973
- [c1]Erol Gelenbe, Dominique Potier, Alexandre Brandwajn, Jacques Lenfant:
Gestion Optimale d'un Ordinateur Multiprogramme à Mémoire Virtuelle. Optimization Techniques 1973: 132-143
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
